A simple iterative model accurately captures complex trapline formation by bumblebees across spatial scales and flower arrangements. [PDF]
PLoS Computational Biology, 2013 Pollinating bees develop foraging circuits (traplines) to visit multiple flowers in a manner that minimizes overall travel distance, a task analogous to the travelling salesman problem.
Andrew M Reynolds +2 more
doaj +6 more sources
Hybrid pointer networks for traveling salesman problems optimization. [PDF]
PLoS ONE, 2021 In this work, we proposed a hybrid pointer network (HPN), an end-to-end deep reinforcement learning architecture is provided to tackle the travelling salesman problem (TSP). HPN builds upon graph pointer networks, an extension of pointer networks with an
Ahmed Stohy +7 more
doaj +2 more sources
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering, 2019 In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation ...
Yang Shuai, Shao Yunfeng, Zhang Kai
doaj +2 more sources
Improved dynamic programming method for solving multi-objective and multi-stage decision-making problems [PDF]
Scientific ReportsMulti-objective and multi-stage decision-making problems require balancing multiple objectives at each stage and making optimal decision in multi-dimensional control variables, where the commonly used intelligent optimization algorithms suffer from low ...
Zhihao Liang +3 more
doaj +2 more sources
Genetic algorithm to the bi-objective multiple travelling salesman problem
Alexandria Engineering JournalThe travelling salesman problem (TSP) and its variants have been studied extensively due to its wide range of real-world applications, yet there are challenges in providing efficient algorithms to deal with some of its variants.
Shayathri Linganathan +1 more
doaj +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 +2 more sources
An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint [PDF]
Decision Science Letters, 2021 The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications.
Purusotham Singamsetty +1 more
doaj +1 more source
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
Genetic Algorithms for the Multiple Travelling Salesman Problem [PDF]
International Journal of Advanced Computer Science and Applications, 2020 We consider the multiple travelling salesman Problem (MTSP) that is one of the generalization of the travelling salesman problem (TSP). For solving this problem genetic algorithms (GAs) based on numerous crossover operators have been described in the literature. Choosing effective crossover operator can give effective GA.
Maha Ata Al-Furhud, Zakir Hussain
openaire +1 more source
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