A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window
From MaRDI portal
Publication:742692
DOI10.3390/e15041247zbMath1297.90018OpenAlexW2033843955MaRDI QIDQ742692
Chao Peng, Huanle Liang, Wenbin Hu, Qi Hu, Bo Du
Publication date: 19 September 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e15041247
Related Items
A comprehensive survey on particle swarm optimization algorithm and its applications ⋮ Multi-fleet feeder vehicle routing problem using hybrid metaheuristic ⋮ A chaos-based evolutionary algorithm for general nonlinear programming problems
Uses Software
Cites Work
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Vehicle routing considerations in distribution system design
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Tabu search heuristics for the vehicle routing problem with time windows.
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Unnamed Item
