Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, 2015, Volume 22, Issue 5, Pages 5–29
DOI: https://doi.org/10.17377/daio.2015.22.479 (Mi da826) 		 
This article is cited in 13 scientific papers (total in 13 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
Full-text PDF (405 kB) Citations (13)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.479
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.
Received: 13.03.2015
Revised: 15.06.2015
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 4, Pages 503–518
DOI: https://doi.org/10.1134/S1990478915040079
Bibliographic databases:
Document Type: Article
UDC: 519.85
Language: Russian
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{https://mathscinet.ams.org/mathscinet-getitem?mr=3467237}
\elib{https://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:
  • https://www.mathnet.ru/eng/da826
  • https://www.mathnet.ru/eng/da/v22/i5/p5
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025