A branch-and-bound algorithm for the single-row equidistant facility layout problem

Keywords

Branch and bound, Tabu search, Bounding overwatch, Equidistant, Algorithm

References

• Recent advances in the solution of quadratic assignment problemsKurt M. Anstreicher — 2003
• The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problemGintaras Palubeckis — 1997
• Selected Topics in Graph Theory 2Lowell W. Beineke, Robin Wilson — 1985
• Optional linear arrangement of circuit componentsJayaram Bhaskar, Sartaj Sahni — 1987
• Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization ProblemGintaras Palubeckis — 2006
• An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsChristopher E. Nugent, Thomas E. Vollmann, John Ruml — 1968
• Iterated tabu search for the maximum diversity problemGintaras Palubeckis — 2007
• Robust taboo search for the quadratic assignment problemÉric D. Taillard — 1991
• A generator of test quadratic assignment problems with known optimal solutionG.S. Palubetskis — 1990
• On the One-Dimensional Space Allocation ProblemJean‐Claude Picard, Maurice Queyranne — 1981
• The Reactive Tabu SearchRoberto Battiti, Giampietro Tecchiolli — 1994
• An Exact Algorithm for the Quadratic Assignment Problem on a TreeNicos Christofides, Enrique Benavent — 1989
• Exact solution procedures for the balanced unidirectional cyclic layout problemTemel Öncan, İ. Kuban Altınel — 2008
• Tabu Search Applied to the Quadratic Assignment ProblemJadranka Skorin‐Kapov — 1990
• COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM.Éric D. Taillard — 1995
• One-dimensional machine location problems in a multi-product flowline with equidistant locationsBhaba R. Sarker, Wilbert E. Wilhelm, Gary L. Hogg — 1998
• Optimal algorithms for row layout problems in automated manufacturing systemsPANAGIOTIS KOUVELIS, Wen‐Chyuan Chiang, Gang Yu — 1995
• Directional decomposition heuristic for a linear machine-cell location problemJunfang Yu, Bhaba R. Sarker — 2003
• Finite-State Processes and Dynamic ProgrammingRichard M. Karp, Michael Held — 1967
• Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemPaul C. Gilmore — 1962

Cited by

• Fast simulated annealing for single-row equidistant facility layoutGintaras Palubeckis — 2015
• Single-row equidistant facility layout as a special case of single-row facility layoutPhilipp Hungerländer — 2014
• The deterministic product location problem under a pick-by-order policyNils Boysen, Konrad Stephan — 2013
• Single row layout modelsBirgit Keller, Udo Buscher — 2015
• Fast local search for single row facility layoutGintaras Palubeckis — 2015
• Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directionsMiguel F. Anjos, Manuel V.C. Vieira — 2017
• A Mixed Integer Linear Programming approach for a new form of facility layout problemYipei Zhang, Ada Che — 2014
• Single row facility layout using multi-start simulated annealingGintaras Palubeckis — 2017
• Classification of facility layout problems: a review studyHasan Hosseini Nasab, Sepideh Fereidouni, S.M.T. Fatemi Ghomi — 2018
• Construction heuristics for the single row layout problem with machine-spanning clearancesBirgit Keller — 2019
• Branch and Bound for Facility Layout Problem Using Minimum Weighted Clique Problem in Complete K-partite GraphSoumaya Lakehal, Abdelhakim AitZai — 2017
• Heuristics and Metaheuristics Approaches for Facility Layout Problems: A SurveyNurul Nadia Nordin, Lai Soon Lee — 2016
• A Bi-Level Passenger Preference-Oriented Line Planning Model for High-Speed Railway OperationsYuxiang Yang, Jie Li, Chao Wen — 2018
• A Tabu Search Approach for Designing Shopping CentersSherif A. Fahmy, Bader A. Alablani, Tamer F. Abdelmaguid — 2017
• A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* searchMariem Besbes, Marc Zolghadri, Roberta Costa Affonso — 2019
• New exact approaches to row layout problemsAnja Fischer, Frank Fischer, Philipp Hungerländer — 2019
• Population-based improvement heuristic with local search for single-row facility layout problemSoumen Atta, Priya Ranjan Sinha Mahapatra — 2019
• Decorous combinatorial lower bounds for row layout problemsMirko Dahlbeck, Anja Fischer, Frank Fischer — 2020
• 3D facility layout problemMariem Besbes, Marc Zolghadri, Roberta Costa Affonso — 2020
• Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problemRamazan Şahin, Sadegh Niroomand, Esra Duygu Durmaz — 2020

Related papers

• A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithmYi-Feng Hung, Wei‐Chih Chen — 2011
• SALOME. a bidirectional branch and bound procedure for assembly line balancingArmin Schöll, Robert Klein — 1997
• COMPUTING REAL ZEROS OF A POLYNOMIAL BY BRANCH AND BOUND AND BRANCH AND REDUCE ALGORITHMSThi Le, Mohand Ouanès, Ahmed Zidna — 2014
• Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problemDonald L. Miller, Joseph F. Pekny — 1989
• A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding FunctionsTen‐Hwang Lai, Alan Sprague — 1986