Solving time-dependent multimodal transport problems using a transfer graph model

Ayed, Hedi; Galvez-Fernandez, C.; Habbas, Zineb; Khadraoui, Djamel

doi:10.1016/j.cie.2010.05.018

Cited by 45 publications

(41 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They developed a modified version of k-shortest path algorithm to define an efficient solution for the M-SP with time constraints. A new graph structure, namely transfer graph, was introduced by Ayed et al (2008Ayed et al ( , 2011 to model the multi-modal networks. A transfer graph is described by a set of sub-graphs called components (Ayed et al 2008).…”

Section: Literatures Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Toward algorithms for multi-modal shortest path problem and their extension in urban transit network

Liu

Yang

2014

J Intell Manuf

View full text Add to dashboard Cite

This paper investigates the algorithms of the multi-modal shortest path problem (M-SPP) under static and certain environment and their extension in urban transit network (UTN). The related M-SPP is one of the important and practical problems in several fields such as urban transportation system and freight transportation. Existing algorithms of various M-SPP are usually based on building a new network in terms of the hypergraph or transfer graph and implemented by extending the label correcting algorithm and label setting algorithm (LSA) in such a new network. The UTN is composed of multiple modes (e.g., automobile, bus, subway, light rail, pedestrian and so on) and, to get their destination, the users can alternate between different modes. As a special demand, the time-window is usually correlated with the M-SPP. In contrast to the algorithms for the classical M-SPP, the algorithms for the M-SPP in UTN are much complicated, particularly, these for the M-SPP with the switching delay and arriving time-window. In this paper, we consider the M-SPP with switching delay and that with both of the switching delay and arriving time-window. Firstly, a new approach is adopted to simplify the mathematical formulas of thes M-SPP with switching delay and then an improved LSA for the M-SPP with switching delay in the UTN is proposed. Afterwards, a reverse LSA is given to solve the M-SPP with both of switching delay and arriving time-window in the UTN. Finally, some examples are given to illustrate the labeling process of the designed algorithms.Keywords Shortest path problem (SPP) · Multi-modal shortest path problem (M-SPP) · Time-window · Label correcting algorithm (LCA) · Label setting algorithm (LSA)

show abstract

Section: Literatures Reviewmentioning

confidence: 99%

“…Follows from theoretical point of view, such an algorithm. Why such a bug occurs is that the LSA is performed on a virtual network which was, in terms of Ayed et al, later called as transfer graph (Ayed et al 2008(Ayed et al , 2011. To resolve this bug, we have tried two approaches.…”

Section: Introductionmentioning

confidence: 98%

Toward algorithms for multi-modal shortest path problem and their extension in urban transit network

Liu

Yang

2014

J Intell Manuf

View full text Add to dashboard Cite

show abstract

“…The first technique pre-compute of all possible paths between any two points (Jariyasunant et al, 2010). The second one uses a set of rules to build an abstract graph and a relevant graph where the shortest path can be easily found (Ayed et al, 2011). In the third technique, all the topologically similar paths which reach a given node are simultaneously updated (Ziliaskopoulos and Wardell, 2000).…”

mentioning

confidence: 99%

Techniques in Multimodal Shortest Path in Public Transport Systems

López

Lozano

2014

Transportation Research Procedia

View full text Add to dashboard Cite

Four techniques used to find shortest paths in multimodal transport networks are discussed. The first technique pre-compute of all possible paths between any two points (Jariyasunant et al., 2010). The second one uses a set of rules to build an abstract graph and a relevant graph where the shortest path can be easily found (Ayed et al., 2011). In the third technique, all the topologically similar paths which reach a given node are simultaneously updated (Ziliaskopoulos and Wardell, 2000). Finally, the fourth technique builds a transport network using a database with a hierarchical structure (Wang et al., 2009).

show abstract

“…Despite the reduction of computation time, requiring a large computational memory limits its capability in solving large-size problems. To eliminate this problem, Ayed et al (2009) developed Ant Colony optimization method which requires lower memory but longer computation time. Ayed et al (2011) extended previous research by developing a solution approach based on combination of Dijkstra algorithm and Ant Colony optimization method.…”

Section: Introductionmentioning

confidence: 99%

“…To eliminate this problem, Ayed et al (2009) developed Ant Colony optimization method which requires lower memory but longer computation time. Ayed et al (2011) extended previous research by developing a solution approach based on combination of Dijkstra algorithm and Ant Colony optimization method. Their combinatorial approach balance computation time and required computational memory.…”

Section: Introductionmentioning

confidence: 99%

A multimodal transportation system routing implemented in waste collection

Rabbani

Sadri²,

Rafiei³

2016

10.5267/j.dsl

View full text Add to dashboard Cite

Waste collection is an important municipal service that charges large expenditures to waste management (WM) system. In this study, a hierarchical structure is proposed in order to minimize total cost of waste collection routing problem. Moreover, in second stage destructive environmental effects of waste transportation are minimized concurrently through taking advantage of a road/rail transportation system. In the proposed multimodal transportation system, waste packs are transferred to final destination while travel time and risk of environmental threatening is minimized. The discussed problem is formulated mathematically in two stages. In the first stage, a household waste collection routing problem is formulated while, in second stage a multimodal transportation system is routed to transfer waste packs to final destination through roads and railroads. In order to solve the proposed NP hard models, an improved genetic algorithm is developed. Comparison of the obtained results with those of GAMS for small-size samples validates the proposed models.

show abstract

Solving time-dependent multimodal transport problems using a transfer graph model

Cited by 45 publications

References 13 publications

Toward algorithms for multi-modal shortest path problem and their extension in urban transit network

Toward algorithms for multi-modal shortest path problem and their extension in urban transit network

Techniques in Multimodal Shortest Path in Public Transport Systems

A multimodal transportation system routing implemented in waste collection

Contact Info

Product

Resources

About