Advertisement

Models and Advanced Optimization Algorithms for the Integrated Management of Logistics Operations

  • Telmo Pinto
  • Cláudio Alves
  • José Valério de Carvalho
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 223)

Abstract

In this paper, we describe a set of algorithms regarding real combinatorial optimization problems in the context of transportation of goods. These problems consist in the combination of the vehicle routing problem with the two-dimensional bin-packing problem, which is also known as the vehicle routing problem with two-dimensional loading constraints. We also analyzed two related problems, namely the elementary shortest path problem and the vehicle routing problem with mixed linehaul and backhaul customers. In both problems, two-dimensional loading constraints are explicitly considered. Two column generation based approaches are proposed for the vehicle routing problem with two-dimensional constraints. The elementary shortest path problem with two-dimensional constraints is addressed due to its importance in solving the subproblem of the column generation algorithms. To the best of our knowledge, we contribute with the first approach for this problem, through different constructive strategies to achieve feasible solutions, and a variable neighborhood search algorithm in order to search for improved solutions. In what concerns the vehicle routing problem with mixed linehaul and backhaul customers and two-dimensional loading constraints, different variable neighborhood search algorithms are proposed. All the proposed methods were implemented and experimentally tested. An exhaustive set of computational tests was conducted, using, for this purpose, a large group of benchmark instances. In some cases, a large set of benchmark instances was adapted in order to assess the quality of the proposed models.

Keywords

Vehicle routing Loading constraints Computational study 

Notes

Acknowledgements

This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT—Fundação para a Ciência e Tecnologia within the Project Scope: UID/ CEC/00319/2013, and through the grant SFRH/BD/73584/2010, funded by QREN - POPH - Typology 4.1 - co-funded by the European Social Fund.

References

  1. 1.
    C. Alves, Planeamento de rotas em sistemas de recolha/distribuição. Master’s thesis, University of Minho (2000)Google Scholar
  2. 2.
    G. Dantzig, J. Ramser, The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    C. Duhamel, P. Lacomme, A. Quilliot, H. Toussaint, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3), 617–640 (2011). ISSN 0305-0548Google Scholar
  4. 4.
    D. Feillet, P. Dejax, M. Gendreau, C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216–229 (2004). ISSN 1097-0037, http://dx.doi.org/10.1002/net.20033
  5. 5.
    M. Gendreau, M. Iori, G. Laporte, S. Martello, A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1), 4–18 (2008). ISSN 00283045, http://doi.wiley.com/10.1002/net.20192
  6. 6.
    P. Hokama, F. Miyazawa, E. Xavier, A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert Syst. Appl. 47, 1–13 (2016). ISSN 0957-4174,  https://doi.org/10.1016/j.eswa.2015.10.013, http://www.sciencedirect.com/science/article/pii/S0957417415007009
  7. 7.
    M. Iori, S. Martello, Routing problems with loading constraints. TOP 18(1), 4–27 (2010). ISSN 1134-5764,  https://doi.org/10.1007/s11750-010-0144-x
  8. 8.
    M. Iori, J.-J. Salazar-Gonzalez, D. Vigo, An exact approach for the vehicle routing problem with two-dimensional loading constraints. Trans. Sci. 41(2), 253–264 (2007). ISSN 0041-1655Google Scholar
  9. 9.
    G. King, T. Mast, Excess travel: causes, extent, and consequences. Trans. Res. Record 1111, 126–134 (1987)Google Scholar
  10. 10.
    S. Martello, D. Vigo, Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44(3), 388–399 (1998)CrossRefMATHGoogle Scholar
  11. 11.
    T. Pinto, C. Alves, J.V. de Carvalho, Column generation based heuristics for the vehicle routing problem with loading constraints. Eletron. Notes Discret. Math. (accepted)Google Scholar
  12. 12.
    T. Pinto, C. Alves, J.V. de Carvalho, Variable neighborhood search for the elementary shortest path problem with loading constraints, vol. 9156, Lecture Notes in Computer Science, book section 34 (Springer International Publishing, Berlin, 2015a), pp. 474–489. ISBN 978-3-319-21406-1,  https://doi.org/10.1007/978-3-319-21407-8_34
  13. 13.
    T. Pinto, C. Alves, J.V. de Carvalho, A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints, vol. 9855, Lecture Notes in Computer Science (Springer International Publishing, Berlin, 2016), pp. 321–336,  https://doi.org/10.1007/978-3-319-21407-8_34
  14. 14.
    T. Pinto, C. Alves, J.V. de Carvalho, Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electron. Notes Discret. Math. 58, 111–118 (2017). ISSN 1571-0653,  https://doi.org/10.1016/j.endm.2017.03.015, http://www.sciencedirect.com/science/article/pii/S1571065317300513
  15. 15.
    T. Pinto, C. Alves, J.V. de Carvalho, A. Moura, An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls. FME Trans. 43(4), 311–318 (2015)Google Scholar
  16. 16.
    H. Pollaris, K. Braekers, A. Caris, G. Janssens, S. Limbourg, Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. EURO J. Transp. Logist. 1–25 (2014). ISSN 2192-4384,  https://doi.org/10.1007/s13676-014-0064-2
  17. 17.
    G. Righini, M. Salani, Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Opt. 3(3), 255–273 (2006). ISSN 1572-5286,  https://doi.org/10.1016/j.disopt.2006.05.007, http://www.sciencedirect.com/science/article/pii/S1572528606000417
  18. 18.
    G. Righini, M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks, 51 (3): 155–170, 2008. ISSN 1097-0037,  https://doi.org/10.1002/net.20212
  19. 19.
    M. Savelsbergh, M. Sol, Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474–490 (1998)CrossRefMATHGoogle Scholar
  20. 20.
    P. Toth, D. Vigo, An overview of vehicle routing problems, in The Vehicle Routing Problem, Society for Industrial and Applied Mathematics (2002), pp. 1–26Google Scholar
  21. 21.
    E. Zachariadis, C. Tarantilis, C. Kiranoudis, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 195(3), 729–743 (2009)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Telmo Pinto
    • 1
  • Cláudio Alves
    • 1
  • José Valério de Carvalho
    • 1
  1. 1.Departamento de Produção e Sistemas, Escola de EngenhariaUniversidade do MinhoBragaPortugal

Personalised recommendations