Results 11 to 20 of about 4,258 (228)
The intermittent travelling salesman problem [PDF]
International Transactions in Operational Research, 2018 AbstractIn this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive
Pham, Tú San +2 more
openaire +3 more sources
The selective travelling salesman problem
Discrete Applied Mathematics, 1990 This paper deals with exact solutions for the Selective Traveling Salesman Problem - a TSP with profit at the nodes - by branch-and bound. The contribution is in the form of a new upper bound calculation as well as two node partitioning rules.
Gilbert Laporte, Silvano Martello
openaire +3 more sources
A hybrid genetic algorithm and inver over approach for the travelling salesman problem [PDF]
, 2010 This article posted here with permission of the IEEE - Copyright @ 2010 IEEEThis paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP).
Yang, S +5 more
core +3 more sources
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
IET Networks, EarlyView., 2022 Abstract Everything can be connected in the Internet of Things (IoTs) technology that enables efficient communication between connected objects. IoTs industry‐based meta‐heuristic and mining algorithms, which are considered an important field of Artificial Intelligence will be used to construct a healthcare application in this study for lowering costs,
Muhaned Al‐Hashimi +4 more
wiley +1 more source
A Labelling Method for the Travelling Salesman Problem
Applied Sciences, 2023 The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized.
Trust Tawanda +3 more
doaj +1 more source
Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems [PDF]
Yugoslav Journal of Operations Research, 2023 In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP).
Morales Fernando A.
doaj +1 more source
Traveling salesman problem with a center [PDF]
Physical Review E, 2005 We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $
Adam Lipowski, Dorota Lipowska
openaire +3 more sources
An open close multiple travelling salesman problem with single depot [PDF]
Decision Science Letters, 2019 This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP).
Jayanth Kumar Thenepalle +1 more
doaj +1 more source
Traveling salesman path problems [PDF]
Mathematical Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources