The Variable Neighborhood Search for a Consistent Vehicle Routing Problem under the Shift Length Constraints

I. N. Kulachenko, P. A. Kononova, Y. A. Kochetov, A. A. Kurochkin

Результат исследования: Научные публикации в периодических изданияхстатья по материалам конференции

1 Цитирования (Scopus)

Аннотация

This paper addresses a new real-world application of vehicle routing planning in a finite time horizon. A company in the small package shipping industry has a limited fleet of identical 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, a company tries to increase the service quality. To this end, each client should be visited by one driver only. The goal is to minimize the total traveling distance for all vehicles over the planning horizon under the frequency constraints and driver shift length constraints. We present an integer linear programming model for this new consistent vehicle routing problem. To find near optimal solutions, we design the Variable Neighborhood Search metaheuristic with nine neighborhood structures. The driver shift length constraints are penalized and included in 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.

Язык оригиналаанглийский
Страницы (с-по)2314-2319
Число страниц6
ЖурналIfac papersonline
Том52
Номер выпуска13
DOI
СостояниеОпубликовано - сен 2019
Событие9th IFAC/IFIP/IFORS/IISE/INFORMS Conference on Manufacturing Modelling, Management and Control (IFAC MIM) - Berlin, Германия
Продолжительность: 28 авг 201930 авг 2019

Цитировать