Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
type: Item
instance of: scholarly article
title: Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
zbMATH Open document ID: 1375.90159
author: Ardavan Asef-Vaziri
author: Morteza Kazemi
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6811978
zbMATH Keywords: block layout shortest loop
zbMATH Keywords: loop based material handling
zbMATH Keywords: generalized traveling salesman problem
zbMATH Keywords: covering constraints
zbMATH Keywords: automatic guided vehicle systems
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.019
OpenAlex ID: W2746378258
cites work: Network configuration and machine layout in fixed-path material handling systems
cites work: Dual track and segmented single track bidirectional loop guidepath layout for AGV systems
cites work: The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
cites work: An ant colony system for enhanced loop-based aisle-network design
cites work: Exact and heuristic procedures for the material handling circular flow path design problem
cites work: The value of the shortest loop covering all work centers in a manufacturing facility layout
cites work: Modeling and Analysis of Congestion in the Design of Facility Layouts
cites work: Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Complexity of the AGV shortest path and single-loop guide path layout problems
cites work: Minimizing makespan and throughput times at Aalsmeer flower auction
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm
cites work: A practical exact algorithm for the shortest loop design problem in a block layout
cites work: Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Modelling empty vehicle traffic in AGVS design
cites work: An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
cites work: Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems
cites work: Classification of travelling salesman problem formulations
cites work: Some Applications of the Generalized Travelling Salesman Problem
cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
cites work: Heuristic dispatching models for multi-vehicle materials handling systems
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: Impact of empty vehicle flow on optimal flow path design for unidirectional AGV systems
cites work: A simulated annealing algorithm for allocating space to manufacturing cells
cites work: Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability
DOI: 10.1016/J.EJOR.2017.07.019
description: scientific article; zbMATH DE number 6811978