Large-scale controlled rounding using tabu search with strategic oscillation
From MaRDI portal
Publication:2366995
DOI10.1007/BF02022563zbMath0775.90291OpenAlexW2007754299MaRDI QIDQ2366995
Arjang A. Assad, Bruce L. Golden, James P. Kelly
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02022563
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A user's guide to tabu search, Dynamic tabu list management using the reverse elimination method, Genetic algorithms and tabu search: Hybrids for optimization, Solving transportation problems with nonlinear side constraints with tabu search, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Dynamic tabu search strategies for the traveling purchaser problem, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Heuristic methods for evolutionary computation techniques, Tabu search for the multilevel generalized assignment problem, Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times, The case for strategic oscillation, Heuristic algorithms for the maximum diversity problem, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, The controlled rounding problem: Complexity and computational experience, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data, Design and implementation of a course scheduling system using Tabu Search, Global optimization for artificial neural networks: A tabu search application
Cites Work
