Modelling the Synchronization of Transport Means in Logistics Service Operations

  • Dorota Slawa Mankowska
  • Christian Bierwirth
  • Frank Meisel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6971)

Abstract

Synchronization of vehicle operations plays an important role for logistics service providers. Examples of logistics businesses with synchronization requirements can be found, e.g., in swap trailer transportation and truck-meets-truck traffic. In this paper, we provide a classification of the various types of synchronization requirements for transport means in logistics applications. For supporting the planning of logistics service operations, we formulate a new mixed-integer programming model for vehicle routing, where vehicle routes are synchronized at fixed and given points. Computational results are provided for assessing the solvability of the model under various problem settings.

Keywords

Vehicle Route Problem Vehicle Route Spatial Synchronization Route Length Synchronization Point 
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.
    Golden, B., Raghavan, S., Wasil, E.A. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research, Computer Science Interfaces Series. Springer, New York (2008)MATHGoogle Scholar
  2. 2.
    Drexl, M.: Synchronization in Vehicle Routing–A Survey of VRPs with Multiple Synchronization Constraints. Technical Report LM-2011-02, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz (2011)Google Scholar
  3. 3.
    Bredström, D., Rönnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research 191, 19–31 (2008)CrossRefMATHGoogle Scholar
  4. 4.
    Del Pia, A., Filippi, C.: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. International Transactions in Operational Research 13, 125–141 (2006)CrossRefMATHGoogle Scholar
  5. 5.
    Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with Time Windows. In: Toth, P., Vigo, T. (eds.) The Vehicle Routing Problem, pp. 57–188. Society for Industrial and Applied Mathematics, Philadelphia (2002)Google Scholar
  6. 6.
    Choi, E., Tcha, D.-W.: A Column Generation Approach to the Heterogeneous Fleet Vehicle Routing Problem. Computers and Operations Research 34, 2080–2095 (2007)CrossRefMATHGoogle Scholar
  7. 7.
    Scheurer, S.: A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research 33, 894–909 (2006)CrossRefMATHGoogle Scholar
  8. 8.
    Wen, M., Larsen, J., Clause, J., Cordeau, J.-F., Laporte, G.: Vehicle routing with cross-docking. Journal of the Operational Research Society 60, 1708–1718 (2009)CrossRefMATHGoogle Scholar
  9. 9.
    Roesseau, L.-M., Gendreau, M., Pesant, G.: The Synchronized Vehicle Dispatching Problem. Technical Report CRT-2003-11, Conference paper, Odysseus 2003, Centre de Recherche sur les Transports, Université de Montréal, Canada (2003)Google Scholar
  10. 10.
    Weise, T., Podlich, A., Reinhard, K., Gorldt, C., Geihs, K.: Evolutionary Freight Transportation Planning. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., Machado, P., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 768–777. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dorota Slawa Mankowska
    • 1
  • Christian Bierwirth
    • 1
  • Frank Meisel
    • 1
  1. 1.School of Economics and BusinessMartin-Luther University Halle-WittenbergGermany

Personalised recommendations