2000
DOI: 10.1016/s0377-2217(99)00388-4
|View full text |Cite
|
Sign up to set email alerts
|

An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
101
0

Year Published

2003
2003
2017
2017

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 177 publications
(101 citation statements)
references
References 7 publications
0
101
0
Order By: Relevance
“…The trips based on the static schedule data may make planned transfers infeasible if some transit vehicles are late. In the multimodal routing context, many works have studied the multimodal shortest viable path problem [5], [6]. Three main problems are considered: (1) the set of transit modes used to accomplish the desired path; (2) the number of modal transfers performed in the desired path; and (3) the computational time to find the best solution in real time.…”
Section: Multimodal Journey Plannersmentioning
confidence: 99%
“…The trips based on the static schedule data may make planned transfers infeasible if some transit vehicles are late. In the multimodal routing context, many works have studied the multimodal shortest viable path problem [5], [6]. Three main problems are considered: (1) the set of transit modes used to accomplish the desired path; (2) the number of modal transfers performed in the desired path; and (3) the computational time to find the best solution in real time.…”
Section: Multimodal Journey Plannersmentioning
confidence: 99%
“…What type of disturbances must be prevented and how must containers be re-planned in case of a disturbance? Not many models for the routing of containers in intermodal networks are available (Ziliaskopoulos and Wardell, 2000, Macharis and Bontekoning, 2004, Cho et al, 2010. Most existing approaches consider the routing of containers as a part of the more general network design problem.…”
Section: Planning Of Container Network Transportationmentioning
confidence: 99%
“…Boardman et al (1997) used a method that selects the cheapest path per container on a real-time basis. Ziliaskopoulos (2000) proposed a model that selects the leasttime path, considering dynamic travel and transfer times. Cho et al (2010) used a weighted constrained shortest path problem to minimise time and cost for transports between two network nodes.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The literature contains a number of approaches to intermodal freight planning (e.g., Caramia and Guerriero, 2009;Ziliaskopoulos and Wardell, 2000;Chang, 2008;Jansen et al, 2004). However, none of them applies to our problem since either (1) they do not handle all complicating factors that we need to consider, or (2) the combination of timetabled and demand driven transports are handled in an unsatisfactory way, e.g., by representing a demand driven transport as multiple timetabled departures, i.e., one for each time period.…”
Section: Transport Buyermentioning
confidence: 99%