Metaheuristics for the integrated machine allocation and layout problem (Q1042704)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Metaheuristics for the integrated machine allocation and layout problem |
scientific article |
Statements
Metaheuristics for the integrated machine allocation and layout problem (English)
0 references
7 December 2009
0 references
Summary: 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.
0 references
machine allocation
0 references
machine layout
0 references
IMALP
0 references
memetic algorithms
0 references
metaheuristics
0 references
multicommodity flow problem
0 references
quadratic assignment problem
0 references
tabu search
0 references
product flows
0 references
materials handling cost
0 references