Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms

Applied Mathematical Modelling

Volumn 36, Issue 11, 2012, Pages 5709-5726

  Niksirat, Malihe ^a   Ghatee, Mehdi ^a   Mehdi Hashemi, S ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Bi direction search; Congestion level; K shortest path problem; Metaheuristic algorithms; Multimodal networks

Indexed keywords

BI-DIRECTION; CONGESTION LEVEL; K SHORTEST PATH; META HEURISTIC ALGORITHM; MULTIMODAL NETWORK;

ALGORITHMS; GRAPH THEORY; SIMULATED ANNEALING;

TRANSPORTATION ROUTES;

EID: 84864032740     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.01.007     Document Type: Article

References (31)

1. Sengupta A., Pal T.K., Chakraborty D. Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. Fuzzy Sets Syst. 2001, 119:129-138.
2. M. Ziegelmann Constrained shortest paths and related problems, PhD thesis, Max-Planck Institute für Informatik, Germany, 2001. http://www.mpi-sb.mpg.de/~mark/.
3. Eppstin D. Finding k shortest path. SIAM J. Comput. 1998, 28:652-673.
4. C. Barrett, K. Bisset, R. Jacob, G. Konjevod, M. Marathe, Classical and contemporary shortest path problems in road networks, implementation and experimental analysis of the TRANSIMS Router, in: Proceedings of ESA 2002, 10th Annual European Symposium, 17-21 September 2002, Springer-Verlag.
5. A. Hobeika, TRANSIMS Fundamentals, chapter 5, route planner, Technical Report, Virginia Polytechnic University, 2005.
6. M. Battista, M. Lucertini, B. Simeone, Path composition and multiple choice in bimodal transportation network, in: Proceedings of the Seventh WCTR, Sydney, Australia, 1995.
7. Modesti P., Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks. Eur. J. Oper. Res. 1998, 111:495-508.
8. F.H. Meng, L. Yizhi, L.H. Wai, A multi-criteria, multi-modal passenger route advisory system, in: Proceedings IES-CTR International Symposium, 1999.
9. Ziliaskopoulos K., Wardell W. An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. Eur. J. Oper. Res. 2000, 125:486-502.
10. Lozano A., Storchi G. Shortest viable path algorithm in multimodal networks. Transp. Res. Part A 2001, 35:225-241.
11. Bielli M., Boulmakoul A., Mouncif H. Object modeling and path computation for multimodal travel systems. Eur. J. Oper. Res. 2006, 175:1705-1730.
12. S. Pallottino, M.G. Scutella, Shortest path algorithms in transportation models: classical and innovative aspects, Technical Report, TR-97-06, Department of Informatics, University of Pisa, Italy, 1997.
13. Nie Y., Zhang H.M., Lee D.-H. Models and algorithms for the traffic assignment problem with link capacity constraints. Transp. Res. Part B 2004, 38:285-312.
14. Ahuja R.K., Magnanti T.L., Orlin J.B. Network flows: theory, algorithm and applications 1993, Prentice-Hall, Englewood Cliffs.
15. Ghatee M., Hashemi S.M., Zarepisheh M., Khorram E. Preemptive priority-based algorithms for fuzzy minimal cost flow problem: an application in hazardous materials transportation. Comput. Ind. Eng. 2009, 57:341-354.
16. M. Dorigo, T. Stutzle, Ant Colony Optimization, 2005 ISBN-81-203-2684-9.
17. H.B. Duan, X.F. Yu, Hybrid ACO using memetic algorithm for traveling salesman problem, in: Proceedings of the IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning, 2007; pp. 92--95.
18. Tseng L-Yu, Liang S.-C. A hybrid metaheuristic for the quadratic assignment problem. Comput. Optim. Appl. 2006, 34:85-113.
19. Karimi A., Nobahari H., Siarry P. Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions. Comput. Optim. Appl. 2010, 45:639-661.
20. Ghatee M., Hashemi S.M. Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly. Appl. Math. Comput. 2007, 188:555-566.
21. Ghatee M., Hashemi S.M. Optimal network design and storage management in petroleum distribution network under uncertainty. Eng. Appl. Artif. Intell. 2009, 22:796-807.
22. Z. Cai, Multi-direction searching ant colony optimization for traveling salesman problems, in: International Conference on Computational Intelligence and Security, vol. 2, 2008, pp. 220-223.
23. Eglese R. Simulated annealing: a tool for operational research. Eur. J. Oper. Res. 1990, 46:271-281.
24. Breedam A.V. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput. Oper. Res. 2001, 28:289-315.
25. The codes and the random networks are downloadable from http://www.math-cs.aut.ac.ir/~ghatee/links.html.
26. Chamayou J.M.F. Program for B-spline interpolation of surfaces with application to computer tomography. Comput. Phys. Commun. 1982, 27:187-199.
27. Feng Y., Yanjun L., Tie-Jun W. A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks. Physica A 2010, 389:629-636.
28. Hong K.L., YIP C.W., MAK B. Passenger route guidance system for multi-modal transit networks. J. Adv. Transport. 2005, 39:271-288.
29. Agarwal M., Sharma V.K. Ant colony approach to constrained redundancy optimization in binary systems. Appl. Math. Model. 2010, 34:992-1003.
30. H.B.Duan, X.F. Yu, X. Zhang, S. Shao, Three-dimension path planning for UCAV using hybrid meta-heuristic ACO-DE algorithm, Simulation Modelling Practice and Theory, 2009, doi:10.1016/j.simpat.2009.10.006.
31. Yang H.-H., Chen Y.-L. Finding K shortest looping paths with waiting time in a time-window network. Appl. Math. Model. 2006, 30:458-465.