Results 51 to 60 of about 15,296 (207)

Hybrid discrete coati optimization algorithm for solving large-scale multiple traveling salesman problem

Ain Shams Engineering Journal
The Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and is also categorized as NP-hard problem. The Multiple Traveling Salesmen Problem (MTSP) represents a variant of TSP, which is more complex and holds greater practical
Lun Zhu, Yongquan Zhou, Qifang Luo
doaj   +1 more source

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source

Turning Energy-Aware Route Planning With an Extended TSP and Double-Layer State Graph: Experimental Evaluation With a Crawler Mobile Robot

IEEE Access
For mobile robots with multiple destinations that must be visited only once, the Traveling Salesman Problem (TSP) provides an optimal route. The optimality may not be achieved for crawler robots, which are often used in the forestry industry and have a ...
Namihei Adachi, Hisashi Date
doaj   +1 more source

A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem

Applied Artificial Intelligence, 2020
The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions.
Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani   +2 more
doaj   +1 more source

Constant-Factor Approximation for TSP with Disks [PDF]

, 2016
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be ...
Dumitrescu, Adrian, Tóth, Csaba D.
core  

The centred travelling salesman at high temperature [PDF]

, 2006
A recently formulated statistical mechanics method is used to study the phase transition occurring in a generalisation of the Traveling Salesman Problem (TSP) known as the centred TSP. The method shows that the problem has clear signs of a crossover, but
Cheeseman P Kanefsky B Taylor W M, David Lancaster, Dean D S, Dean D S Lancaster D, Lancaster D, Vannimenus J   +5 more
core   +1 more source

The team orienteering problem with variable time windows

International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.
Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley   +1 more source

A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems

International Journal of Computational Intelligence Systems, 2018
Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo, Wei-Ying Yi, Pak-Kan Wong, Kwong-Sak Leung, Yee Leung, Sui-Tung Mak   +5 more
doaj   +1 more source

Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods

Algorithms, 2022
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the ...
Shalini Sharma, Jerry Chou
doaj   +1 more source

An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem [PDF]

, 2012
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once.
Karapetyan, Daniel, Reihaneh, Mohammad
core   +2 more sources