Defining tabu list size and aspiration criterion within tabu search methods
From MaRDI portal
Publication:5955472
DOI10.1016/S0305-0548(00)00062-9zbMath1020.90027OpenAlexW1970995225MaRDI QIDQ5955472
No author found.
Publication date: 18 March 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00062-9
Related Items (19)
A neuro-tabu search heuristic for the flow shop scheduling problem ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ An evolution-based tabu search approach to codebook design ⋮ Parallel machine selection and job scheduling to minimize machine cost and job tardiness ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection) ⋮ Locating service facilities whose reliability is distance dependent. ⋮ Using penalty function and tabu search to solve cell formation problems with fixed cell cost. ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ A novel technique of object ranking and classification under ignorance: an application to the corporate failure risk problem ⋮ Hyper-heuristic approaches for the response time variability problem ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Parallel flowshop scheduling using Tabu search ⋮ Solving the multiple competitive facilities location problem ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tabu search approach for the resource constrained project scheduling problem
- An efficient tabu search procedure for the \(p\)-median problem
- Heuristic concentration: Two stage solution construction
- Lagrangean heuristics for location problems
- Future paths for integer programming and links to artificial intelligence
- Dynamic tabu search strategies for the traveling purchaser problem
- Metaheuristics: A bibliography
- A user's guide to tabu search
- Dynamic tabu list management using the reverse elimination method
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Tabu Search—Part I
- Subdrop: A modified drop heuristic for location problems
- The Reactive Tabu Search
- A perturbation heuristic for a class of location problems
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
This page was built for publication: Defining tabu list size and aspiration criterion within tabu search methods