Active-guided evolution strategies for large-scale capacitated vehicle routing problems
From MaRDI portal
Publication:878570
DOI10.1016/j.cor.2005.11.006zbMath1185.90176OpenAlexW1995235889WikidataQ110038531 ScholiaQ110038531MaRDI QIDQ878570
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.006
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (31)
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism ⋮ The close-open mixed vehicle routing problem ⋮ The min-cost parallel drone scheduling vehicle routing problem ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems ⋮ A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling ⋮ Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ Efficiently solving very large-scale routing problems ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ A cooperative parallel metaheuristic for the capacitated vehicle routing problem ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results ⋮ A library of local search heuristics for the vehicle routing problem ⋮ An adaptive VNS algorithm for vehicle routing problems with intermediate stops ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ Memory and Learning in Metaheuristics ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- A general heuristic for vehicle routing problems
- Fast local search and guided local search and their application to British Telecom's workforce scheduling 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
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Fast and high precision algorithms for optimization in large-scale genomic problems
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A guide to vehicle routing heuristics
- An Exchange Heuristic for Routeing Problems with Time Windows
- The Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
