Advertisement

Improved Packing and Routing of Vehicles with Compartments

  • Sandro Pirkwieser
  • Günther R. Raidl
  • Jens Gottlieb
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6927)

Abstract

We present a variable neighborhood search for the vehicle routing problem with compartments where we incorporate some features specifically aiming at the packing aspect. Among them we use a measure to distinguish packings and favor solutions with a denser packing, propose new neighborhood structures for shaking, and employ best-fit and best-fit-decreasing methods for inserting orders. Our approach yields encouraging results on a large set of test instances, obtaining new best known solutions for almost two third of them.

Keywords

Neighborhood Structure Packing Problem Memetic Algorithm Variable Neighborhood Search Vehicle Rout Problem 
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. 1.
    Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: applications, modelling and heuristics. OR Spectrum (2010) doi: 10.1007/s00291-010-0194-3Google Scholar
  2. 2.
    El Fallahi, A., Prins, C., Calvo, R.W.: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research 35, 1725–1741 (2008)CrossRefzbMATHGoogle Scholar
  3. 3.
    Muyldermans, L., Pang, G.: On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research 206, 93–103 (2010)CrossRefzbMATHGoogle Scholar
  4. 4.
    Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N.: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research 37(11), 1886–1898 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N.: Constructive heuristics for the multi-compartment vehicle routing problem with stochastic demands. Transportation Science 45(3), 346–363 (2011)CrossRefzbMATHGoogle Scholar
  6. 6.
    Hansen, P., Mladenović, N., Brimberg, J., Moreno Pérez, J.A.: Variable neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, 2nd edn., pp. 61–86. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, vol. 2, pp. 1186–1192 (May 1992)Google Scholar
  8. 8.
    Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34(8), 2403–2435 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55, 705–716 (2004)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Sandro Pirkwieser
    • 1
  • Günther R. Raidl
    • 1
  • Jens Gottlieb
    • 2
  1. 1.Institute of Computer Graphics and AlgorithmsVienna University of TechnologyViennaAustria
  2. 2.SAP AGWalldorfGermany

Personalised recommendations