Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
From MaRDI portal
Recommendations
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A memetic algorithm for the multi trip vehicle routing problem
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- A memetic algorithm for a vehicle routing problem with backhauls
- A memetic algorithm for the multiperiod vehicle routing problem with profit
Cites work
- A general heuristic for vehicle routing problems
- A guide to vehicle routing heuristics
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A memetic algorithm for a vehicle routing problem with backhauls
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An Exchange Heuristic for Routeing Problems with Time Windows
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Evolutionary algorithms for periodic arc routing problems
- scientific article; zbMATH DE number 2230221 (Why is no real title available?)
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- Solving the vehicle routing problem with adaptive memory programming methodology
- The granular tabu search and its application to the vehicle-routing problem
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(26)- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- 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
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
- Knowledge-guided local search for the vehicle routing problem
- New benchmark instances for the capacitated vehicle routing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- 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
- 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 hybrid algorithm for a class of vehicle routing problems
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- Technical note: Split algorithm in O(n) for 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
- A feasibility-preserved quantum approximate Solver for the capacitated vehicle routing problem
- Implementing a multi-user framework for vehicle routing problems: a chronicle
- Solving soft and hard-clustered vehicle routing problems: a bi-population collaborative memetic search approach
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- A library of local search heuristics for the vehicle routing problem
This page was built for publication: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057120)
