Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
From MaRDI portal
Publication:2253408
DOI10.1016/j.ejor.2012.07.037zbMath1292.90170OpenAlexW2150085518MaRDI QIDQ2253408
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://web.iima.ac.in/assets/snippets/workingpaperpdf/7520037992012-01-03.pdf
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (16)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Tabu search for the cyclic bandwidth problem ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
This page was built for publication: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
