Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices
The paper addresses the synergies from combining a heuristic method with a predictive
technique to solve the Dynamic Traveling Salesman Problem (DTSP). Particularly, we build …
technique to solve the Dynamic Traveling Salesman Problem (DTSP). Particularly, we build …
Ant colony optimization with local search for dynamic traveling salesman problems
M Mavrovouniotis, FM Müller… - IEEE transactions on …, 2016 - ieeexplore.ieee.org
For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between
two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms …
two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms …
Evolving solutions to TSP variants for active space debris removal
The space close to our planet is getting more and more polluted. Orbiting debris are posing
an increasing threat to operational orbits and the cascading effect, known as Kessler …
an increasing threat to operational orbits and the cascading effect, known as Kessler …
[PDF][PDF] Solve traveling salesman problem using particle swarm optimization algorithm
The traveling salesman problem (TSP) is one of the most widely studied NP-hard
combinatorial optimization problems and traditional genetic algorithm trapped into the local …
combinatorial optimization problems and traditional genetic algorithm trapped into the local …
[HTML][HTML] A customized genetic algorithm for bi-objective routing in a dynamic network
A Maskooki, K Deb, M Kallio - European Journal of Operational Research, 2022 - Elsevier
The article presents a proposed customized genetic algorithm (CGA) to find the Pareto
frontier for a bi-objective integer linear programming (ILP) model of routing in a dynamic …
frontier for a bi-objective integer linear programming (ILP) model of routing in a dynamic …
[HTML][HTML] A comparative study of evolutionary approaches to the bi-objective dynamic Travelling Thief Problem
Dynamic evolutionary multi-objective optimization is a thriving research area. Recent
contributions span the development of specialized algorithms and the construction of …
contributions span the development of specialized algorithms and the construction of …
A new approach to solving dynamic traveling salesman problems
C Li, M Yang, L Kang - Asia-Pacific Conference on Simulated Evolution …, 2006 - Springer
Abstract The Traveling Salesman Problem (TSP) is one of the classic NP hard optimization
problems. The Dynamic TSP (DTSP) is arguably even more difficult than general static TSP …
problems. The Dynamic TSP (DTSP) is arguably even more difficult than general static TSP …
Integrating forecasting in metaheuristic methods to solve dynamic routing problems: Evidence from the logistic processes of tuna vessels
Abstract The multiple Traveling Salesman Problem (mTSP) is a widespread phenomenon in
real-life scenarios, and in fact it has been addressed from multiple perspectives in recent …
real-life scenarios, and in fact it has been addressed from multiple perspectives in recent …
[HTML][HTML] Evolutionary computation in China: A literature survey
Evolutionary computation (EC) has received significant attention in China during the last two
decades. In this paper, we present an overview of the current state of this rapidly growing …
decades. In this paper, we present an overview of the current state of this rapidly growing …
[PDF][PDF] Tracking moving targets and the non-stationary traveling salesman problem
Ab stract The Traveling Salesman Problem (TSP) has been studied extensively in the
literature with the assumption that all cities to be visited are stationary. In this paper, we …
literature with the assumption that all cities to be visited are stationary. In this paper, we …