Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout

DOI10.1016/j.ejor.2017.07.019zbMath1375.90159OpenAlexW2746378258MaRDI QIDQ1681433

Ardavan Asef-Vaziri, Morteza Kazemi

Publication date: 23 November 2017

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

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

zbMATH Keywords

generalized traveling salesman problemcovering constraintsautomatic guided vehicle systemsblock layout shortest looploop based material handling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm

Uses Software

• CPLEX

Cites Work

• Exact and heuristic procedures for the material handling circular flow path design problem
• Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
• Classification of travelling salesman problem formulations
• Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability
• A comparative analysis of several asymmetric traveling salesman problem formulations
• An ant colony system for enhanced loop-based aisle-network design
• Heuristic dispatching models for multi-vehicle materials handling systems
• Network configuration and machine layout in fixed-path material handling systems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Dual track and segmented single track bidirectional loop guidepath layout for AGV systems
• The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• Modeling and Analysis of Congestion in the Design of Facility Layouts
• Integer Programming Formulation of Traveling Salesman Problems
• Minimizing makespan and throughput times at Aalsmeer flower auction
• A simulated annealing algorithm for allocating space to manufacturing cells
• Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems
• Impact of empty vehicle flow on optimal flow path design for unidirectional AGV systems
• Complexity of the AGV shortest path and single-loop guide path layout problems
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Modelling empty vehicle traffic in AGVS design
• A practical exact algorithm for the shortest loop design problem in a block layout
• An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
• Solution of a Large-Scale Traveling-Salesman Problem
• Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm
• Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems
• The value of the shortest loop covering all work centers in a manufacturing facility layout

This page was built for publication: Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout