Results 11 to 20 of about 28,852 (210)
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
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
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
An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets
Algorithms, 2018 The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems.
Furqan Hussain Essani, Sajjad Haider
doaj +1 more source
Multiple Carrier-Vehicle Travelling Salesman Problem
, 2020 In this paper the Carrier-Vehicle Travelling Salesman Problem (CV-TSP) is extended to the case of 2 carriers and one small vehicle. The paper defines a minimum-time trajectory mission plan for the visit of a group of target points by the small vehicle.
Fahradyan, Tigran +2 more
openaire +2 more sources
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 +5 more
doaj +1 more source
Transformations of node-balanced routing problems [PDF]
, 2015 This paper describes a polynomial transformation for a class of unit-demand vehicle routing problems, named node-balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the
Baldacci +23 more
core +1 more source
On the high multiplicity traveling salesman problem
Discrete Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoriev, A., van de Klundert, J.
openaire +3 more sources