Solving the vehicle routing problem with adaptive memory programming methodology
type: Item
instance of: scholarly article
title: Solving the vehicle routing problem with adaptive memory programming methodology
zbMATH Open document ID: 1116.90119
author: Christos D. Tarantilis
published in: Computers \& Operations Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2160313
zbMATH Keywords: Metaheuristics
zbMATH Keywords: Service operations management
zbMATH Keywords: Vehicle routing
describes a project that uses: VRP
describes a project that uses: Tabu search
describes a project that uses: Scatter Search
describes a project that uses: HAS-QAP
describes a project that uses: BoneRoute
MaRDI profile type: Publication
full work available at URL: j.cor.2004.03.005
OpenAlex ID: W2016283119
cites work: The vehicle routing problem
cites work: Q4955264
cites work: Q4532228
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: A framework for the description of evolutionary algorithms
cites work: Q4452897
cites work: Ant colonies for the quadratic assignment problem
cites work: Handbook of applied optimization
cites work: Adaptive memory programming: a unified view of metaheuristics
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: Q3048611
cites work: Q4955265
cites work: The savings algorithm for the vehicle routing problem
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Q4354785
cites work: A guide to vehicle routing heuristics
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: A subpath ejection method for the vehicle routing problem
cites work: A tabu search algorithm for the vehicle routing problem
cites work: A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
cites work: A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
cites work: An improved ant system algorithm for the vehicle routing problem
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: A genetic algorithm for the vehicle routing problem
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: Q4436879
cites work: Using experimental design to find effective parameter settings for heuristics
DOI: 10.1016/J.COR.2004.03.005
description: scientific article; zbMATH DE number 2160313