Bi-objective bus routing: An application to school buses in rural areas

Transportation Science

Volumn 47, Issue 3, 2013, Pages 397-411

  Pacheco, Joaquín ^a   Caballero, Rafael ^b   Laguna, Manuel ^c   Molina, Julián ^b  

^a UNIVERSITY OF BURGOS   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Bi objective optimization; Metaheuristics; Routing

Indexed keywords

GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; TABU SEARCH; VEHICLE ROUTING;

BI-OBJECTIVE OPTIMIZATION; META HEURISTICS; MIN-MAX CRITERION; NON- DOMINATED SORTING GENETIC ALGORITHMS; ROUTING; SOLUTION METHODS; SOLUTION PROCEDURE; VEHICLE ROUTING PROBLEM;

BUSES;

EID: 84882348990     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0437     Document Type: Article

References (85)

1. Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms and Applications (Prentice Hall, Englewood Cliffs, NJ).
2. Alabas-Uslu C (2008) A self-tuning heuristic for a multi-objective vehicle routing problem. J. Oper. Res. Soc. 59(7):988-996.
3. Alumur S, Kara BY (2007) A new model for the hazardous waste location-routing problem. Comput. Oper. Res. 34(5):1406-1423.
4. Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Series A 115(2):351-385.
5. Baldacci R, Toth P, Vigo D (2011) Exact solution of the capacitated vehicle routing problem. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Oxford, UK), 1795-1805.
6. Baugh JW, Kakivaya GKR, Stone JR (1998) Intractability of the diala-ride problem and a multiobjective solution using simulated annealing. Engrg. Optim. 30(2):91-123.
7. Beasley J (1983) Route-first cluster-second methods for vehicle routing. Omega 11(4):403-408.
8. Bolduc MC, Renaud J, Boctor F, Laporte G (2008) A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6):776-787.
9. Bowerman R, Hall B, Calamai P (1995) A multiobjective optimization approach to urban school bus routing: Formulation and solution method. Transportation Res. Part A Policy Practice 29(2):107-123.
10. Brandão J (2011) A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Oper. Res. 38(1):140-151.
11. Bräysy O (2003) A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15(4):347-368.
12. Caballero R, Molina J, Rodríguez-Uría V (2003) MOAMP: Programación multiobjetivo mediante un Procedimiento de Búsqueda Tabú. II Congreso Español de Metaheurísticas y Algoritmos Evolutivos y Bioinspirados (MAEB), Gijón, Spain.
13. Caballero R, Gonzalez M, Guerrero FM, Molina J, Paralera C (2007) Solving a multiobjective location routing problem with a metaheuristic based on tabu search: Application to a real case in Andalusia. Eur. J. Oper. Res. 177(3):1751-1763.
14. Chang NB, Wei YL (1999) Strategic planning of recycling dropoff stations and collection network by multiobjective programming. Environ. Management 24(2):247-263.
15. Chang TS, Nozick LK, Turnquist MA (2005) Multiobjective path finding in stochastic dynamic networks with application to routing hazardous material shipments. Transportation Sci. 39(3):383-399.
16. Cheng L, Subrahmanian E, Westerberg AW (2005) Multiobjective decision process under uncertainty: Applications, problem formulations and solution strategies. Indust. Engrg. Chemistry Res. 44(8):2405-2415.
17. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568-581.
18. Corberán A, Fernández E, Laguna M, Martí R (2002) Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 53(4):427-435.
19. Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8):928-936.
20. Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science (North-Holland, Amsterdam), 367-428.
21. Current J, Marsh M (1993) Multiobjective transportation network design and routing problems: Taxonomy and annotation. Eur. J. Oper. Res. 65(1):4-19.
22. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Comput. 6(2):182-197.
23. Delgado C (2002) Nuevas Técnicas Metaheurísticas: Aplicación al Transporte Escolar. Ph.D. thesis, Departamento de Economía Aplicada, Universidad de Burgos, Spain.
24. Delgado C, Pacheco J (2001) MinMax vehicle routing problems: Application to school transport in the province of Burgos. Lecture Notes Econom. Math. Systems 505:297-318.
25. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
26. Doerner K, Focke A, Gutjahr WJ (2007) Multicriteria tour planning for mobile healthcare facilities in a developing country. Eur. J. Oper. Res. 179(3):1078-1096.
27. Doerner KF, Fuellerer G, Hartl RF, Gronalt M, Lori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294-307.
28. Duhamel C, Lacomme P, Prodhon C (2011) Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4):723-739.
29. Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP-ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11):1912-1923.
30. Fisher ML (1994) Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4):626-642.
31. Fisher ML, Jaikumar R (1981) A generalized assignment heuristics for vehicle routing problem. Networks 11(2):109-124.
32. Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3):596-615.
33. Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming Series. A 106(3):491-511.
34. Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Corne D, Dorigo M, Glover F, eds. New Ideas in Optimization (McGraw-Hill, London), 63-76.
35. García I, Pacheco J, Alvarez A (2012) Optimizing routes and stock. J. Heuristics. Forthcoming.
36. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for vehicle routing problem. Management Sci. 40(10):1276-1290.
37. Giannikos I (1998) A multiobjective programming model for location treatment sites and routing hazardous wastes. Eur. J. Oper. Res. 104(2):333-342.
38. Gillet BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2):340-349.
39. Glover F (1989) Tabu search: Part I. INFORMS J. Comput. 1(3):190-206.
40. Glover F (1990) Tabu search: Part II. INFORMS J. Comput. 2(1):4-32.
41. Glover M, Laguna M (1997) Tabu Search (Kluwer Academic Publishers, Boston).
42. Hadjiconstantinou E, Christofides N, Mingozzi A (1995) A new exact algorithm from the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. 61(1):21-43.
43. Hemmelmayr VC, Doerner KF, Hartl RF (2009) A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3):791-802.
44. Jacobs TL, Warmerdam JM (1994) Simultaneous routing and siting for hazardous-waste operations. J. Urban Planning Development-ASCE 120(3):115-131.
45. Jozefowiez N, Semet F, Talbi E-G (2009) An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 195(3):761-799.
46. Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. INFORMS J. Comput. 7(1):10-23.
47. Kulkarni RV, Bhave PR (1985) Integer programming formulations of vehicle routing problems. Eur. J. Oper. Res. 20(1):58-67.
48. Lacomme P, Prins C, Sevaux M (2006) A genetic algorithm for a biobjective capacitated arc routing problem. Comput. Oper. Res. 33(12):3473-3493.
49. Li X, Tian P, Aneja YP (2010) An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Res. Part E: Logist. Transportation Rev. 46(6):1111-1127.
50. Lin CKY, Kwok RCW (2006) Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur. J. Oper. Res. 175(3):1833-1849.
51. List GF, Mirchandani P (1991) An integrated network planar multiobjective model for routing and siting for hazardous materials and wastes. Transportation Sci. 25(2):146-156.
52. List GF, Mirchandani PB, Turnquist MA, Zografos KG (1991) Modelling and analysis for hazardous material transportation: Risk analysis, routing scheduling and facility location. Transportation Sci. 25(2):100-114.
53. Lysgaard J, Letchford NA, Eglese WR (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423-445.
54. Marinakis Y, Migdalas A, Pardalos PM (2009) A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J. Global Optim. 38(4):555-580.
55. Meng Q, Lee DH, Cheu RL (2005) Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. J. Transportation Engrg. 131(9):699-707.
56. Mester D, Bräysy O (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput. Oper. Res. 34(10):2964-2975.
57. Miller C, Tucker A, Zemlin R (1960) Integer programming formulations of travelling salesman problems. J. ACM 7(4):326-329.
58. Molina J, Laguna M, Martí R, Caballero R (2007) SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization. INFORMS J. Comput. 19(1):91-100.
59. Oppen J, Løkketangen A (2006) Arc routing in a node routing environment. Comput. Oper. Res. 33(4):1033-1055.
60. Or I (1976) Traveling salesman type combinatorial problems and their relations to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Chicago.
61. Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(4):421-451.
62. Osman MS, Abo-Sinna MA, Mousa AA (2005) An effective genetic algorithm approach to multiobjective routing problems (MORPS). Appl. Math. Comput. 163(2):769-781.
63. Pacheco J, Martí R (2006) Tabu search for a multiobjective routing problem. J. Oper. Res. Soc. 57(1):29-37.
64. Park J, Kim B-I (2010) The school bus routing problem: A review. Eur. J. Oper. Res. 202(2):311-319.
65. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403-2435.
66. Potvin JY, Bengio S (1996) The vehicle routing problem with time windows part II: Genetic search. INFORMS J. Comput. 8(2): 165-172.
67. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12):1985-2002.
68. Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engrg. Appl. Artificial Intelligence 22(6):916-928.
69. Prins C, Prodhon C, Ruiz A, Soriano P, Wolfler-Calvo R (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Sci. 41(4):470-483.
70. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. Glover F, Kochenberger G, eds. State-of-the-Art Handbook in Metaheuristics (Kluwer Academic Publishers, Boston), 219-250.
71. Revelle C, Cohon J, Shobrys D (1991) Simultaneous siting and routing in the disposal of hazardous wastes. Transportation Sci. 25(2):138-145.
72. Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1):147-167.
73. Rosing KE, Revelle CS (1997) Heuristic concentration: Two stage solution construction. Eur. J. Oper. Res. 97(1):75-86.
74. Shan JS, Cuff CK (1996) Multicriteria pickup and delivery problem with transfer opportunity. Comput. Indust. Engrg. 30(4):631-645.
75. Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31(2):170-186.
76. Tan KC, Cheong CY, Gon CK (2007) Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur. J. Oper. Res. 177(2):813-839.
77. Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problems with time windows. Computational Optim. Appl. 34(1):115-151.
78. Tang H, Hu MW (2005) Dynamic vehicle routing problem with multiple objectives: Solution framework and computational experiments. Transportation Res. Record 1923:199-207.
79. Tarantilis CD, Kiranoudis CT (2007) A flexible adaptive memorybased algorithm for real-life transportation operations: Two case studies from dairy and construction sector. Eur. J. Oper. Res. 179(3):806-822.
80. Thangiah SR, Osman IH, Sun T (1994) Hybrid genetic algorithm, simulated annealing, and tabu search methods for the vehicle routing problem with time windows. Working Paper UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK.
81. Toth P, Vigo D, eds. (2001) Branch-and-bound algorithms for the capacitated VRP. The Vehicle Routing Problem (SIAM, Philadelphia), 29-52.
82. Vondouris C, Tsang E (1999) Guided local search for the traveling salesman problem. Eur. J. Oper. Res. 113(2):469-499.
83. Wijeratne AB, Turnquist MA, Mirchandani PB (1993) Multiobjective routing of hazardous materials in stochastic networks. Eur. J. Oper. Res. 65(1):33-43.
84. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009a) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 195(3):729-743.
85. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009b) A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems Appl. 36(2):1070-1081.