Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

DOI10.1631/jzus.2006.A0607zbMath1166.90319OpenAlexW2080427200MaRDI QIDQ2508207

Ailing Chen, Gen-Ke Yang, Zhi-Ming Wu

Publication date: 9 October 2006

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1631/jzus.2006.a0607

zbMATH Keywords

simulated annealing (SA)capacitated routing problemdiscrete particle swarm optimization (DPSO)

Mathematics Subject Classification ID

Integer programming (90C10) Traffic problems in operations research (90B20)

Related Items (14)

A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems ⋮ A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications ⋮ A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery ⋮ Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window ⋮ An algorithm for the capacitated vehicle routing problem with route balancing ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• A genetic algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Job Shop Scheduling by Simulated Annealing
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Local Search Algorithms for the Maximal Planar Layout Problem

This page was built for publication: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem