Metaheuristics in combinatorial optimization
From MaRDI portal
Publication:817206
DOI10.1007/s10479-005-3971-7zbMath1091.90067OpenAlexW2039568841WikidataQ115201933 ScholiaQ115201933MaRDI QIDQ817206
Michel Gendreau, Jean-Yves Potvin
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3971-7
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA, Classification of applied methods of combinatorial optimization, Optimization of the multi-hole drilling path sequence for concentric circular patterns, Solving integrated process planning and scheduling problem with constructive meta-heuristics, Metaheuristics for bilevel optimization: a comprehensive review, Research trends in combinatorial optimization, Local Search Based on Genetic Algorithms, A review of multiobjective programming and its application in quantitative psychology, An analysis of selection methods in memory consideration for harmony search, Combined land-use and water allocation planning, A discrete gravitational search algorithm for solving combinatorial optimization problems, A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, Pseudo-feasible solutions in evolutionary bilevel optimization: test problems and performance assessment, Skilled workforce scheduling in service centres, Meta-heuristics for Grid Scheduling Problems, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, A hybrid evolution strategy for the open vehicle routing problem, A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of very large-scale neighborhood search techniques
- GENI ants for the traveling salesman problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A probabilistic heuristic for a computationally difficult set covering problem
- Variable neighborhood search
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- A tabu search heuristic procedure for the fixed charge transportation problem
- Solving zero-one mixed integer programming problems using tabu search
- Greedy randomized adaptive search procedures
- An improved ant system algorithm for the vehicle routing problem
- Semi-greedy heuristics: An empirical study
- Future paths for integer programming and links to artificial intelligence
- Variable neighborhood decomposition search
- Multi colony ant algorithms
- Tabu search heuristics for the vehicle routing problem with time windows.
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Genetic algorithms for the traveling salesman problem
- Metaheuristics: A bibliography
- Parallel local search
- Probabilistic diversification and intensification in local search for vehicle routing
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Ant colonies for the quadratic assignment problem
- Genetic Algorithms for Vehicle Dispatching
- Tabu Search—Part I
- Tabu Search—Part II
- The Reactive Tabu Search
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- An Introduction to Tabu Search
- Genetic Algorithms
- Variable Neighborhood Search
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- The Theory and Practice of Simulated Annealing
- Parallel Strategies for Meta-Heuristics
- A guide to vehicle routing heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Handbook of metaheuristics
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- A heuristic for the vehicle routing problem with time windows
- Variable neighborhood search: Principles and applications
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Essays and surveys in metaheuristics. Selected papers of the Third Metaheuristics International Conference held in Angra dos Reis, Brazil, July 1999
- Adaptive memory programming: a unified view of metaheuristics
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- Using constraint-based operators to solve the vehicle routing problem with time windows
