Exploiting tabu search memory in constrained problems

DOI10.1287/IJOC.1030.0040MaRDI QIDQ2890423zbMATH OpenOpenAlexFDO

Authors Sadan Kulturel-Konak, Bryan A. Norman, David W. Coit, Alice E. Smith

Publication date 8 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/16738fecfd0aa1575f9e13c8efef303e2fedae76

zbMATH Keywords

constraint optimizationfacility layoutreliability optimization orienteeringtabu search

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1054674
• A user's guide to tabu search
• Tabu Search—Part I
• Tabu Search—Part II
• scientific article; zbMATH DE number 894759

Cited in

(11)

• A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
• Multi-objective tabu search using a multinomial probability mass function
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Scheduled penalty variable neighborhood search
• MILP models for complex system reliability redundancy allocation with mixed components
• Layout optimization considering production uncertainty and routing flexibility
• scientific article; zbMATH DE number 953074 (Why is no real title available?)
• Exponential extrapolation memory for tabu search
• A new mixed integer programming formulation for facility layout design using flexible bays
• Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
• Tabu search-based metaheuristic algorithm for software system reliability problems

This page was built for publication: Exploiting tabu search memory in constrained problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890423)