Results 21 to 30 of about 17,281 (197)
Solving multiple travelling salesman problem through deep convolutional neural network
IET Cyber-systems and Robotics, 2023 The multiple travelling salesman problem (mTSP) is a classical optimisation problem that is widely applied in various fields. Although the mTSP was solved using both classical algorithms and artificial neural networks, reiteration is inevitable for these
Zhengxuan Ling, Yueling Zhou, Yu Zhang
doaj +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
Approximation of the Double Traveling Salesman Problem with Multiple Stacks
Theoretical Computer Science, 2021 The Double Travelling Salesman Problem with Multiple Stacks, DTSPMS, deals with the collect and delivery of n commodities in two distinct cities, where the pickup and the delivery tours are related by LIFO constraints. During the pickup tour, commodities are loaded into a container of k rows, or stacks, with capacity c.
Alfandari, Laurent, Toulouse, Sophie
openaire +3 more sources
Agriculture, 2022 In view of the difficulties of fruit cluster identification, the specific harvesting sequence constraints of aggregated fruits, and the balanced harvesting task assignment for the multiple arms with a series-increasing symmetric shared (SISS) region ...
Shuzhen Yang +3 more
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
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
JMA: Nature-Inspired Java Macaque Algorithm for Optimization Problem
Mathematics, 2022 In recent years, optimization problems have been intriguing in the field of computation and engineering due to various conflicting objectives. The complexity of the optimization problem also dramatically increases with respect to a complex search space ...
Dinesh Karunanidy +7 more
doaj +1 more source
The probabilistic heuristic in local (PHIL) search meta-strategy [PDF]
, 2005 Local search, in either best or first admissible form, generally suffers from poor solution qualities as search cannot be continued beyond locally optimal points. Even multiple start local search strategies can suffer this problem.
A. Ernst +10 more
core +1 more source
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
, 2021 25 pages, 3 ...
Bérczi, Kristóf +2 more
openaire +2 more sources
Modeling the flying sidekick traveling salesman problem with multiple drones
Networks, 2021 AbstractThis article considers a version of the flying sidekick traveling salesman problem in which parcels are delivered to customers by either a truck or a set of identical flying drones. The flights of the drones are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must ...
Mauro Dell'Amico +2 more
openaire +2 more sources