A practical exact algorithm for the shortest loop design problem in a block layout

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial int...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2005-05, Vol.43 (9), p.1879-1887
Main Authors: Zanjirani Farahani, R., Laporte, G., Sharifyazdi, M.
Format: Article
Language:English
Subjects:
AGV
Algorithms
Applied sciences
Block layout
Conveyors
Exact sciences and technology
Heuristic
Integer linear programming
Loops
Materials handling
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Single loop
Studies
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial integer linear programming solver embedded within an iterative scheme.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540500031980