Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem

DOI10.1007/s10878-011-9400-8zbMath1261.90042OpenAlexW2014174265MaRDI QIDQ1928502

Olivier Kuhn, Abderrafiaa Koukam, Jean-Charles Créput, Amir Hajjam

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9400-8

zbMATH Keywords

neural networkevolutionary algorithmmemetic algorithmself-organizing mapelastic netdynamic vehicle routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Best routes selection in multimodal networks using multi-objective genetic algorithm ⋮ An integrated model for medical expense system optimization during diagnosis process based on artificial intelligence algorithm

Uses Software

• TSPLIB
• LKH
• VRP
• MACS-VRPTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Ant colony system for a dynamic vehicle routing problem
• Recent Developments in Dynamic Vehicle Routing Systems
• Optimal Expected-Time Algorithms for Closest Point Problems
• TSPLIB—A Traveling Salesman Problem Library
• Parallel iterative search methods for vehicle routing problems
• A Gentle Introduction to Memetic Algorithms
• A unified tabu search heuristic for vehicle routing problems with time windows
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Self-organizing maps.