Exploiting Tabu Search Memory in Constrained Problems

DOI10.1287/ijoc.1030.0040zbMath1239.90111MaRDI QIDQ2890423

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

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

tabu search; constraint optimization; facility layout; reliability optimization orienteering

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Layout optimization considering production uncertainty and routing flexibility, Orienteering problem: a survey of recent variants, solution approaches and applications, Scheduled penalty variable neighborhood 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, 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, MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components