Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
From MaRDI portal
Publication:2331412
DOI10.3390/a11030031zbMath1461.90172OpenAlexW2794440649MaRDI QIDQ2331412
Ji Ung Sun, A. K. M. Foysal Ahmed
Publication date: 29 October 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11030031
particle swarm optimizationcapacitated vehicle routing problembilayer local search techniquenovel decoding approach
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Route optimization cold chain logistic distribution using greedy search method, A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- The capacitated vehicle routing problem with stochastic demands and time windows
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- The savings algorithm for the vehicle routing problem
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A genetic algorithm for the vehicle routing problem
- A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems
- An improved ant colony optimization for vehicle routing problem
- A review of particle swarm optimization. I: Background and development
- Expanding neighborhood GRASP for the traveling salesman problem
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- The Truck Dispatching Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Tabu Search—Part I
- Tabu Search—Part II
- Scatter Search and Path Relinking: Advances and Applications
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
