A Heuristic Optimal Path Search Considering Cumulative Transfer Functions

- Journal title : The Journal of The Korea Institute of Intelligent Transport Systems
- Volume 15, Issue 3, 2016, pp.60-67
- Publisher : The Korea Institute of Inteligent Transport Systems
- DOI : 10.12815/kits.2016.15.3.060

Title & Authors

A Heuristic Optimal Path Search Considering Cumulative Transfer Functions

Shin, Seongil; Baek, Nam Cheol; Nam, Doo Hee;

Shin, Seongil; Baek, Nam Cheol; Nam, Doo Hee;

Abstract

In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers`s travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

Keywords

Cumulative Transfer Function;Non Additive Travel Cost;Heuristic Optimal Route Search;K Ranking Path;

Language

Korean

Cited by

References

1.

Bellman R.(1957), "Dynamic Programming," Princeton University Press, Princeton, New Jersey.

2.

Gabriel S. and Bernstein D.(1997), "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, vol. 20, no. 5, pp.337-348.

3.

Yang Y., Zhang X. and Meng Q.(2004), "Modeling Private Highways in Networks with Entry-Exit Based Toll Charges," Transportation Research B, vol. 38, pp.191-213.

4.

Chen P. and Nie Y.(2013), "Bicriterion Shortest Path Problem with A General Nonadditive Cost," Social and Behavioral Sciences 80, pp.553-575.

5.

Martins E. Q. V.(1984), "An Algorithm for Ranking Paths that May Contain Cycles," European Journal of Operational Research, vol. 18, pp.123-130.

6.

Azevedo J. A., Costa M. E. O. S., Madeira J. J. E. R. S. and Martins E. Q. V.(1993), "An Algorithm from the Ranking of Shortest Paths," European Journal of Operational Research, vol. 69, pp.97-106.

7.

Shin S.(2004), "Finding the First K Shortest Loopless Paths in A Transportation Network," Journal of Korean Society of Transportation, vol. 22, no. 6, pp.121-131.

8.

Moore E. F.(1957), "The Shortest Path through A Maze," Proc. Int. Conf. on the Theory of Switching, Harvard Univ., Cambridge, MA.

9.

Dijkstra E. W.(1959), "A Note of Two Problems in Connected with Graphs," Numer. Math. 1, pp.269-271.

10.

Kirby R. F. and Potts R. B.(1969), "The Minimum Route Problem for Networks with Turn Penalties and Prohibitions," Transportation Research 3, pp.397-408.

11.

Lee M.(2015), "Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement," Ph.D. Thesis, University of Wisconsin at Madison.

12.

Shier R. D.(1979), "On Algorithm from Finding the K Shortest Paths in A Network," Networks, vol. 9, pp.195-214.

13.

Yen J. Y.(1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.

14.

15.

Bellman R. and Kalaba R.(1968), "On Kth Best Policies," J. SIAM 8, pp.5832-588.