Genetic algorithm for combinatorial path planning: the subtour problem
From MaRDI portal
Publication:541476
DOI10.1155/2011/483643zbMath1213.90253OpenAlexW2063677508WikidataQ58693119 ScholiaQ58693119MaRDI QIDQ541476
Giovanni Giardini, Tamás Kalmár-Nagy
Publication date: 7 June 2011
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232143
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Optimal placement of passive energy dissipation devices by genetic algorithms ⋮ The multiagent planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The selective travelling salesman problem
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Remote Agent: to boldly go where no AI system has gone before
- The merchant subtour problem
- On the capacitated vehicle routing problem
- Method to solve the travelling salesman problem using the inverse of diffusion process
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
- The traveling salesman problem and its variations
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- A stabilized column generation scheme for the traveling salesman subtour problem
- TSPLIB—A Traveling Salesman Problem Library
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
- GVR: A New Genetic Representation for the Vehicle Routing Problem
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Planning Algorithms
This page was built for publication: Genetic algorithm for combinatorial path planning: the subtour problem
