Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows
From MaRDI portal
Publication:2997961
DOI10.1080/02522667.2008.10699816zbMath1211.90030OpenAlexW2318435393MaRDI QIDQ2997961
Abderrafiaa Koukam, Amir Hajjam, Jean-Charles Créput
Publication date: 10 May 2011
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: http://www.connectjournals.com/file_html_pdf/56303H_jios248_485-511_abs.htm
traveling salesman problemevolutionary algorithmself-organizing mapvehicle routing problem with time-windows
Cites Work
- Self-organization and associative memory
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- The Guilty net for the traveling salesman problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A new adaptive multi-start technique for combinatorial global optimizations
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Optimal Expected-Time Algorithms for Closest Point Problems
- TSPLIB—A Traveling Salesman Problem Library
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
