Transport clustering and routing as a visual meshing process
From MaRDI portal
Publication:5455292
DOI10.1080/02522667.2007.10699761zbMATH Open1134.90008OpenAlexW2015352825MaRDI QIDQ5455292FDOQ5455292
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
Recommendations
- Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Visual attractiveness in vehicle routing via bi-objective optimization
- scientific article; zbMATH DE number 1054961
- Self-organizing feature maps for the vehicle routing problem with backhauls
neural networksevolutionary algorithmsself-organizing mapsvehicle routing problemeuclidean \(k\)-medianlustering and routing
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 unified tabu search heuristic for vehicle routing problems with time windows
- Optimal Expected-Time Algorithms for Closest Point Problems
- A new adaptive multi-start technique for combinatorial global optimizations
- Probabilistic diversification and intensification in local search for vehicle routing
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Locating median cycles in networks
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Cited In (1)
This page was built for publication: Transport clustering and routing as a visual meshing process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5455292)
