A Neural-Network-Based Approach to the Double Traveling Salesman Problem
From MaRDI portal
Publication:2780866
DOI10.1162/08997660252741194zbMath1136.90460OpenAlexW2101144650WikidataQ52047957 ScholiaQ52047957MaRDI QIDQ2780866
Angelo Marcello Anile, Alessio Plebe
Publication date: 14 April 2002
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/08997660252741194
Related Items (1)
Uses Software
Cites Work
- A modified Lin--Kernighan traveling-salesman heuristic
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- Self-organizing maps: Ordering, convergence properties and energy functions
- The vehicle routing problem: An overview of exact and approximate algorithms
- The Guilty net for the traveling salesman problem
- Easing the conscience of the guilty net
- Neural methods for the traveling salesman problem: Insights from operations research
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Heuristics for the multi-vehicle covering tour problem
- A hierarchical strategy for solving traveling salesman problems using elastic nets
- ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- TSPLIB—A Traveling Salesman Problem Library
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- On the Significance of the Initial Solution in Travelling Salesman Heuristics
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A Neural-Network-Based Approach to the Double Traveling Salesman Problem
