Analysis of Mathematical Formulations of Capacitated Vehicle Routing Problem and Methods for their Solution
Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. In this study we analyze Capacitated Vehicle Routing Problem (CV...
Main Authors: | E. . Beresneva, S. . Avdoshin |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/533 |
Similar Items
-
Constructive heuristics for Capacitated Vehicle Routing Problem: a comparative study
by: Sergey Mikhailovitch Avdoshin, et al.
Published: (2019-09-01) -
Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study
by: Sergey Mikchailovitch Avdochin, et al.
Published: (2019-10-01) -
Variants of Chinese Postman Problems and a Way of Solving through Transformation into Vehicle Routing Problems
by: M. K. Gordenko, et al.
Published: (2018-10-01) -
The Mixed Chinese Postman Problem
by: M. K. Gordenko, et al.
Published: (2018-10-01) -
Двухуровневый эволюционный подход к маршрутизации группы подводных роботов в условиях периодической ротации состава
by: Igor Vyacheslavovich Bychkov, et al.
Published: (2019-04-01)