[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Constraint-Based Fleet Design Optimisation for Multi-compartment Split-Delivery Rich Vehicle Routing

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10416))

Abstract

We describe a large neighbourhood search (LNS) solver based on a constraint programming (CP) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver supports both single-day and multi-day scenarios and a variety of real-world aspects including time window constraints, compatibility constraints, and split deliveries. It can be used both to plan the daily delivery operations, and to inform decisions on the long-term fleet composition. We show experimentally the viability of our approach.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

Notes

  1. 1.

    Such constraints are rather common in the literature, and reflect the presence or absence of flow (or debit) meters at the replenishing plant or on the vehicles.

  2. 2.

    This limit allows to optimise the routing using an existing fleet.

  3. 3.

    Depending on the destruction strategy, the same value of \(dr\) can cause different numbers of variables to be relaxed. The per-variable timeout used in the repair step mitigates this disparity. Moreover, relaxing the problem “semantically” rather than randomly allows us to preserves the structure of the solution.

  4. 4.

    Because only a limited number of attempts is made at each \(dr\) level, restarting the search with \(dr= {\underline{dr}}\) allows us to try (again) non-expensive relaxations in case we previously missed a possibility for improvement.

  5. 5.

    Available at https://github.com/tunnuz/gecode-lns.

References

  1. Archetti, C., Speranza, M.G.: The split delivery vehicle routing problem: a survey. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces, vol. 43, pp. 103–122. Springer, Boston (2008). doi:10.1007/978-0-387-77778-8_5

    Chapter  Google Scholar 

  2. Avella, P., Boccia, M., Sforza, A.: Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152(1), 170–179 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Belfiore, P., Yoshizaki, H.T.: Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Comput. Ind. Eng. 64(2), 589–601 (2013)

    Article  Google Scholar 

  4. Brown, G.G., Ellis, C.J., Graves, G.W., Ronen, D.: Real-time, wide area dispatch of mobil tank trucks. Interfaces 17(1), 107–120 (1987)

    Article  Google Scholar 

  5. Brown, G.G., Graves, G.W.: Real-time dispatch of petroleum tank trucks. Manag. Sci. 27(1), 19–32 (1981)

    Article  Google Scholar 

  6. van der Bruggen, L., Gruson, R., Salomon, M.: Reconsidering the distribution structure of gasoline products for a large oil company. Eur. J. Oper. Res. 81(3), 460–473 (1995)

    Article  Google Scholar 

  7. Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), 32 (2015)

    Google Scholar 

  8. Cornillier, F., Boctor, F.F., Laporte, G., Renaud, J.: An exact algorithm for the petrol station replenishment problem. J. Oper. Res. Soc. 59(5), 607–615 (2008)

    Article  MATH  Google Scholar 

  9. Cornillier, F., Boctor, F.F., Laporte, G., Renaud, J.: A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. 191(2), 295–305 (2008)

    Article  MATH  Google Scholar 

  10. Cornillier, F., Boctor, F.F., Renaud, J.: Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. 220, 361–369 (2012)

    Article  MATH  Google Scholar 

  11. Dell’Amico, M., Monaci, M., Pagani, C., Vigo, D.: Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transp. Sci. 41(4), 516–526 (2007)

    Article  Google Scholar 

  12. Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: applications, modelling and heuristics. OR Spectr. 33(4), 885–914 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Di Gaspero, L., Rendl, A., Urli, T.: Balancing bike sharing systems with constraint programming. Constraints 21(2), 318–348 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  14. Drexl, M.: Rich vehicle routing in theory and practice. Logist. Res. 5(1–2), 47–63 (2012)

    Article  Google Scholar 

  15. Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discret. Appl. Math. 50(3), 239–254 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141–145 (1989)

    Article  MATH  Google Scholar 

  17. Dror, M., Trudeau, P.: Split delivery routing. Nav. Res. Logist. (NRL) 37(3), 383–402 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  18. Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49–66 (1984)

    Article  MATH  Google Scholar 

  19. Golden, B., Raghavan, S., Wasil, E. (eds.): Preface. Operations Research/Computer Science Interfaces, vol. 43. Springer, US (2008)

    Google Scholar 

  20. Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274–289. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30201-8_22

    Chapter  Google Scholar 

  21. Henke, T., Speranza, M.G., Wäscher, G.: The multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 246(3), 730–743 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kabcome, P., Mouktonglang, T.: Vehicle routing problem for multiple product types, compartments, and trips with soft time windows. Int. J. Math. Math. Sci. 2015 (2015)

    Google Scholar 

  23. Kilby, P., Shaw, P.: Vehicle routing. In: Handbook of Constraint Programming, pp. 799–834 (2006)

    Google Scholar 

  24. Kilby, P., Urli, T.: Fleet design optimisation from historical data using constraint programming and large neighbourhood search. Constraints 21(1), 2–21 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  25. 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. Comput. Oper. Res. 37(11), 1886–1898 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  26. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30201-8_36

    Chapter  Google Scholar 

  27. Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 399–419. Springer, Boston (2010). doi:10.1007/978-1-4419-1665-5_13

    Chapter  Google Scholar 

  28. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)

    Article  Google Scholar 

  29. Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and programming with gecode. In: Schulte, C., Tack, G., Lagerkvist, M.Z. (eds.) Modeling and Programming with Gecode. Self-published (2015). Corresponds to Gecode 4.4.0

    Google Scholar 

  30. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). doi:10.1007/3-540-49481-2_30

    Chapter  Google Scholar 

  31. Tufte, E.R.: Beautiful Evidence. Graphics Press LLC, Cheshire (2006)

    Google Scholar 

  32. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658–673 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  33. Vilım, P.: Global constraints in scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Praha 1, Czech Republic (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSIRO Data61, Australian National University (ANU), Tower A, Level 3, 7 London Circuit, Canberra, ACT, 2601, Australia

    Tommaso Urli & Philip Kilby

Authors
  1. Tommaso Urli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philip Kilby
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tommaso Urli .

Editor information

Editors and Affiliations

  1. University of Toronto, Toronto, Ontario, Canada

    J. Christopher Beck

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Urli, T., Kilby, P. (2017). Constraint-Based Fleet Design Optimisation for Multi-compartment Split-Delivery Rich Vehicle Routing. In: Beck, J. (eds) Principles and Practice of Constraint Programming. CP 2017. Lecture Notes in Computer Science(), vol 10416. Springer, Cham. https://doi.org/10.1007/978-3-319-66158-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66158-2_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66157-5

  • Online ISBN: 978-3-319-66158-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation