Metaheuristics in combinatorial optimization
type: Item
instance of: scholarly article
title: Metaheuristics in combinatorial optimization
zbMATH Open document ID: 1091.90067
author: Michel Gendreau
author: Jean-Yves Potvin
published in: Annals of Operations Research
publication date: 2006-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5009784
zbMATH Keywords: metaheuristics
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: vehicle routing
zbMATH Keywords: unifying framework
describes a project that uses: Genocop
describes a project that uses: Tabu search
describes a project that uses: GRASP
describes a project that uses: MACS-VRPTW
describes a project that uses: HAS-QAP
describes a project that uses: VRP
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: s10479-005-3971-7
OpenAlex ID: W2039568841
cites work: Q4365129
cites work: Q4339078
cites work: Selected topics in simulated annealing
cites work: Q4398368
cites work: A survey of very large-scale neighborhood search techniques
cites work: Q4004079
cites work: The Reactive Tabu Search
cites work: Q4827942
cites work: Tabu search heuristics for the vehicle routing problem with time windows.
cites work: Q4495191
cites work: An improved ant system algorithm for the vehicle routing problem
cites work: Q2770503
cites work: Q4523517
cites work: A grasp interactive approach to the vehicle routing problem with backhauls
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: A guide to vehicle routing heuristics
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Q5692628
cites work: A heuristic for the vehicle routing problem with time windows
cites work: Q4495194
cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design
cites work: A tabu search procedure for multicommodity location/allocation with balancing requirements
cites work: Parallel Strategies for Meta-Heuristics
cites work: Toward a Taxonomy of Parallel Tabu Search Heuristics
cites work: Strategies for the parallel implementation of metaheuristics
cites work: Q4532231
cites work: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: GRASP: An annoted bibliography
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: Ant colonies for the quadratic assignment problem
cites work: An Introduction to Tabu Search
cites work: Recent advances in tabu search
cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
cites work: Q4365134
cites work: Q4532228
cites work: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: Q4352217
cites work: Handbook of metaheuristics
cites work: Q4354785
cites work: Fundamentals of scatter search and path relinking
cites work: Q4692508
cites work: Q4495203
cites work: Variable Neighborhood Search
cites work: Variable neighborhood search: Principles and applications

Metaheuristics in combinatorial optimization (cites work)
cites work: Developments of variable neighborhood search

Metaheuristics in combinatorial optimization (cites work)
cites work: Variable neighborhood decomposition search

Metaheuristics in combinatorial optimization (cites work)
cites work: Semi-greedy heuristics: An empirical study

Metaheuristics in combinatorial optimization (cites work)
cites work: The Theory and Practice of Simulated Annealing

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4079017

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4365133

Metaheuristics in combinatorial optimization (cites work)
cites work: Optimization by Simulated Annealing

Metaheuristics in combinatorial optimization (cites work)
cites work: A GRASP for the Vehicle Routing Problem with Time Windows

Metaheuristics in combinatorial optimization (cites work)
cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

Metaheuristics in combinatorial optimization (cites work)
cites work: Metaheuristics: A bibliography

Metaheuristics in combinatorial optimization (cites work)
cites work: Genetic Algorithms for Vehicle Dispatching

Metaheuristics in combinatorial optimization (cites work)
cites work: GENI ants for the traveling salesman problem

Metaheuristics in combinatorial optimization (cites work)
cites work: Solving zero-one mixed integer programming problems using tabu search

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4495177

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4452900

Metaheuristics in combinatorial optimization (cites work)
cites work: Ant colony optimization: An overview

Metaheuristics in combinatorial optimization (cites work)
cites work: A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4873721

Metaheuristics in combinatorial optimization (cites work)
cites work: Multi colony ant algorithms

Metaheuristics in combinatorial optimization (cites work)
cites work: Variable neighborhood search

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4365131

Metaheuristics in combinatorial optimization (cites work)
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Metaheuristics in combinatorial optimization (cites work)
cites work: Genetic algorithms for the traveling salesman problem

Metaheuristics in combinatorial optimization (cites work)
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

Metaheuristics in combinatorial optimization (cites work)
cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4350082

Metaheuristics in combinatorial optimization (cites work)
cites work: Genetic Algorithms

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4495496

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4452897

Metaheuristics in combinatorial optimization (cites work)
cites work: Essays and surveys in metaheuristics. Selected papers of the Third Metaheuristics International Conference held in Angra dos Reis, Brazil, July 1999

Metaheuristics in combinatorial optimization (cites work)
cites work: Probabilistic diversification and intensification in local search for vehicle routing

Metaheuristics in combinatorial optimization (cites work)
cites work: Using constraint-based operators to solve the vehicle routing problem with time windows

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4934634

Metaheuristics in combinatorial optimization (cites work)
cites work: A tabu search heuristic procedure for the fixed charge transportation problem

Metaheuristics in combinatorial optimization (cites work)
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

Metaheuristics in combinatorial optimization (cites work)
cites work: Adaptive memory programming: a unified view of metaheuristics

Metaheuristics in combinatorial optimization (cites work)
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem

Metaheuristics in combinatorial optimization (cites work)
cites work: The granular tabu search and its application to the vehicle-routing problem

Metaheuristics in combinatorial optimization (cites work)
cites work: Parallel local search

Metaheuristics in combinatorial optimization (cites work)
cites work: Q4704239

Metaheuristics in combinatorial optimization (Wikidata QID)
Wikidata QID: Q115201933

Metaheuristics in combinatorial optimization (DOI)
DOI: 10.1007/S10479-005-3971-7