The Consistent Vehicle Routing Problem

References

• Campbell A., Thomas B. Probabilistic traveling salesman problem with deadlines. Transportation Sci. (2008) 42:1–21Link, Google Scholar
• Campbell A., Clarke L., Savelsbergh M., Toth P., Vigo D. Inventory routing in practice. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 309–330Crossref, Google Scholar
• Christofides N., Eilon S. An algorithm for the vehicle dispatching problem. Oper. Res. Quart. (1969) 20:309–318Crossref, Google Scholar
• Cordeau J.-F., Gendreau M., Hertz A., Laporte G., Sormany J.-S., Langevin A., Riopel D. New heuristics for the vehicle routing problem. Logistics Systems: Design and Optimization (2005) (Springer, New York) 270–297Crossref, Google Scholar
• Dantzig G., Ramser J. The truck dispatching problem. Management Sci. (1959) 6:80–91Link, Google Scholar
• Francis P., Smilowitz K., Tzur M. Flexibility and complexity in periodic distribution problems. Naval Res. Logist. (2007) 54:136–150Crossref, Google Scholar
• Golden B., Wasil E., Kelly J., Chao I.-M., Crainic T., Laporte G. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. Fleet Management and Logistics (1998) (Kluwer, Boston) 33–56Crossref, Google Scholar
• Jozefowiez N., Semet F., Talbi E.-G., Merelo Guenvós J. J., Adamidis P., Beyer H.-G., Fernàndez-Villacañas J.-L., Schwefel H.-P. Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem. Proc. 7th Internat. Conf. Parallel Problem Solving from Nature (2002) 2439(Springer-Verlag, New York) 271–280Lecture Notes in Computer ScienceCrossref, Google Scholar
• Jozefowiez N., Semet F., Talbi E.-G., Talbi E.-G., Liardet P., Collet P., Fonlupt C., Schoenauer M. Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. Artificial Evolution (2005) 3871(Springer-Verlag, New York) 131–142Lecture Notes in Computer ScienceGoogle Scholar
• Jozefowiez N., Semet F., Talbi E.-G. Target aiming Pareto search and its application to the vehicle routing problem with route balancing. J. Heuristics (2007) 13:455–469Crossref, Google Scholar
• Levy L., Bodin L., Golden B., Assad A. Scheduling the postal carriers for the United States Postal Service: An application of arc partitioning and routing. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 359–394Google Scholar
• Levy L., Bodin L. The arc oriented location routing problem. INFOR (1989) 27:74–93Google Scholar
• Li F., Golden B., Wasil E. Very large-scale vehicle routing: New test problems, algorithms, and results. Comput. Oper. Res. (2005) 32:1165–1179Crossref, Google Scholar
• Moin N., Salhi S. Inventory routing problems: A logistical overview. J. Oper. Res. Soc. (2007) 58:1185–1194Crossref, Google Scholar
• Sniezek J., Bodin L. Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation vehicles. Ann. Oper. Res. (2006) 144:33–58Crossref, Google Scholar
• Toth P., Vigo D., Toth P., Vigo D. An overview of vehicle routing problems. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 1–26Crossref, Google Scholar
• UPS Driving success: Why the UPS model for managing 103,500 drivers is a competitive advantage. (2007) . http://pressroom.ups.com/mediakits/popups/factsheet/0,1889,1201,00.htmlGoogle Scholar
• Wong R., Golden B., Raghavan S., Wasil E. Vehicle routing for small package delivery and pickup services. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) 43(Springer, New York) 475–485Operations Research/Computer Science Interfaces SeriesCrossref, Google Scholar
• Yellow P. C. A computational modification to the savings method of vehicle scheduling. Oper. Res. Quart. (1970) 21:281–293Crossref, Google Scholar