Results 31 to 40 of about 28,986 (210)
Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP
Algorithms, 2023 A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP.
Sílvia de Castro Pereira +2 more
doaj +1 more source
A New Cooperative Framework for Parallel Trajectory-Based Metaheuristics
, 2018 In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently.
Shi, Jialong, Zhang, Qingfu
core +1 more source
Exact algorithms for the order picking problem [PDF]
, 2018 Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force.
Cambazard, Hadrien +2 more
core +4 more sources
The Multiple Traveling Salesman Problem with Backup Coverage
Electronic Notes in Discrete Mathematics, 2018 Abstract We consider a variant of the classical Multiple Traveling Salesmen Problem in which the distance between any two vehicles is never greater than a fixed distance D. This new feature allows salesmen to help each other timely if an emergency happens, with an estimated backup response time related to D.
Guilherme Dhein +2 more
openaire +1 more source
RoboTSP - A Fast Solution to the Robotic Task Sequencing Problem
, 2017 In many industrial robotics applications, such as spot-welding, spray-painting or drilling, the robot is required to visit successively multiple targets.
Lembono, Teguh Santoso +2 more
core +1 more source
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
Sensors, 2019 A solution to the multiple depot heterogeneous traveling salesman problem with a min-max objective is in great demand with many potential applications of unmanned vehicles, as it is highly related to a reduction in the job completion time.
Jungyun Bae, Woojin Chung
doaj +1 more source
Indoor Traveling Salesman Problem (ITSP) Path Planning
ISPRS International Journal of Geo-Information, 2021 With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance ...
Jinjin Yan +3 more
doaj +1 more source
An interacting replica approach applied to the traveling salesman problem
, 2016 We present a physics inspired heuristic method for solving combinatorial optimization problems. Our approach is specifically motivated by the desire to avoid trapping in metastable local minima- a common occurrence in hard problems with multiple extrema.
Leonard, Blake +3 more
core +1 more source
ROUTE OPTIMIZATION OF MULTIPLE-AGENT TRAVELLING SALESMAN PROBLEM
Czech Journal of Civil Engineering, 2018 Route optimization is quotidian engineering problem. Problem of finding the optimal and suboptimal routes is one of the most studied optimization problem. In this paper, author firstly presented a short literature overview of the history of routing problems and namely travelling salesman problem (TSP).
openaire +3 more sources