Local search with annealing-like restarts to solve the VRPTW
type: Item
instance of: scholarly article
title: Local search with annealing-like restarts to solve the VRPTW
zbMATH Open document ID: 1023.90090
DOI: 10.1016/S0377-2217(02)00486-1
author: Haibing Li
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 1963893
zbMATH Keywords: routing
zbMATH Keywords: vehicle routing problem with time windows
zbMATH Keywords: local search
zbMATH Keywords: diversification
zbMATH Keywords: intensification
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Solving vehicle routing problems using constraint programming and metaheuristics
cites work: Simulated annealing metaheuristics for the vehicle routing problem with time windows
cites work: A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
cites work: Q4532229
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Q3783827
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Q5687193
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: Vehicle Routing with Time Windows: Two Optimization Algorithms
cites work: Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
cites work: Vehicle Routing with Time Windows
cites work: The Vehicle Routing Problem with Time Windows Part II: Genetic Search
cites work: The Vehicle Routing Problem with Time Windows Part I: Tabu Search
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Using constraint-based operators to solve the vehicle routing problem with time windows
cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Recommended article: Q5052999
Recommended article: Q3441216
Recommended article: Visiting near-optimal solutions using local search algorithms
Recommended article: Restarting search algorithms with applications to simulated annealing
Recommended article: An iterated local search for solving a location-routing problem
Recommended article: Computational Science and Its Applications – ICCSA 2004
Recommended article: Q4660716
description: scientific article; zbMATH DE number 1963893