Generating price-effective intermodal routes

Autor:	Gerhard F. Post, Joaquim A. S. Gromicho, Erwin Oudshoorn
Rok vydání:	2011
Předmět:	Statistics and Probability Operations research Computer science Suite Shortest path problem Statistics Probability and Uncertainty Service provider Dijkstra's algorithm Scheduling (computing)
Zdroj:	Statistica Neerlandica. 65:432-445
ISSN:	0039-0402
DOI:	10.1111/j.1467-9574.2011.00493.x
Popis:	We describe the problem of intermodal international freight transport that is faced by some logistic service providers and the solution that ORTEC’s logistic suite offers to these customers. This solution is based on a state of the art k -shortest path algorithm for directed networks. Our focus is on the modeling aspects of the problem. In particular, we propose an approach in two phases and methods to reduce the size of the network, so as to obtain a solution within an acceptable calculation time.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::de206c43d57e5e327ec6787aecbe40b7 https://doi.org/10.1111/j.1467-9574.2011.00493.x Zobrazit plný text záznamu Plný text ve formátu PDF