2021
DOI: 10.4018/978-1-7998-5442-5.ch006
|View full text |Cite
|
Sign up to set email alerts
|

Routing Searching Algorithm for Combined Freight Transport Trips in South East Europe Region

Abstract: In this chapter, the authors propose a mixed integer linear programming model (MILP) to address the shortest path problem when trans-shipments exist on combined freight transport operations. The objective is to minimize trip duration, cost, and CO2 emissions. For solving this problem, we propose an extension of Dijkstra's algorithm that identifies the optimal way of cargo movement with trans-shipment. We applied the proposed algorithm in real-life data by embracing three different types of transportation modes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?