A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems

DOI10.1155/2012/726564zbMath1264.90018WikidataQ58911640 ScholiaQ58911640MaRDI QIDQ1955120

Yi-Ting Huang, Ming-Hsien Chen, Yucheng Kao

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/726564

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Honey bees mating optimization algorithm for large scale vehicle routing problems
• The vehicle routing problem: An overview of exact and approximate algorithms
• A tabu search algorithm for the vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• An improved ant colony optimization for vehicle routing problem
• A new optimization algorithm based on chaos
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem