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
Velocity‐based stowage policy for a semiautomated fulfillment system
Production and Operations Management, EarlyView., 2022 Abstract Online retail fulfillment is increasingly performed by semiautomated fulfillment systems in which inventory is stored in mobile pods that are moved by robotic drives. In this paper, we develop a model that explores the benefits of velocity‐based stowage policies for semiautomated fulfillment systems, also known as robotic mobile fulfillment ...
Tolga Cezik +2 more
wiley +1 more source
Novel Heuristic for New Pentagonal Neutrosophic Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2022 This paper presents a new variant of Travelling Salesman Problem (TSP) and its first resolution. In literature there is not any research work that has presented the TSP under pentagonal fuzzy neutrosophic environment yet.
Souhail Dhouib
doaj +1 more source
Journal of Transportation and Logistics, 2018 Logistics sector is one of the most prominent field in economic development of a country. Travelling Salesman Problem which is studied commonly in logistic sector is also based a number of other problems.
Mehmet Aksaraylı, Osman Pala
doaj +1 more source
Optimization of Single-valued Triangular Neutrosophic Fuzzy Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2023 The travelling salesman problem(TSP) is a classic optimization puzzle, widely studied and celebrated for its significance in operations research, mathematics and computer science.
Subadhra Srinivas, K. Prabakaran
doaj +1 more source
POPMUSIC for the travelling salesman problem [PDF]
European Journal of Operational Research, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taillard, Eric, Helsgaun, Keld
openaire +3 more sources
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
Development of Heuristic Approaches for Last-Mile Delivery TSP with a Truck and Multiple Drones
Drones, 2023 Unmanned Aerial Vehicles (UAVs) are gaining momentum in many civil and military sectors. An example is represented by the logistics sector, where UAVs have been proven to be able to improve the efficiency of the process itself, as their cooperation with ...
Marco Rinaldi +4 more
doaj +1 more source
Reassembling Trees for the Traveling Salesman [PDF]
SIAM Journal on Discrete Mathematics, 2016 minor revision, final version, to appear in SIAM Journal of Discrete Mathematics, please use color ...
openaire +3 more sources
Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm [PDF]
Journal of Project ManagementThe Multiple Travelling Salesman Problem (MTSP) is one of the prominent combinatorial optimization problems with both theoretical interest and practical applications.
M. Veeresh +2 more
doaj +1 more source