Standard

The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints. / Kulachenko, Igor; Kononova, Polina.

Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. ed. / Igor Bykadorov; Vitaly Strusevich; Tatiana Tchemisova. Springer Gabler, 2019. p. 51-67 (Communications in Computer and Information Science; Vol. 1090 CCIS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

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. Communications in Computer and Information Science, vol. 1090 CCIS, Springer Gabler, pp. 51-67, 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Russian Federation, 08.07.2019. https://doi.org/10.1007/978-3-030-33394-2_5

APA

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

Vancouver

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

Author

Kulachenko, Igor ; Kononova, Polina. / The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints. Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. editor / Igor Bykadorov ; Vitaly Strusevich ; Tatiana Tchemisova. Springer Gabler, 2019. pp. 51-67 (Communications in Computer and Information Science).

BibTeX

@inproceedings{9c47ea015e2f4aa39ac6d037a44f578f,
title = "The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints",
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{\textquoteright} 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.",
keywords = "Computer experiments, Mathematical models, Operations research, Optimization problems, Routing algorithms, Search methods, Time scheduling",
author = "Igor Kulachenko and Polina Kononova",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-33394-2_5",
language = "English",
isbn = "9783030333935",
series = "Communications in Computer and Information Science",
publisher = "Springer Gabler",
pages = "51--67",
editor = "Igor Bykadorov and Vitaly Strusevich and Tatiana Tchemisova",
booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers",
address = "Germany",
note = "18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",

}

RIS

TY - GEN

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

AU - Kulachenko, Igor

AU - Kononova, Polina

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Computer experiments

KW - Mathematical models

KW - Operations research

KW - Optimization problems

KW - Routing algorithms

KW - Search methods

KW - Time scheduling

UR - http://www.scopus.com/inward/record.url?scp=85076178095&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-33394-2_5

DO - 10.1007/978-3-030-33394-2_5

M3 - Conference contribution

AN - SCOPUS:85076178095

SN - 9783030333935

T3 - Communications in Computer and Information Science

SP - 51

EP - 67

BT - Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers

A2 - Bykadorov, Igor

A2 - Strusevich, Vitaly

A2 - Tchemisova, Tatiana

PB - Springer Gabler

T2 - 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019

Y2 - 8 July 2019 through 12 July 2019

ER -

ID: 22995900