Probabilistic diversification and intensification in local search for vehicle routing
type: Item
instance of: scholarly article
title: Probabilistic diversification and intensification in local search for vehicle routing
zbMATH Open document ID: 0857.90032
DOI: 10.1007/BF02430370
author: Yves Rochat
author: Éric D. Taillard
published in: Journal of Heuristics
publication date: 1996-09-01T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 922551
zbMATH Keywords: parallel algorithms
zbMATH Keywords: probabilistic technique
zbMATH Keywords: local search
zbMATH Keywords: vehicle routing
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Q3048611
cites work: Q3992822
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: Tabu Search—Part II
cites work: A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
cites work: Solving real-life vehicle routing problems efficiently using tabu search
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
description: scientific article; zbMATH DE number 922551