Exploiting Tabu Search Memory in Constrained Problems

DOI10.1287/ijoc.1030.0040zbMath1239.90111OpenAlexW2143194445MaRDI 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 searchconstraint optimizationfacility layoutreliability optimization orienteering

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Layout optimization considering production uncertainty and routing flexibility ⋮ MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components ⋮ Multi-objective tabu search using a multinomial probability mass function

This page was built for publication: Exploiting Tabu Search Memory in Constrained Problems