Results 21 to 30 of about 28,852 (210)
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
Algorithms, 2020 In this paper, a novel graph model to figure Collision-Free Multiple Traveling Salesman Problem (CFMTSP) is proposed. In this problem, a group of vehicles start from different nodes in an undirected graph and must visit each node in the graph, following ...
Anugrah K. Pamosoaji +1 more
doaj +1 more source
Optimizing the exploratory drilling rig route based on the Multi-Objective Multiple Traveling Salesman Problem [PDF]
International Journal of Mining and Geo-Engineering, 2022 Exploratory drilling is one of the most important and costly stages of mineral exploration procedures, so the continuation of mining activities depends on the gathered data during this stage.
Elhmam Ghadiri Sufi +2 more
doaj +1 more source
Axioms, 2021 There are many sub-tour elimination constraint (SEC) formulations for the traveling salesman problem (TSP). Among the different methods found in articles, usually three apply more than others.
Ramin Bazrafshan +2 more
doaj +1 more source
Reordering Rows for Better Compression: Beyond the Lexicographic Order [PDF]
, 2012 Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived
Gutarra, Eduardo +2 more
core +2 more sources
Approximability of the Multiple Stack TSP [PDF]
, 2009 STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability.
Toulouse, Sophie
core +4 more sources
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
Automated Map Generation for the Physical Traveling Salesman Problem [PDF]
, 2013 This paper presents a method for generating complex problems that allow multiple nonobvious solutions for the physical traveling salesman problem (PTSP).
Lucas, Simon M +4 more
core +1 more source
A novel clustering method for breaking down the symmetric multiple traveling salesman problem
Journal of Industrial Engineering and Management, 2021 Purpose: This study proposes a new two-stage clustering method to break down the symmetric multiple traveling salesman problem (mTSP) into several single standard traveling salesman problems, each of which can then be solved separately using a heuristic ...
Basma Hamdan, Hamdi Bashir, Ali Cheaitou
doaj +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