Skip to main content

A Matheuristic Algorithm for Solving the Vehicle Routing Problem with Cross-Docking

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12096))

Included in the following conference series:

Abstract

This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD. The aim is to find a set of routes to deliver single products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic approach that uses the routes of the local optima of an adaptive large neighborhood search (ALNS) as columns in a set-partitioning formulation of the VRPCD is designed. This matheuristic outperforms the state-of-the-art algorithms in solving a subset of benchmark instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Apte, U.M., Viswanathan, S.: Effective cross docking for improving distribution efficiencies. Int. J. Logist. 3(3), 291–302 (2000)

    Article  Google Scholar 

  2. Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223–246 (2014). https://doi.org/10.1007/s13675-014-0030-7

    Article  MATH  Google Scholar 

  3. Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. J. Oper. Res. Soc. 27(2), 367–384 (1976)

    Article  MathSciNet  Google Scholar 

  4. Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.M.: The vehicle routing problem with cross-docking and resource constraints. J. Heuristics (2019). https://doi.org/10.1007/s10732-019-09423-y

  5. Lee, Y.H., Jung, J.W., Lee, K.M.: Vehicle routing scheduling for cross-docking in the supply chain. Comput. Ind. Eng. 51(2), 247–256 (2006)

    Article  Google Scholar 

  6. Liao, C.J., Lin, Y., Shih, S.C.: Vehicle routing with cross-docking in the supply chain. Expert Syst. Appl. 37(10), 6868–6873 (2010)

    Article  Google Scholar 

  7. Yu, V.F., Jewpanya, P., Redi, A.A.N.P.: Open vehicle routing problem with cross-docking. Comput. Ind. Eng. 94, 6–17 (2016)

    Article  Google Scholar 

Download references

Acknowledgment

This research is supported by the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aldy Gunawan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gunawan, A., Widjaja, A.T., Vansteenwegen, P., Yu, V.F. (2020). A Matheuristic Algorithm for Solving the Vehicle Routing Problem with Cross-Docking. In: Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2020. Lecture Notes in Computer Science(), vol 12096. Springer, Cham. https://doi.org/10.1007/978-3-030-53552-0_2

Download citation

Publish with us

Policies and ethics