Advertisement

Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers

  • Andreas Stenger
  • Michael Schneider
  • Oliver Wendt
Chapter

Abstract

Competition in the logistics sector significantly increases driven by high cost pressure and new legal regulations. In particular, the new rules for CO2 emissions increase the pressure on logistics companies to improve their network efficiency. On the strategic level, the network efficiency of small package shippers (SPS) mainly depends on the locations of hubs and depots. Since customer demand as well as customer locations vary within the planning horizon of a strategic decision, which is about 10-15 years, a reasonable approximation of those values and a powerful planning tool are required.

Keywords

Greedy Randomize Adaptive Search Proce Variable Neighborhood Search Vehicle Route Problem Route Planning Tabu Search Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bolduc, M.-C., Renaud, J., Boctor, F. and Laporte, G. "A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers," International Journal of the Operational Research Society (59:6), 2008, pp. 776–787.CrossRefGoogle Scholar
  2. Bräysy, O. and Gendreau, M. "Vehicle routing problem with time windows, Part I: Route construction and local search algorithms," Transportation Science (39:1), 2005a, pp. 104–118.CrossRefGoogle Scholar
  3. Bräysy, O. and Gendreau, M. "Vehicle routing problem with time windows, Part II: Metaheuristics," Transportation Science (39:1), 2005b, pp. 119–139.CrossRefGoogle Scholar
  4. Campbell, A. M. and Thomas, B. W. "Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines," Computers & Operations Research (36:4), 2009, pp. 1231–1248.CrossRefGoogle Scholar
  5. Christofides, N. "Fixed routes and areas for delivery operations," International Journal of Physical Distribution & Logistics Management (1:2), 1971, pp. 87–92.CrossRefGoogle Scholar
  6. Clarke, G. and Wright, J. W. “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research (12:4), 1964, pp. 568–581.CrossRefGoogle Scholar
  7. Cordeau, J.-F., Gendreau, M. and Laporte, G. "A tabu search heuristic for periodic and multi- depot vehicle routing problems," Networks (30:2), 1997, pp. 105–119.CrossRefGoogle Scholar
  8. Côté, J.-F. and Potvin, J.-Y. "A tabu search heuristic for the vehicle routing problem with private fleet and common carrier," European Journal of Operational Research (198:2), 2009, pp. 464–469.CrossRefGoogle Scholar
  9. Doppstadt, C., Schneider, M., Stenger, A., Sand, B., Vigo, D. and Schwind, M. "Graph sparsification for the vehicle routing problem with time windows," in Hu, B., Morasch, K., Pickl, S. and Siegle, M. (Eds.): Operations Research Proceedings 2010, Springer, 2011.Google Scholar
  10. Duhamel, C., Lacomme, P., Prins, C. and Prodhon, C. "A GRASPxELS approach for the capacitated location-routing problem," Computers & Operations Research (37:11), 2010, pp. 1912–1923.CrossRefGoogle Scholar
  11. Gendreau, M., Potvin, J.-Y., Bräysy, O., Hasle, G. and Løkketangen, A. "Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography," in: Bruce L. Golden (Ed.): The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, 2008, pp. 143–169.Google Scholar
  12. Haughton, M. A. "The efficacy of exclusive territory assignments to delivery vehicle drivers," European Journal of Operational Research (184:1), 2008, pp. 24–38.CrossRefGoogle Scholar
  13. Haugland, D., Ho, S. C. and Laporte, G. "Designing delivery districts for the vehicle routing problem with stochastic demands," European Journal of Operational Research (180:3), 2007, pp. 997–1010.CrossRefGoogle Scholar
  14. Min, H., Jayaraman, V. and Srivastava, R. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research (108:1), 1998, pp. 1–15.CrossRefGoogle Scholar
  15. Nagata, Y., Bräysy, O. and Dullaert, W. "A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows," Computers & Operations Research (37:4), 2010, pp. 724–737.CrossRefGoogle Scholar
  16. Nagy, G. and Salhi, S. "Location-routing: Issues, models and methods," European Journal of Operational Research (177:2), 2007, pp. 649–672.CrossRefGoogle Scholar
  17. Potvin, J.-Y. and Naud, M.-A. "Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier," to appear in: International Journal of the Operational Research Society 2010.Google Scholar
  18. Prins, C., Prodhon, C., Ruiz, A., Soriano, P. and Wolfler Calvo, R. "Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic, " Transportation Science (41:4), 2007, pp. 470–483.CrossRefGoogle Scholar
  19. Schneider, M., Doppstadt, C. Sand, B., Stenger, A. and Schwind, M. "A vehicle routing problem with time windows and driver familiarity," in: Seventh Triennial Symposium on Transportation Analysis, Tromsø, Norway, 2010a.Google Scholar
  20. Schneider, M., Doppstadt, C., Stenger, A. and Schwind, M. "Ant colony optimization for a stochastic vehicle routing problem with driver learning," in: Proceedings of the IEEE Congress on Evolutionary Computation (IEEE CEC), Barcelona, Spain, 2010b.Google Scholar
  21. Schneider, M., Stenger, A. and Lagemann, H. "Vehicle routing problem with driver learning aspects – a solution approach based on fixed service territories." Technical report, Chair of Business Information Systems and Operations Research, Technical University Kaiserslautern, Germany, 2010c.Google Scholar
  22. Smilowitz, K., Nowak, M. and Jiang, T. "Workforce management in periodic delivery operations," Working Paper No. 09–004, 2009.Google Scholar
  23. Stenger, A., Schneider, M. and Schwind, M. "Decision support for location routing with relocation aspects," in: Proceedings of the Multikonferenz Wirtschaftsinformatik 2010, 2010a, pp. 1949–1959.Google Scholar
  24. Stenger, A., Vigo, D., Enz, S. and Schwind, M. "A variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping." Technical report 02/2010, IT-based Logistics, Institute of Information Systems, Goethe University, Frankfurt, Germany, 2010b.Google Scholar
  25. Stenger, A., Schneider, M. and Schwind, M. "A combined simulated annealing and variable neighborhood search heuristic for a location routing problem with subcontracting option, " Technical report 01/2010, IT-based Logistics, Institute of Information Systems, Goethe University, Frankfurt, Germany, 2010c.Google Scholar
  26. Wong, K. F. and Beasley, J. E. "Vehicle routing using fixed delivery areas," Omega (12:6), 1984, pp. 591–600.CrossRefGoogle Scholar
  27. Zhong, H., Hall, R. W. and Dessouky, M. "Territory planning and vehicle dispatching with driver learning," Transportation Science (41:1), 2007, pp. 74–89.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andreas Stenger
    • 1
  • Michael Schneider
    • 2
  • Oliver Wendt
    • 2
  1. 1.IT-based Logistics, Institute of Information SystemsGoethe University FrankfurtFrankfurtGermany
  2. 2.Technical University KaiserslauternKaiserslauternGermany

Personalised recommendations