Metaheuristics for the Integrated Machine Allocation and Layout Problem

Juan R. Jaramillo and Alan R. McKendall

International Journal of Operational Research, 2010, vol. 7, issue 1, 74-89

Abstract: The Integrated Machine Allocation and Layout Problem (IMALP) is the problem of assigning a set of machines (including machine replicas) to locations while assigning product flows to machines such that Material Handling Cost is minimised. A new mathematical formulation, a Tabu Search (TS) heuristic, and a Memetic Algorithm (MA) are presented for the IMALP. The algorithms were evaluated using a set of test problems available in the literature. TS and the MA obtained equal or better solutions for the dataset than previous techniques presented in the literature. More specifically, TS obtained better solutions in 47% of the instances, and MA improved the best known solution in 52.4% of the cases. As a result, MA out-performed TS with respect to solution quality and computation time.

Keywords: machine allocation; machine layout; IMALP; memetic algorithms; metaheuristics; multicommodity flow problem; quadratic assignment problem; Tabu search; product flows; materials handling cost. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=29518 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:7:y:2010:i:1:p:74-89

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().