A multi-start local search algorithm for the vehicle routing problem with time windows
type: Item
instance of: scholarly article
title: A multi-start local search algorithm for the vehicle routing problem with time windows
zbMATH Open document ID: 1065.90013
DOI: 10.1016/S0377-2217(03)00435-1
author: Olli Bräysy
author: Geir Hasle
author: Wout Dullaert
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2117549
zbMATH Keywords: Routing
zbMATH Keywords: Time windows
zbMATH Keywords: Metaheuristics
Wikidata QID: Q110035112
describes a project that uses: MACS-VRPTW
MaRDI profile type: Publication
cites work: Q4365129
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
cites work: Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
cites work: Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
cites work: A threshold accepting metaheuristic for the vehicle routing problem with time windows.
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: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: A heuristic for the vehicle routing problem with time windows
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: Q4877300
cites work: Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
cites work: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
cites work: A greedy look-ahead heuristic for the vehicle routing problem with time windows
cites work: Optimization by Simulated Annealing
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: Local search with annealing-like restarts to solve the VRPTW
cites work: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
cites work: Equation of State Calculations by Fast Computing Machines
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 subpath ejection method for the vehicle routing problem
cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
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: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Q3783826
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Algorithms for the Vehicle Routing Problems with Time Deadlines
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
full work available at URL: s0377-2217(03)00435-1
OpenAlex ID: W2065031863
description: scientific article; zbMATH DE number 2117549