Skip to main content
SpringerLink
Log in

A Hybrid Local Search Algorithm for the Consistent Periodic Vehicle Routing Problem

Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

Under consideration is some new real-world application of vehicle routing planning in a finite time horizon. Let a company have a set of capacitated vehicles in some depots and serve some set of customers. There is a frequency for each customer which describes how often the customer should be visited. Time intervals between two consecutive visits are fixed, but the visiting schedule is flexible. To obtain some competitive advantage, the company tries to increase the service quality. To this end, each customer should be visited by one driver only. The goal is to minimize the total length of the vehicle paths over the planning horizon under the frequency constraints and driver shift length constraints. We present a mixed-integer linear programming model for this new consistent capacitated vehicle routing problem. To find near optimal solutions, we design the variable neighborhood search metaheuristic with several neighborhood structures. The driver shift length and capacitated constraints are penalized and included into the objective function. Some numerical results for the real test instances are discussed.

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

Access this article

Log in via an institution

Price includes VAT (Canada)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

REFERENCES

  1. G. B. Dantzig and J. H. Ramser, “The Truck Dispatching Problem,” Manage. Sci. 6 (1), 80–91 (1959).

    Article  MathSciNet  Google Scholar 

  2. S. Salhi, A. Imran, and N. A. Wassan, “The Multi-Depot Vehicle Routing Problem with Heterogeneous Vehicle Fleet: Formulation and a Variable Neighborhood Search Implementation,” Comput. Oper. Res. 52, 315–325 (2014).

    Article  MathSciNet  Google Scholar 

  3. N. Christofides and J. E. Beasley, “The Period Routing Problem,” Networks14 (2), 237–256 (1984).

    Article  Google Scholar 

  4. A. A. Kovacs, S. N. Parragh, and R. F. Hartl, “A Template-Based Adaptive Large Neighborhood Search for the Consistent Vehicle Routing Problem,” Networks 63 (1), 60–81 (2014).

    Article  MathSciNet  Google Scholar 

  5. M. Gaudioso and G. Paletta, “A Heuristic for the Periodic Vehicle Routing Problem,” Transportation Sci. 26 (2), 86–92 (1992).

    Article  Google Scholar 

  6. C. Groër, B. Golden, and E. Wasil, “The Consistent Vehicle Routing Problem,” Manuf. & Serv. Oper. Manag. 11 (4), 630–643 (2009).

    Article  Google Scholar 

  7. E. G. Talbi, Metaheuristics: From Design to Implementation (Wiley, Hoboken, NJ, 2009).

    Book  Google Scholar 

  8. N. Mladenovic and P. Hansen, “Variable Neighborhood Search,” Comput. Oper. Res. 24, 1097–1100 (1997).

    Article  MathSciNet  Google Scholar 

  9. N. Mladenovic and P. Hansen, “Developments of Variable Neighborhood Search,” in Essays and Surveys in Metaheuristics, Ed. by C. C. Ribeiro and P. Hansen, Vol. 2 (Springer, Boston, MA, 2002), pp. 415–439.

  10. B. W. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” Bell System Techn. J. 49 (2), 291–307 (1970).

    Article  Google Scholar 

  11. P. A. Kononova and Y. A. Kochetov, “The Variable Neighborhood Search for the Two Machine Flow Shop Problem with a Passive Prefetch,” Diskretn. Anal. Issled. Oper.19 (5), 63–82 (2012) [J. Appl. Industr. Math. 7 (1), 54–67 (2013)].

    Article  Google Scholar 

  12. I. N. Kulachenko and P. A. Kononova, “The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints,” Commun. Comput. Inform. Sci. 1090, 51–67 (2019).

    Article  Google Scholar 

  13. I. N. Kulachenko, P. A. Kononova, Yu. A. Kochetov, and A. A. Kurochkin, “The Variable Neighborhood Search for a Consistent Vehicle Routing Problem Under the Shift Length Constraints,” IFAC-PapersOnLine 52 (13), 2314–2319 (2019).

    Article  Google Scholar 

  14. E. H. L. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization (John Wiley & Sons, New York, 1997).

    MATH  Google Scholar 

  15. The Vehicle Routing Problem: Latest Advances and New Challenges, Ed. by B. L. Golden, S. Raghavan, and E. A. Wasil (Springer, New York, 2008).

  16. L. K. Grover, “Local Search and the Local Structure of NP-Complete Problems,” Oper. Res. Lett. 12 (4), 235–243 (1992).

    Article  MathSciNet  Google Scholar 

  17. E. Alekseeva, Yu. Kochetov, and A. Plyasunov, “Complexity of Local Search for the \(p \)-Median Problem,” European J. Oper. Res.191 (3), 736–752 (2008).

    Article  MathSciNet  Google Scholar 

  18. G. Z. Gutin and A. Yeo, “Small Diameter Neighbourhood Graphs for the Traveling Salesman Problem: At Most Four Moves from Tour to Tour,” Comput. Oper. Res.26 (4), 321–327 (1999).

    Article  MathSciNet  Google Scholar 

  19. R. K. Ahuja, Ö. Ergun, J. B. Orlin, and A. P. Punnen, “A Survey of Very Large-Scale Neighborhood Search Techniques,” Discrete Appl. Math. 123 (1–3), 75–102 (2002).

    Article  MathSciNet  Google Scholar 

  20. Yu. A. Kochetov, “Computational Bounds for Local Search in Combinatorial Optimization,” Comput. Math. and Math. Phys. 48 (5), 747–763 (2008).

    Article  MathSciNet  Google Scholar 

  21. P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications, 2nd Ed. (SIAM, Philadelphia, PA, 2014).

  22. Yu. Kochetov, P. Kononova, and M. Paschenko, “Formulation Space Search Approach for the Teacher/Class Timetabling Problem,” Yugosl. J. Oper. Res. 18 (1), 1–11 (2008).

    Article  MathSciNet  Google Scholar 

  23. V. C. Hemmelmayr, K. F. Doerner, and R. F. Hartl, “A Variable Neighborhood Search Heuristic for Periodic Routing Problems,” European J. Oper. Res.195 (3), 791–802 (2009).

    Article  Google Scholar 

  24. Yu. A. Kochetov and A. V. Khmelev, “A Hybrid Algorithm of Local Search for the Heterogeneous Fixed Fleet Vehicle Routing Problem,” Diskret. Anal. Issled. Oper.22 (5), 5–29 (2015) [J. Appl. Industr. Math. 9 (4), 503–518 (2015)].

    Article  Google Scholar 

  25. A. Khmelev and Yu. Kochetov, “A Hybrid VND Method for the Split Delivery Vehicle Routing Problem,” Electron. Notes Discrete Math. 47, 5–12 (2015).

    Article  MathSciNet  Google Scholar 

  26. I. Davydov, Y. Kochetov, and E. Carrizosa, “A Local Search Heuristic for the \((r|p) \)-Centroid Problem in the Plane,” Comput. Oper. Res. 52, 334–340 (2014).

    Article  MathSciNet  Google Scholar 

  27. Z. Diakova and Y. Kochetov, “A Double VNS Heuristic for the Facility Location and Pricing Problem,” Electron. Notes Discrete Math. 39, 29–34 (2012).

    Article  MathSciNet  Google Scholar 

  28. I. Davydov, Y. Kochetov, and E. Carrizosa, “VNS Heuristic for the \((r|p) \)-Centroid Problem on the Plane,” Electron. Notes Discrete Math. 39, 5–12 (2012).

    Article  MathSciNet  Google Scholar 

Download references

Funding

The authors were supported by the Russian Foundation for Basic Research and the Novosibirsk region (project no. 19–47–540005).

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, 630090, Russia

    I. N. Kulachenko

  2. Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia

    P. A. Kononova

Authors
  1. I. N. Kulachenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. A. Kononova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to I. N. Kulachenko or P. A. Kononova.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kulachenko, I.N., Kononova, P.A. A Hybrid Local Search Algorithm for the Consistent Periodic Vehicle Routing Problem. J. Appl. Ind. Math. 14, 340–352 (2020). https://doi.org/10.1134/S199047892002012X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S199047892002012X

Keywords

search

Navigation