THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS
In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM). In contrast to the ordinary formulation of the DTSP, in the proposed DTSP-CM, the vehicle is requested to visit...
Saved in:
Main Authors: | Petr Váňa, Jan Faigl |
---|---|
Format: | Article |
Language: | English |
Published: |
Czech Technical University in Prague
2016-11-01
|
Series: | Acta Polytechnica CTU Proceedings |
Online Access: | https://ojs.cvut.cz/ojs/index.php/APP/article/view/3930 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS
by: Petr Váňa, et al.
Published: (2015-12-01) -
The Traveling salesman problem : a guided tour of combinatorial optimization /
Published: (1985) -
Immune-Genetic Algorithm for Traveling Salesman Problem
by: Lu, Jingui, et al.
Published: (2010) -
Privacy-Preserving Local Search for the Traveling Salesman Problem
by: Sakuma, Jun, et al.
Published: (2010) -
Chaos Driven Evolutionary Algorithm for the Traveling Salesman Problem
by: Zelinka, Ivan, et al.
Published: (2010)