The Mixed Chinese Postman Problem
The routing problems are important for logistic and transport sphere. Basically, the routing problems related to determining the optimal set of routes in the multigraph. The Chinese postman problem (CPP) is a special case of the routing problem, which has many potential applications. We propose to s...
Main Authors: | M. K. Gordenko, S. M. 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/316 |
Similar Items
-
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) -
On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem
by: V. V. Vasilchikov
Published: (2016-08-01) -
IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
Unusual Maths clock or Reverse Traveling Salesman Problem
by: Valerij F. Ochkov, et al.
Published: (2016-05-01) -
Двухуровневый эволюционный подход к маршрутизации группы подводных роботов в условиях периодической ротации состава
by: Igor Vyacheslavovich Bychkov, et al.
Published: (2019-04-01)