Transport clustering and routing as a visual meshing process

DOI10.1080/02522667.2007.10699761zbMath1134.90008OpenAlexW2015352825MaRDI QIDQ5455292

Jean-Charles Créput, Abder Koukam

Publication date: 3 April 2008

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2007.10699761

zbMATH Keywords

neural networksvehicle routing problemevolutionary algorithmsself-organizing mapseuclidean \(k\)-medianlustering and routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Self-organization and associative memory
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Combined location-routing problems: A synthesis and future research directions
• A new adaptive multi-start technique for combinatorial global optimizations
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Locating median cycles in networks
• Probabilistic diversification and intensification in local search for vehicle routing
• Optimal Expected-Time Algorithms for Closest Point Problems
• Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
• A unified tabu search heuristic for vehicle routing problems with time windows

This page was built for publication: Transport clustering and routing as a visual meshing process