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 6, Pages 55–77 (Mi da833)  

This article is cited in 1 scientific paper (total in 1 paper)

A three-phase heuristic for the vehicle fleet and route optimization

A. V. Khmelev

Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We consider the applied vehicle routing problem with time windows. Each driver works in a given shift. Each shift has the start, finish and set of pauses which need to be scheduled en route. We introduce the mathematical formulation for this problem in terms of the mixed integer linear programming. In order to tackle large instances, we developed a three-phase local search algorithm with an effective procedure for search in neighbourhoods. Computational experiments for instances from one delivery company have shown the efficiency of the developed algorithm and significant reduction in costs. Tab. 2, ill. 4, bibliogr. 14.

Keywords: vehicle routing, time window, work shift, pause, local search, fleet optimization.

Funding Agency Grant Number
Russian Foundation for Basic Research 15-07-01141


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

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

Bibliographic databases:

UDC: 519.85
Received: 03.06.2015
Revised: 11.08.2015

Citation: A. V. Khmelev, “A three-phase heuristic for the vehicle fleet and route optimization”, Diskretn. Anal. Issled. Oper., 22:6 (2015), 55–77

Citation in format AMSBIB
\Bibitem{Khm15}
\by A.~V.~Khmelev
\paper A three-phase heuristic for the vehicle fleet and route optimization
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 6
\pages 55--77
\mathnet{http://mi.mathnet.ru/da833}
\crossref{https://doi.org/10.17377/daio.2015.22.496}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3497823}
\elib{http://elibrary.ru/item.asp?id=25124390}


Linking options:
  • http://mi.mathnet.ru/eng/da833
  • http://mi.mathnet.ru/eng/da/v22/i6/p55

    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. 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
  • Дискретный анализ и исследование операций
    Number of views:
    This page:220
    Full text:84
    References:42
    First page:19

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