Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique
From MaRDI portal
Publication:6160384
DOI10.3138/infor.51.1.41OpenAlexW1977973577MaRDI QIDQ6160384
Jaouad Boukachour, Ahmed El Hilali Alaoui, Unnamed Author
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3138/infor.51.1.41
Cites Work
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Local search with annealing-like restarts to solve the VRPTW
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Record breaking optimization results using the ruin and recreate principle
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A unified tabu search heuristic for vehicle routing problems with time windows
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- Using constraint-based operators to solve the vehicle routing problem with time windows
This page was built for publication: Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique