RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2015, Volume 22, Number 5, Pages 5–29 (Mi da826)  

This article is cited in 5 scientific papers (total in 5 papers)

Hybrid local search for the heterogenous fixed fleet vehicle routing problem

Yu. A. Kochetova, A. V. Khmelevb

a Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We consider the heterogeneous fixed fleet vehicle routing problem and assume that customers are presented by points in Euclidean plane and a limited fleet of heterogenous vehicles is available. The proposed hybrid local search algorithm uses permutations of customers for coding feasible solutions. For given permutation, the Lagrangian relaxation approach is applied as decoding method for this NP-hard problem. New intensification and diversification procedures are proposed and a new exponential neighborhood is introduced. Computational results for test instances with number of customers up to 255 are reported. New best found solutions are discovered for 15 test instances. Tab. 7, ill. 5, bibliogr. 26.

Keywords: local search, exponential neighborhood, Lagrangian relaxation, subgradient optimization.

DOI: https://doi.org/10.17377/daio.2015.22.479

Full text: PDF file (405 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2015, 9:4, 503–518

Bibliographic databases:

UDC: 519.85
Received: 13.03.2015
Revised: 15.06.2015

Citation: Yu. A. Kochetov, A. V. Khmelev, “Hybrid local search for the heterogenous fixed fleet vehicle routing problem”, Diskretn. Anal. Issled. Oper., 22:5 (2015), 5–29; J. Appl. Industr. Math., 9:4 (2015), 503–518

Citation in format AMSBIB
\Bibitem{KocKhm15}
\by Yu.~A.~Kochetov, A.~V.~Khmelev
\paper Hybrid local search for the heterogenous fixed fleet vehicle routing problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 5
\pages 5--29
\mathnet{http://mi.mathnet.ru/da826}
\crossref{https://doi.org/10.17377/daio.2015.22.479}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3467237}
\elib{http://elibrary.ru/item.asp?id=24323024}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 4
\pages 503--518
\crossref{https://doi.org/10.1134/S1990478915040079}


Linking options:
  • http://mi.mathnet.ru/eng/da826
  • http://mi.mathnet.ru/eng/da/v22/i5/p5

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. V. Khmelev, “Trekhfaznyi algoritm optimizatsii avtoparka i marshrutov transportnykh sredstv”, Diskretn. analiz i issled. oper., 22:6 (2015), 55–77  mathnet  crossref  mathscinet  elib
    2. I. L. Vasilyev, P. Avella, M. Boccia, “A branch and cut heuristic for a runway scheduling problem”, Autom. Remote Control, 77:11 (2016), 1985–1993  mathnet  crossref  isi  elib  elib
    3. I. S. Litvinchev, G. Cedillo, M. Velarde, “Integrating territory design and routing problems”, J. Comput. Syst. Sci. Int., 56:6 (2017), 969–974  crossref  crossref  mathscinet  zmath  isi  elib  scopus
    4. M. R. de Holanda Maia, A. Plastino, P. H. Vaz Penna, “Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem”, Rairo-Oper. Res., 52:3 (2018), 661–690  crossref  mathscinet  zmath  isi  scopus
    5. B. Rabbouch, R. Mraihi, F. Saadaoui, “A recent brief survey for the multi depot heterogenous vehicle routing problem with time windows”, Hybrid Intelligent Systems, HIS 2017, Advances in Intelligent Systems and Computing, 734, eds. A. Abraham, P. Muhuri, A. Muda, N. Gandhi, Springer, 2018, 147–157  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:255
    Full text:83
    References:37
    First page:19

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020