Linear programming based meta-heuristics for the weighted maximal planar graph

Journal of the Operational Research Society

Volumn 53, Issue 10 SPEC., 2002, Pages 1142-1149

  Osman, I H ^a   Hasan, M ^b   Abdullah, A ^c  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b KUWAIT UNIVERSITY   (Kuwait)

^c UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Facility layout; Greedy adaptive random search procedure; Heuristics; Integer programming formulation; Maximal planar graph; Meta heuristics; Models

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

GREEDY RANDOM ADAPTIVE SEARCH PROCEDURES (GRASP); MAXIMAL PLANAR GRAPHS; WEIGHTED MAXIMAL PLANAR GRAPHS (WMPG);

LINEAR PROGRAMMING;

EID: 0036792179     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601391     Document Type: Article

References (35)

1. Hassan M.M.D. and Hogg G.L. (1991). On constructing a block layout by graph theory. Int J Prod Res 32: 231-234.
2. Resende M.G.C. and Ribeiro C.C. (1997). A GRASP for graph planarization. Network 29: 173-189.
3. Junger M. and Mutzel P. (1993). Solving the maximum weighted planar subgraph problem by branch-and-cut. In: Rinaldi G. and Wolsey L. (eds). Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization (IPCO). pp 479-492.
4. Junger M. and Mutzel P. (1996). Maximum weighted planar subgraphs and nice embeddings: practical layout tools. Algorithmica 16: 33-59.
5. Domschke W. and Krispin G. (1997). Location and layout planning: a survey. OR-Spektrum 19: 181-194.
6. Al-Hakim L.A. (1992). A modified procedure for converting a dual graph to a block layout. Int J Prod Res 30: 2467-2476.
7. Giffin J.W., Foulds L.R. and Cameron D.C. (1986). Drawing a block plan from a REL-chart with graph theory and microcomputer. Computers Ind Engng 10: 109-115.
8. Rinsma F., Giffin J.W. and Robinson D.F. (1990). Orthogonal floorplans from maximal planar graphs. Environ Plan B: Plan Des 17: 57-71.
9. Watson K.H. and Giffin J.W. (1997). The vertex splitting algorithm for facilities layout. Int J Prod Res 35: 2477-2492.
10. Giffin J.W. (1984). Graph theory techniques for facilities layout. PhD thesis, University of Canterbury, New Zealand.
11. Foulds L.R. and Robinson D.F. (1976). A strategy for solving the plant layout problem. Opl Res Q 27: 845-855.
12. Hasan M. and Osman I.H. (1995). Local search algorithms for the maximal planar layout problem. Int Trans Opl Res 2: 89-106.
13. Osman I.H. (1995). An introduction to metaheuristics. In: Lawrence M. and Wilsdon C. (eds). Operational Research Tutorial 1995. Operational Research Society: Birmingham, pp 92-122.
14. Osman I.H. and Kelly J.P. (1996). Metaheuristics Theory and Applications, Kluwer Academic: Boston, MA.
15. Osman I.H. and Laporte G. (1996). Metaheuristics: a bibliography. Ann Opns Res 63: 513-628.
16. Voss S., Osman I.H., Martello S. and Roucairol C. (1999). Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic: Boston, MA.
17. Foulds L.R., Gibbons P. and Giffin J. (1985). Facilities layout adjacency determination: an experimental comparison of three graph theoretic heuristics. Opns Res 33: 1091-1106.
18. Osman I.H. and Hasan M. (1997). A layered matching-planarity testing heuristic for the machine layout planning. Egypt Computer Sci J 19: 1-17.
19. Boswell S. (1992). TESSA-A new greedy heuristics for facilities layout planning, Int J Prod Res 30: 1957-1968.
20. Eades P., Foulds L.R. and Giffin J.W. (1982). An efficient heuristic for identifying a maximum weight planar subgraph. In: Billington E.J. et al (eds). Lecture Notes in Mathematics, Volume 952: Springer: Berlin, pp 239-251.
21. Green R. and Al-Hakim L.A. (1985). A heuristic for facilities layout planning, Omega 13: 469-474.
22. Leung J. (1992). A new graph-theoretic heuristic for facility layout. Mngt Sci 38: 595-605.
23. Wascher G. and Merker J. (1997). A comparative evaluation of heuristics for the adjacency problem facility layout planning. Int J Prod Res 35: 447-466.
24. Al-Hakim L.A. (1991). Two graph theoretical procedures for an improved solution to the facilities layout problem. Int J Prod Res 29: 1701-1718.
25. Cimikowski R. and Mooney E. (1997). Proximity-based adjacency determination for facility layout, Computers Ind Engng 32: 341-349.
26. Kim J.-Y. and Kim Y.-D. (1995). Graph theoretic heuristics for unequal-sized facility layout problems. Omega 23: 391-401.
27. Pesch E., Glover F., Bartsch T., Salewski F. and Osman I.H. (1995). Efficient facility layout planning in a maximally planar graph model. Int J Prod Res 37: 263-283.
28. Osman I.H., Al-Ayoubi B., Barake M. and Hasan M. (2003). A greedy random adaptive search procedure for the weighted maximal planar graph problem. Forthcoming in Computers and Industrial Engineering.
29. Barake M.A. (1997). Approximate algorithms for the weighted maximal planar graph problem. MSc thesis, Institute of Mathematics and Statistics, University of Kent at Canterbury, UK.
30. Hassan M.M.D. (2000). Toward re-engineering models and algorithms of facility layout. Omega 28: 711-723.
31. Ribeiro C.C. and Resende M.G.C. (1999). Algorithm 797: FORTRAN subroutines for approximate solution of graph planarization problems using GRASP. ACM Transactions on Mathematical Software 25: 341-352.
32. Nishizeki T. and Chiba N. (1988). Planar graph: theory and algorithms, Ann Disc Math 32.
33. Festa P. and Resende M.G.C. (2002). GRASP: an annotated bibliography. In: Ribeiro C.C. and Hansen P. (eds). Essays and Surveys in Metaheuristics. Kluwer: Boston, pp 325-377.
34. CPLEX 6.0, CPLEX Optimization Inc. Suite 279, 930 Tahoe Boulevard Building 802, Incline Village, NV 89451, USA. http://www.cplex.com/.
35. LEDA 3.8, Library of Efficient Data types and Algorithms, Algorithmic Solutions Software, GmbH. http://www.algorithmic-solutions.com/.