Optimised crossover genetic algorithm for capacitated vehicle routing problem

DOI10.1016/j.apm.2011.08.010zbMath1243.90026OpenAlexW2006487034MaRDI QIDQ438026

Lai Soon Lee, Habibeh Nazif

Publication date: 20 July 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.08.010

zbMATH Keywords

networkheuristicsgenetic algorithmvehicle routing problemcombinatorial optimisation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

An effective krill herd algorithm with migration operator in biogeography-based optimization ⋮ Robust optimisation approach for vehicle routing problems with uncertainty ⋮ Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers ⋮ Two-phase algorithm for solving vehicle routing problem with time windows ⋮ Uniform parallel machine scheduling with resource consumption constraint ⋮ Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ Properties of graph distance measures by means of discrete inequalities ⋮ Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem

Uses Software

• VRP
• MACS-VRPTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• A tabu search algorithm for the vehicle routing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Solving the vehicle routing problem with adaptive memory programming methodology
• An improved ant system algorithm for the vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Parallel iterative search methods for vehicle routing problems
• Optimized Crossover for the Independent Set Problem
• A guide to vehicle routing heuristics
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• Evolutionary Computation in Combinatorial Optimization