Informatics and Applications
2015, Volume 9, Issue 2, pp 56-62
COMPARATIVE ANALYSIS OF APPLICATION OF HEURISTIC AND METAHEURISTIC ALGORITHMS TO THE SCHOOL BUS ROUTING PROBLEM
- E. M. Bronshtein
- D. M. Vagapova
Abstract
This paper considers the school bus routing problem, which is to ensure delivery of students after lessons from school to their stops. The objective function is to minimize the maximum length of the routes. A short review of the literature on this theme is provided. The problem definition and formalization is given. The heuristic algorithm proposed by the authors earlier is described. A two-step algorithm based on ant colony metaheuristics is described. The algorithm consists of initial clustering of stops at which students drop off, and subsequent ant colony optimization with different parameters, which is applied to each cluster. The results of comparing the efficiency of the proposed algorithms and the performance of the program for two algorithms are presented.
[+] References (14)
- Newton, R. M.,andW. H. Thomas. 1969. Designofschool Bus Routes by computer. Socio-Economic Planning Science 3:75-85.
- Archetti, C. Matheuristics for routing problems. Available at: http://www.sintef.no/contentassets/cfb19ab9
b7c74d03904c7746eeld8e77/matheuristics_routing_ verolog2014_new.pdf (accessed March 10, 2015).
- Bronshtein, E. M., D. M. Vagapova, and A. V. Nazmutdinova. 2014. O postroenii semeystva marshrutov dostavki shkol'nikov za minimal'noe vremya [About creating a set of delivery routes of students in a minimal time]. Avtomati
ka i Telemekhanika [Automation and Remote Control] 7:43-51.
- Fisher, M.L., and R.A. Jaikumar. 1981. Generalized assignment heuristic for vehicle routing. Networks 11(2):109-124.
- Bowerman, R., B. Hall, and P. A. Calamai. 1995. Multi-objective optimization approach to urban school Bus Routing: Formulation and solution method. Transportation Research Part A: Policy and Practice 29(2):107-123.
- Arias-Rojas, J. S., J. F Jimenez, and J. R. Montoya- Torres. 2012. Solving of school bus routing problem by ant colony. Revista EIA 9(17):193-208.
- Dorigo, M. 1992. Optimization, learning and natural algorithms. PhD Thesis. Milan, Italy: Politecnico di Milano.
- Gambardella, L. M., and M. Dorigo. 1995. Ant-Q: A re-inforcement learning approach to the traveling salesman problem. 12th Conference (International) on Machine Learning. Tahoe City. 252-260.
- Dorigo, M., V. Maniezzo, and A. Colorni. 1996. The Ant System: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernetics B 26(1):29-41.
- Dorigo, M., and L. M. Gambardella. 1997. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1):53-66.
- Stutzle, T, and H. Hoos. 1997. MAX-MIN Ant System and local search for the traveling salesman problem. IEEE Conference (International) on Evolutionary Computation. Indianapolis. 309-314.
- Shtovba, S.D. 2003. Murav'inye algoritmy [Ant colony algorithms]. Exponenta Pro. Matematika vprilozheniyakh [Exponenta-Pro. Mathematics in Applications] (4):70- 75.
- Kureychik, V. M., and A. A. Kazharov. 2008. O neko- torykh modifikatsiyakh murav'inogo algoritma [About some modifications of the ant colony algorithm]. Izvestiya Yuzhnogo Federal'nogo Universiteta. Tekhnicheskie Nauki [News of South Federal University. Technical Sciences] 81(4):7-12.
- Slastnikov, S. A. 2014. Primenenie metaevristicheskikh algoritmov dlya zadachi marshrutizatsii transporta [Application of metaheuristic algorithms for vehicle routing problem]. Ekonomika i Matematicheskie Metody [Economics and Mathematical Methods] 50(1):117-126.
[+] About this article
Title
COMPARATIVE ANALYSIS OF APPLICATION OF HEURISTIC AND METAHEURISTIC ALGORITHMS TO THE SCHOOL BUS ROUTING PROBLEM
Journal
Informatics and Applications
2015, Volume 9, Issue 2, pp 56-62
Cover Date
2015-02-30
DOI
10.14357/19922264150207
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
vehicle routing problem; school bus routing problem; ant colony optimization; clustering
Authors
E. M. Bronshtein and D. M. Vagapova
Author Affiliations
Ufa State Aviation Technical University, 12 K. Marx Str., Ufa 450000, Russian Federation
|