A location problem on unicyclic networks: Balanced case

DOI10.1016/0377-2217(92)90247-7zbMath0769.90059OpenAlexW2095420063MaRDI QIDQ1196028

Ali S. Kiran, Selçuk Karabatı, Ali Tamer Ünal

Publication date: 4 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90247-7

zbMATH Keywords

\(n\) stationsbalanced flow matrixstation sequencing problemunicyclic unidirectional network

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (9)

Design of unidirectional cyclic layouts ⋮ Exact solution procedures for the balanced unidirectional cyclic layout problem ⋮ Facilities layout design optimization with single loop material flow path configuration ⋮ Scheduling and routing algorithms for AGVs: A survey ⋮ An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems ⋮ Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm ⋮ A branch and bound method for solving the bidirectional circular layout problem ⋮ Move based heuristics for the unidirectional loop network layout problem ⋮ Survey of research in the design and control of automated guided vehicle systems

Cites Work

• The Quadratic Assignment Problem
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: A location problem on unicyclic networks: Balanced case