Results 1 to 10 of about 225 (131)
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
IEEE Transactions on Automation Science and EngineeringA bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources ...
Yangming Zhou +2 more
exaly +3 more sources
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem [PDF]
Journal of Discrete Algorithms, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ming-Yang Kao, Manan Sanghi
core +4 more sources
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van der Veen, Jack A.A.
core +7 more sources
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem [PDF]
ACM Transactions on Algorithms, 2010 We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem . Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck (or maximum-length edge) cost.
Hyung-Chan An +2 more
openaire +3 more sources
Experimental analysis of heuristics for the bottleneck traveling salesman problem [PDF]
Journal of Heuristics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abraham P Punnen +2 more
exaly +3 more sources
Improved artificial bee colony algorithm for large scale colored bottleneck traveling salesman problem [PDF]
Tongxin xuebao, 2018 In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its algorithms.
Wenyong DONG, Xueshi DONG, Yufeng WANG
openaire +4 more sources
Traveling salesman problem under categorization
Operations Research Letters, 1992 We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem.
Abraham P Punnen
exaly +2 more sources
The bottleneck traveling salesman problem and some variations [PDF]
, 2010 We present powerful heuristics for the bottleneck traveling salesman problem (BTSP) and closely related problems such as the maximum scatter traveling salesman problem (MSTSP) and the balanced traveling salesman problem, the later being a new problem which we in- troduce. Extensive computational results are presented.
LaRusic, John
openaire +2 more sources
2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE), 2018 Due to the existence of multiple constraints and multiple optimization objectives, the competition decision for bottleneck traveling salesman problem is very difficult. The paper proposes the competition decision for bottleneck traveling salesman based on big data mining algorithm with multi-segment support.
Dai Ying
openaire +2 more sources
Minimizing capacity of Electric Vehicle Battery using Bottleneck Traveling Salesman Problem
Journal of Physics: Conference Series, 2021 Abstract Electrical vehicle technology has now developed. Various public transportation can start using electric power sources. However, there are battery capacity constraints. When the distance is too far, the battery capacity is not sufficient to provide the required power.
Rio Aurachman, Dyah Putri Saraswari
openaire +1 more source