Reliable single-allocation hub location problem with disruptions

Mehrdad Mohammadi; Payman Jula; Reza Tavakkoli-Moghaddam

doi:10.1016/j.tre.2019.01.008

Reliable single-allocation hub location problem with disruptions

Mehrdad Mohammadi (Corresponding author), Payman Jula, Reza Tavakkoli-Moghaddam

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

77 Citaten (Scopus)

Samenvatting

Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub location model considering hubs and links uncertainties to minimize both the total cost and the maximum transportation time. An efficient approximation approach is proposed to provide a lower bound for the optimal Pareto-frontier. We develop a new hybrid meta-heuristic algorithm to solve the model to near optimality. Our modelling and analysis of France transportation network shows that cost and delivery performance could be significantly improved.

Originele taal-2	Engels
Pagina's (van-tot)	90-120
Aantal pagina's	31
Tijdschrift	Transportation Research. Part E: Logistics and Transportation Review
Volume	123
DOI's	https://doi.org/10.1016/j.tre.2019.01.008
Status	Gepubliceerd - mrt. 2019
Extern gepubliceerd	Ja

Duurzame ontwikkelingsdoelstellingen van de VN

Deze output draagt bij aan de volgende duurzame ontwikkelingsdoelstelling(en)

Toegang tot document

10.1016/j.tre.2019.01.008

Andere bestanden en links

Link naar publicatie in Scopus

Citeer dit

@article{44b569fe447d4ee5bbeddebd7ac5c973,

title = "Reliable single-allocation hub location problem with disruptions",

abstract = "Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub location model considering hubs and links uncertainties to minimize both the total cost and the maximum transportation time. An efficient approximation approach is proposed to provide a lower bound for the optimal Pareto-frontier. We develop a new hybrid meta-heuristic algorithm to solve the model to near optimality. Our modelling and analysis of France transportation network shows that cost and delivery performance could be significantly improved.",

keywords = "Congestion, Disruption, Hub location problem, Hybrid metaheuristics, Multi-objective optimization",

author = "Mehrdad Mohammadi and Payman Jula and Reza Tavakkoli-Moghaddam",

year = "2019",

month = mar,

doi = "10.1016/j.tre.2019.01.008",

language = "English",

volume = "123",

pages = "90--120",

journal = "Transportation Research. Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier",

}

TY - JOUR

T1 - Reliable single-allocation hub location problem with disruptions

AU - Mohammadi, Mehrdad

AU - Jula, Payman

AU - Tavakkoli-Moghaddam, Reza

PY - 2019/3

Y1 - 2019/3

N2 - Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub location model considering hubs and links uncertainties to minimize both the total cost and the maximum transportation time. An efficient approximation approach is proposed to provide a lower bound for the optimal Pareto-frontier. We develop a new hybrid meta-heuristic algorithm to solve the model to near optimality. Our modelling and analysis of France transportation network shows that cost and delivery performance could be significantly improved.

AB - Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub location model considering hubs and links uncertainties to minimize both the total cost and the maximum transportation time. An efficient approximation approach is proposed to provide a lower bound for the optimal Pareto-frontier. We develop a new hybrid meta-heuristic algorithm to solve the model to near optimality. Our modelling and analysis of France transportation network shows that cost and delivery performance could be significantly improved.

KW - Congestion

KW - Disruption

KW - Hub location problem

KW - Hybrid metaheuristics

KW - Multi-objective optimization

UR - http://www.scopus.com/inward/record.url?scp=85060891655&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2019.01.008

DO - 10.1016/j.tre.2019.01.008

M3 - Article

AN - SCOPUS:85060891655

SN - 1366-5545

VL - 123

SP - 90

EP - 120

JO - Transportation Research. Part E: Logistics and Transportation Review

JF - Transportation Research. Part E: Logistics and Transportation Review

ER -

Reliable single-allocation hub location problem with disruptions

Samenvatting

Duurzame ontwikkelingsdoelstellingen van de VN

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit