Solving the vehicle routing problem with adaptive memory programming methodology
From MaRDI portal
Recommendations
- Adaptive memory programming for the vehicle routing problem with multiple trips
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Adaptive memory programming: a unified view of metaheuristics
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2013520 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A framework for the description of evolutionary algorithms
- A genetic algorithm for the vehicle routing problem
- A guide to vehicle routing heuristics
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A subpath ejection method for the vehicle routing problem
- A tabu search algorithm for the vehicle routing problem
- Adaptive memory programming: a unified view of metaheuristics
- An improved ant system algorithm for the vehicle routing problem
- Ant colonies for the quadratic assignment problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- Computer Solutions of the Traveling Salesman Problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Handbook of applied optimization
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- The granular tabu search and its application to the vehicle-routing problem
- The savings algorithm for the vehicle routing problem
- The vehicle routing problem
- Using experimental design to find effective parameter settings for heuristics
Cited in
(24)- An iterated tabu search for the multi-compartment vehicle routing problem
- An adaptive memory programming method for risk logistics operations
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A hybrid evolution strategy for the open vehicle routing problem
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- Path relinking for the vehicle routing problem
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
- 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
- An adaptive memory matheuristic for the set orienteering problem
This page was built for publication: Solving the vehicle routing problem with adaptive memory programming methodology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772865)
