Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
From MaRDI portal
Publication:3057120
DOI10.1002/net.20333zbMath1206.90025OpenAlexW4230566462WikidataQ110085173 ScholiaQ110085173MaRDI QIDQ3057120
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20333
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
A hybrid algorithm for a class of vehicle routing problems ⋮ Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem ⋮ A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A hybrid genetic algorithm for the Hamiltonian p‐median problem ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ A library of local search heuristics for the vehicle routing problem ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ An iterated local search algorithm for the vehicle routing problem with backhauls ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ A memetic algorithm for the multiperiod vehicle routing problem with profit ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
- A memetic algorithm for a vehicle routing problem with backhauls
- A general heuristic for vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- 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
- Evolutionary algorithms for periodic arc routing problems
- Solving the vehicle routing problem with adaptive memory programming methodology
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- The Truck Dispatching Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
This page was built for publication: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem