Efficient facility layout planning in a maximally planar graph model

Efficient facility layout planning in a maximally planar graph model

0.00 Avg rating0 Votes
Article ID: iaor20001287
Country: United Kingdom
Volume: 37
Issue: 2
Start Page Number: 263
End Page Number: 283
Publication Date: Jan 1999
Journal: International Journal of Production Research
Authors: , , , ,
Keywords: layout
Abstract:

In the domain of facility and factory layout planning, the difficult problem of finding a maximum weight planar subgraph of an edge-weighted complete graph has many important practical applications. We introduce new neighbourhood structures to generate an initial solution and yield feasible modifications of a current layout. We compare our constructive algorithm to a couple of approaches from the literature in order to receive an initial feasible solution. Moreover, a new implementation of Leung's greedy heuristic outperforms all other layout approximation algorithms in quality. Computational results demonstrate the performance characteristics.

Reviews

Required fields are marked *. Your email address will not be published.