Fleet design optimisation from historical data using constraint programming and large neighbourhood search

Abstract

We present an original approach to compute efficient mid-term fleet configurations, at the request of a Queensland-based long-haul trucking carrier. Our approach considers one year’s worth of demand data, and employs a constraint programming (CP) model and an adaptive large neighbourhood search (LNS) scheme to solve the underlying multi-day multi-commodity split delivery capacitated vehicle routing problem. Our solver is able to provide the decision maker with a set of Pareto-equivalent fleet setups trading off fleet efficiency against the likelihood of requiring on-hire vehicles and drivers. Moreover, the same solver can be used to solve the daily loading and routing problem. We carry out an extensive experimental analysis, comparing our approach with an equivalent mixed integer programming (MIP) formulation, and we show that our approach is a sound methodology to provide decision support for the mid- and short-term decisions of a long-haul carrier.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Archetti, C., & Speranza, M. (2008). 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). US: Springer.

  2. 2.

    Belfiore, P., & Yoshizaki, H.T. (2013). Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers & Industrial Engineering, 64(2), 589–601.

    Article  Google Scholar 

  3. 3.

    Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T. (2010). F-Race and iterated F-Race: an overview. In Experimental methods for the analysis of optimization algorithms (pp. 311–336). Springer.

  4. 4.

    Bräysy, O., Dullaert, W., Hasle, G., Mester, D., & Gendreau, M. (2008). An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Science, 42(3), 371–386.

    Article  Google Scholar 

  5. 5.

    Crainic, T.G. (2003). Long-haul freight transportation. In Hall, R.W. (Ed.) Handbook of transportation science, international series in operations research & management science, (Vol. 56 pp. 451–516). US: Springer.

  6. 6.

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

    Article  Google Scholar 

  7. 7.

    Di Gaspero, L., Rendl, A., & Urli, T. (2015). Balancing bike sharing systems with constraint programming. Constraints, 1–31.

  8. 8.

    Di Gaspero, L., & Urli, T. (2014). A cp/lns approach for multi-day homecare scheduling problems. In Hybrid metaheuristics (pp. 1–15). Springer.

  9. 9.

    Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141–145.

    MATH  MathSciNet  Article  Google Scholar 

  10. 10.

    Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics (NRL), 37(3), 383–402.

    MATH  MathSciNet  Article  Google Scholar 

  11. 11.

    Gurobi Optimization, I. (2015). Gurobi optimizer reference manual. http://www.gurobi.com.

  12. 12.

    Kilby, P., & Shaw, P. (2006). Vehicle routing. Handbook of Constraint Programming, 799–834.

  13. 13.

    Kytöjoki, J., Nuortio, T., Bräysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34(9), 2743–2757.

    MATH  Article  Google Scholar 

  14. 14.

    Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In Handbook of metaheuristics (pp. 399–419). Springer.

  15. 15.

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

    Article  Google Scholar 

  16. 16.

    Schulte, C., Tack, G., & Lagerkvist, M.Z. (2015). Modeling and programming with gecode. In Schulte, C., Tack, G., & Lagerkvist, M.Z (Eds.) Modeling and programming with gecode.

  17. 17.

    Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M. J., & Puget, J.F. (Eds.) CP’98: the 4th international conference on principles and practice of constraint programming, 1998, proceedings of, lecture notes in computer science, (Vol. 1520 pp. 417–431): Springer.

  18. 18.

    Toth, P., & Vigo, D. (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.

  19. 19.

    Urli, T. (2013). json2run: a tool for experiment design & analysis. arXiv preprint arXiv:1305.1112.

  20. 20.

    Vidal, T., Crainic, T.G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658–673.

    MATH  MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Tommaso Urli.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Kilby, P., Urli, T. Fleet design optimisation from historical data using constraint programming and large neighbourhood search. Constraints 21, 2–21 (2016). https://doi.org/10.1007/s10601-015-9203-0

Download citation

Keywords

  • Vehicle routing problem
  • Fleet size and mix
  • Large neighbourhood search
  • Mixed integer programming
  • Constraint programming
  • Pre-processing