Optimizing the Service Network Design Problem for Railroad Intermodal Transportation of Hazardous Materials

The service network design problem is one of the key problems in the field of railroad intermodal transportation of hazardous materials (hazmat). It lies in determining the frequency of the trains and the allocation of both hazardous and ordinary shipments to these trains, as well as the railroad co...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of advanced transportation Ročník 2022; s. 1 - 17
Hlavní autori: Huang, Lixia, Zhao, Jun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Hindawi 26.06.2022
John Wiley & Sons, Inc
Wiley
Predmet:
Algorithms
Computer applications
Consumption
Cost analysis
Design optimization
Hazardous materials
Hazardous substances
Integer programming
Intermodal
Intermodal transportation
Materials handling
Methods
Mixed integer
Multiple objective analysis
Network design
Railroads
Sensitivity analysis
Shipments
Shipments data
Traffic congestion
Traffic flow
Trains
Transfer stations
Transportation
Transportation industry
Transportation planning
Transportation services
China
ISSN:0197-6729, 2042-3195
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The service network design problem is one of the key problems in the field of railroad intermodal transportation of hazardous materials (hazmat). It lies in determining the frequency of the trains and the allocation of both hazardous and ordinary shipments to these trains, as well as the railroad connecting plan of all shipments based on the established train formation plan. Based on a unified method, we build a multiobjective mixed-integer linear-programming model that comprehensively considers both hazardous and ordinary materials, the compatibility of goods and services, the capacity of the transfer station, and the delivery time limit of each shipment. An augmented ε-constraint algorithm is customized to solve the model. Computational results of a practical example in China show that an increase of 8.4 million yuan in the total cost could reduce nearly 24541 the total risk. Moreover, the algorithms comparison and sensitivity analysis indicate that the augmented ε-constraint algorithm is a more suitable approach to handle the model because of its advantage in the uniqueness of distinct nondominated solutions. Finally, the sensitivity analysis shows that the total cost and risk could simultaneously be reduced if the delivery time limit is relaxed or if the transfer time is shortened.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0197-6729
2042-3195
DOI:10.1155/2022/5191104