Simulated annealing and tabu search approaches for the Corridor Allocation Problem

DOI10.1016/j.ejor.2013.07.010zbMath1305.90246OpenAlexW2074767604MaRDI QIDQ2255905

Yanyan Li

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.010

zbMATH Keywords

combinatorial optimizationsimulated annealingtabu searchfacilities planning and design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (12)

Fast simulated annealing for single-row equidistant facility layout ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm ⋮ Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays ⋮ An efficient variable neighborhood search for the space-free multi-row facility layout problem ⋮ A decomposition-based algorithm for the double row layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes ⋮ Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search ⋮ New exact approaches to row layout problems ⋮ Pharmacy duty scheduling problem ⋮ Exact approaches for the combined cell layout problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Insertion based Lin-Kernighan heuristic for single row facility layout
• The corridor allocation problem
• A computational study and survey of methods for the single-row facility layout problem
• Single row facility layout problem using a permutation-based genetic algorithm
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• A new lower bound for the single row facility layout problem
• Optimal solutions for the double row layout problem
• The single row facility layout problem: state of the art
• On the exact solution of a facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Global Approaches for Facility Layout and VLSI Floorplanning
• Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
• The double row layout problem
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Provably near-optimal solutions for very large single-row facility layout problems
• One-Dimensional Space Allocation: An Ordering Algorithm

This page was built for publication: Simulated annealing and tabu search approaches for the Corridor Allocation Problem