Hybrid pointer networks for traveling salesman problems optimization. [PDF]
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
Improved dynamic programming method for solving multi-objective and multi-stage decision-making problems [PDF]
Multi-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
An open close multiple travelling salesman problem with single depot [PDF]
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]
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
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]
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
Solving multiple travelling salesman problem through deep convolutional neural network
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
Approximation of the Double Traveling Salesman Problem with Multiple Stacks
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
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
Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm [PDF]
The 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

