Skip to main content
SpringerLink
Log in

A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

Under consideration is the optimization problem for the routes of heterogeneous vehicles serving a given set of customers. It is assumed that the customers are represented by points in the plane, whereas the number of each type of vehicles is limited. To solve the problem, we developed a hybrid local search algorithm with coding the solutions as a sequence of customers. To decode the sequence, the corresponding NP-hard problem is solved by the method of Lagrangian relaxation. We propose new procedures for intensification and diversification of the search, as well as a new neighborhood of exponential size. The results of computational experiments are presented for the available test instances with the number of customers up to 255. For 15 instances we obtain new record values of the objective function.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. A. Davydov, P. A. Kononova, and Yu. A. Kochetov, “Local Search with an Exponential Neighborhood for the Servers Load Balancing Problem,” Diskretn. Anal. Issled. Oper. 21 (6), 21–34 (2014) [J. Appl. Indust. Math. 9 (1), 27–35 (2015)].

    Google Scholar 

  2. I. A. Davydov, Yu. A. Kochetov, N. Mladenovic, and D. Urosevic, “FastMetaheuristics for the Discrete (rp)-Centroid Problem,” Avtomat. i Telemekh. No. 4, 106–119 (2014) [Automat. Remote Control 75 (4), 677–687 (2014)].

    MathSciNet  Google Scholar 

  3. P. A. Kononova and Yu. 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. Indust.Math. 7 (1), 54–67 (2013)].

    Google Scholar 

  4. P. I. Stetsyuk, Ellipsoid Methods and r-Algorithms (Evrika, Chis¸ inau, 2014) [in Russian].

    Google Scholar 

  5. R. Baldacci, M. Battarra, and D. Vigo, “Routing a Heterogeneous Fleet of Vehicles,” in The Vehicle Routing Problem: Latest Advances and New Challenges, Ed. by B. Golden, S. Raghavan, and E. Wasil (Springer, New York, 2008), pp. 3–27.

    Chapter  Google Scholar 

  6. R. Baldacci and A. Mingozzi, “A Unified Exact Method for Solving Different Classes of Vehicle Routing Problems,” Math. Program. Ser. A 120 (2), 347–380 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Boudia, C. Prins, and M. Reghioui, “An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem,” in Hybrid Metaheuristics: Proceedings of the 4th International Workshop on Hybrid Metaheuristics (Dortmund, Germany, Oct. 8–9, 2007) (Springer, Berlin, 2007), pp. 16–30.

    Chapter  Google Scholar 

  8. J. Branda˜ o, “A Deterministic Tabu Search Algorithm for the Fleet Size and Mix Vehicle Routing Problem,” European J. Oper. Res. 195 (3), 716–728 (2009).

    Article  Google Scholar 

  9. J. Branda˜ o, “A Tabu Search Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem,” Comput. Oper. Res. 38 (1), 140–151 (2011).

    Article  MathSciNet  Google Scholar 

  10. J. Desrosiers, F. Soumis, M. Desrochers, and M. Sauve, “Methods for Routing with Time Windows,” European J. Oper. Res. 23 (2), 236–245 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  11. C. Duhamel, C. Gouinaud, P. Lacomme, and C. Prodhon, “A Multi-Thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem,” in Hybrid Metaheuristics, Ed. by El-G. Talbi (Springer, Heidelberg, 2013), pp. 237–269

    Chapter  Google Scholar 

  12. C. Duhamel, P. Lacomme, and C. Prodhon, “A GRASPxELS with depth First Search Split Procedure for the HVRP,” Res.Rep. LIMOS/RR-10-08 (Inst. Supér. Inform., Modél. Appl., Aubière, France, 2010). Available at http://www.isima.fr/˜lacomme/doc/RR_HVRP1-4_V1.pdf.

    Google Scholar 

  13. C. Duhamel, P. Lacomme, and C. Prodhon, “Efficient Frameworks for Greedy Split and New Depth First Search Split Procedures for Routing Problems,” Comput. Oper. Res. 38 (4), 723–739 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  14. F. Li, B. Golden, and E. Wasil, “A Record-to-Record Travel Algorithm for Solving the Heterogeneous Fleet Vehicle Routing Problem,” Comput. Oper. Res. 34 (9), 2734–2742 (2007).

    Article  MATH  Google Scholar 

  15. P. H. V. Penna, A. Subramanian, and L. S. Ochi, “An Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem,” J. Heuristics 19 (2), 201–232 (2013).

    Article  Google Scholar 

  16. P. H. V. Penna, T. Vidal, L. S. Ochi, and C. Prins, “New Compound Neighborhoods Structures for the Heterogeneous Fixed Fleet Vehicle Routing Problem,” in Proceedings of the XLV Symposium Bras. Pesqui. Operac. (Natal, Brazil, September 16–19, 2013), (Soc. Bras. Pesqui. Oper., Rio de Janeiro, 2013), pp. 3623–3633 [Available at http://ws2.din.uem.br/˜ademir/sbpo/sbpo2013/pdf/arq0110.pdf].

    Google Scholar 

  17. B. T. Poljak, “Subgradient Methods: A Survey of Soviet Research,” in Nonsmooth Optimization: Proceedings of IIASA Workshop (Laxenburg, Austria, March 28–April 8, 1977), Ed. by C. Lemarechal and R. Mifflin (Pergamon Press, Oxford, GB, 1977), pp. 5–29.

    Google Scholar 

  18. J.-Y. Potvin and M.-A. Naud, “Tabu Search with Ejection Chains for the Vehicle Routing Problem with Private Fleet and Common Carrier,” J. Oper. Res. Soc. 62 (2), 326–336 (2011).

    Article  Google Scholar 

  19. C. Prins, “Efficient Heuristics for the Heterogeneous Fleet Multitrip VRP with Application to a Large-Scale Real Case,” J. Math. Model. Algorithms 1 (2), 135–150 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  20. C. Prins, “Two Memetic Algorithms for Heterogeneous Fleet Vehicle Routing Problems,” Eng. Appl. Artif. Intell. 22 (6), 916–928 (2009).

    Article  Google Scholar 

  21. A. Subramanian, P. H. V. Penna, E. Uchoa, and L. S. Ochi, “A Hybrid Algorithm for the Heterogenous Fleet Vehicle Routing Problem,” European J. Oper. Res. 221 (2), 285–295 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  22. E. D. Taillard, “A Heuristic Column Generation Method for the Heterogeneous Fleet VRP,” RAIRO, Oper. Res. 33 (1), 1–14 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  23. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A List Based Threshold AcceptingMetaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem,” J. Oper. Res. Soc. 54 (1), 65–71 (2003).

    Article  MATH  Google Scholar 

  24. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A Threshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem,” European J. Oper. Res. 152 (1), 148–158 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  25. C. D. Tarantilis, E. E. Zachariadis, and C. T. Kiranoudis, “A Guided Tabu Search for the Heterogeneous Vehicle Routing Problem,” J. Oper. Res. Soc. 59 (12), 1659–1673 (2008).

    Article  MATH  Google Scholar 

  26. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A Unified Solution Framework for Multi-Attribute Vehicle Routing Problems,” European J. Oper. Res. 234 (3), 658–673 (2014).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    Yu. A. Kochetov

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    Yu. A. Kochetov & A. V. Khmelev

Authors
  1. Yu. A. Kochetov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Khmelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yu. A. Kochetov or A. V. Khmelev.

Additional information

Original Russian Text © Yu.A. Kochetov, A.V. Khmelev, 2015, published in Diskretnyi Analiz i Issledovanie Operatsii, 2015, Vol. 22, No. 5, pp. 5–26.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kochetov, Y.A., Khmelev, A.V. A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem. J. Appl. Ind. Math. 9, 503–518 (2015). https://doi.org/10.1134/S1990478915040079

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation