Solving the vehicle routing problem with adaptive memory programming methodology
From MaRDI portal
Publication:1772865
DOI10.1016/j.cor.2004.03.005zbMath1116.90119OpenAlexW2016283119MaRDI QIDQ1772865
Publication date: 21 April 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.005
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (23)
A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ Adaptive memory programming for the vehicle routing problem with multiple trips ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Path relinking for the vehicle routing problem ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ An adaptive memory programming method for risk logistics operations ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ A hybrid evolution strategy for the open vehicle routing problem ⋮ An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The savings algorithm for the vehicle routing problem
- A tabu search algorithm for the vehicle routing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A framework for the description of evolutionary algorithms
- An improved ant system algorithm for the vehicle routing problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- 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
- The Vehicle Routing Problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Ant colonies for the quadratic assignment problem
- Parallel iterative search methods for vehicle routing problems
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- Using experimental design to find effective parameter settings for heuristics
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Adaptive memory programming: a unified view of metaheuristics
This page was built for publication: Solving the vehicle routing problem with adaptive memory programming methodology
