The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints

Igor Kulachenko, Polina Kononova

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We consider a new real-world application of vehicle routing planning in a finite time horizon. A company has a set of capacitated vehicles in some depots and must serve a set of clients. There is a frequency for each client stating how often this client must be visited. Time intervals between two consecutive visits must be the same but the visiting schedule is flexible. To get some competitive advantage, the company tries to increase its service quality. To this end, each client should be visited by one driver only. The goal is to minimize the total length of vehicles’ paths over the planning horizon under the frequency constraints and driver shift length constraints. We present an 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 eleven neighborhood structures. The driver shift length and capacity constraints are penalized and included into the objective function. Empirical results for real test instances from Orenburg region in Russia with up to 900 clients and four weeks in the planning horizon are discussed.

Original languageEnglish
Title of host publicationMathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers
EditorsIgor Bykadorov, Vitaly Strusevich, Tatiana Tchemisova
PublisherSpringer Gabler
Pages51-67
Number of pages17
ISBN (Print)9783030333935
DOIs
Publication statusPublished - 1 Jan 2019
Event18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 - Ekaterinburg, Russian Federation
Duration: 8 Jul 201912 Jul 2019

Publication series

NameCommunications in Computer and Information Science
Volume1090 CCIS
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

Conference18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019
CountryRussian Federation
CityEkaterinburg
Period08.07.201912.07.2019

Keywords

  • Computer experiments
  • Mathematical models
  • Operations research
  • Optimization problems
  • Routing algorithms
  • Search methods
  • Time scheduling

Fingerprint Dive into the research topics of 'The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints'. Together they form a unique fingerprint.

  • Cite this

    Kulachenko, I., & Kononova, P. (2019). The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints. In I. Bykadorov, V. Strusevich, & T. Tchemisova (Eds.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers (pp. 51-67). (Communications in Computer and Information Science; Vol. 1090 CCIS). Springer Gabler. https://doi.org/10.1007/978-3-030-33394-2_5