Results 11 to 20 of about 496 (169)

An ant colony genetic fusion routing algorithm based on soft define network

open access: yesIET 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

Optimised Internet of Thing framework based hybrid meta‐heuristic algorithms for E‐healthcare monitoring

open access: yesIET 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

open access: yesProduction 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

JMA: Nature-Inspired Java Macaque Algorithm for Optimization Problem

open access: yesMathematics, 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

Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems

open access: yes, 2021
25 pages, 3 ...
Bérczi, Kristóf   +2 more
openaire   +2 more sources

Modeling the flying sidekick traveling salesman problem with multiple drones

open access: yesNetworks, 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

Optimizing Cycle Time of Industrial Robotic Tasks with Multiple Feasible Configurations at the Working Points

open access: yesRobotics, 2022
Industrial robot applications should be designed to allow the robot to provide the best performance for increasing throughput. In this regard, both trajectory and task order optimization are crucial, since they can heavily impact cycle time. Moreover, it
Matteo Bottin   +2 more
doaj   +1 more source

Multiple Carrier-Vehicle Travelling Salesman Problem

open access: yes, 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

Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm [PDF]

open access: yesDecision Science Letters
The multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution.
M. Veeresh   +2 more
doaj   +1 more source

A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem

open access: yesApplied Sciences, 2020
In order to solve the problem of poor local optimization of the Slime Mold Algorithm (SMA) in the Travelling Salesman Problem (TSP), a Two-way Parallel Slime Mold Algorithm by Flow and Distance (TPSMA) is proposed in this paper. Firstly, the flow between
Meijiao Liu   +7 more
doaj   +1 more source

Home - About - Disclaimer - Privacy