Results 31 to 40 of about 17,281 (197)
Robotics, 2022 Industrial robot applications should be designed to allow the robot to provide the best performance for increasing throughput. In this regard, both trajectory and task order optimization are crucial, since they can heavily impact cycle time. Moreover, it
Matteo Bottin +2 more
doaj +1 more source
Multiple Carrier-Vehicle Travelling Salesman Problem
, 2020 In this paper the Carrier-Vehicle Travelling Salesman Problem (CV-TSP) is extended to the case of 2 carriers and one small vehicle. The paper defines a minimum-time trajectory mission plan for the visit of a group of target points by the small vehicle.
Fahradyan, Tigran +2 more
openaire +2 more sources
Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm [PDF]
Decision Science LettersThe multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution.
M. Veeresh +2 more
doaj +1 more source
IMPLEMENTASI DAN ANALISA KINERJA ALGORITMA ANT SYSTEM (AS) DALAM PENYELESAIAN MULTIPLE TRAVELLING SALESMAN PROBLEM (MTSP) [PDF]
, 2011 Penelitian ini bertuiuan untuk membangun dan menganalisa kinerja suatu sistem algoritma Ant System (AS) untuk penyelesaian Multiple Travelling Salesman Problem (MTSP).
Susilo, Boko +2 more
core +1 more source
A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem
Applied Sciences, 2020 In order to solve the problem of poor local optimization of the Slime Mold Algorithm (SMA) in the Travelling Salesman Problem (TSP), a Two-way Parallel Slime Mold Algorithm by Flow and Distance (TPSMA) is proposed in this paper. Firstly, the flow between
Meijiao Liu +7 more
doaj +1 more source
Transport and Telecommunication, 2023 Travelling salesman problem (TSP) is a well known combinatorial optimization problem which has drawn colossal attention due to its eclectic range of applications.
Halder Swapna +5 more
doaj +1 more source
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
Journal of King Saud University: Computer and Information Sciences, 2022 Capacitated Vehicle routing problem is NP-hard scheduling problem in which the main concern is to find the best routes with minimum cost for a number of vehicles serving a number of scattered customers under some vehicle capacity constraint.
Lamees Mohammad Dalbah +3 more
doaj +1 more source
On the high multiplicity traveling salesman problem
Discrete Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoriev, A., van de Klundert, J.
openaire +3 more sources
Two Phase Heuristic Algorithm for theMultiple-Travelling Salesman Problem [PDF]
, 2018 The multiple-travelling salesman problem (MTSP) is a computationally complex combinatorial optimisation problem, with several theoretical and real-world applications. However, many state-of-the-art heuristic approaches intended to specifically solve MTSP,
CQ Hu +10 more
core +1 more source
Solving the Multiple Traveling Salesman Problem Using Memetic Algorithm
Artificial Intelligence Evolution, 2022 The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding the shortest tour between different cities with a set of constraints such as visiting each city once by one salesman. The solution tour represents the sum of all tours' costs performed by n salesmen.
Ahmad T. Al- Taani, Lubna M. Al-Afifi
openaire +2 more sources