Two new heuristic algorithms for the maximal planar layout problem

被引：0
|
作者：
Merker, J
Wascher, G
机构：
[1] TECH UNIV CAROLO WILHELMINA BRAUNSCHWEIG,INST WIRTSCHAFTSWISSENSCH,D-38023 BRAUNSCHWEIG,GERMANY
[2] UNIV HALLE WITTENBERG,WIRTSCHAFTSWISSENSCH FAK,BETRIEBSWIRTSCHAFTSLEHRE PROD & LOGIST,D-06099 HALLE,GERMANY
来源：
OR SPEKTRUM | 1997年 / 19卷 / 02期
关键词：
facility layout planning; planar graphs; heuristics; numerical experiments;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The adjacency problem is an important subproblem in facility layout planning. It is known to be NP-complete, so heuristics are required to solve ''large'' problem instances. In this paper two new heuristics for the adjacency problem are introduced which belong to a special class of constructive methods called Triangulation Expansion Heuristics. Extensive numerical experiments have been carried out in order to evaluate the proposed meth ods in terms of computing times and solution quality. It has been found that at least one method is clearly superior to the best methods proposed in the literature so far (fades et al. 1982, Leung 1992).
引用
收藏
页码：131 / 137
页数：7
相关论文
共 50 条
  • [1] Two new heuristic algorithms for the maximal planar layout problem
    Merker J.
    Wäscher G.
    [J]. Operations-Research-Spektrum, 1997, 19 (2) : 131 - 137
  • [2] Construction Site Layout Planning Problem Using Two New Meta-heuristic Algorithms
    A. Kaveh
    M. Khanzadi
    M. Alipour
    M. Rastegar Moghaddam
    [J]. Iranian Journal of Science and Technology, Transactions of Civil Engineering, 2016, 40 : 263 - 275
  • [3] Construction Site Layout Planning Problem Using Two New Meta-heuristic Algorithms
    Kaveh, A.
    Khanzadi, M.
    Alipour, M.
    Moghaddam, M. Rastegar
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF CIVIL ENGINEERING, 2016, 40 (04) : 263 - 275
  • [4] New heuristic for the dynamic layout problem
    Erel, E
    Ghosh, JB
    Simon, JT
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (12) : 1275 - 1282
  • [5] New heuristic algorithms for solving the planar p-median problem
    Drezner, Zvi
    Brimberg, Jack
    Mladenovic, Nenad
    Salhi, Said
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 62 : 296 - 304
  • [6] On the task assignment problem: Two new efficient heuristic algorithms
    Kopidakis, Y
    Lamari, M
    Zissimopoulos, V
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 42 (01) : 21 - 29
  • [7] Two new approximation algorithms for the maximum planar subgraph problem
    Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Tampere, Finland
    [J]. Acta Cybern, 2008, 3 (503-527):
  • [8] Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
    Poranen, Timo
    [J]. ACTA CYBERNETICA, 2008, 18 (03): : 503 - 527
  • [9] Design and optimization of layout problem using meta-heuristic algorithms
    Balaji, S. Suresh
    Ragunathan, S.
    Visagavel, K.
    Kumar, S. Ganesh
    [J]. SCIENTIA IRANICA, 2022, 29 (05) : 2290 - 2303
  • [10] Exact and heuristic approaches for a new circular layout problem
    Philipp Hungerländer
    Kerstin Maier
    Veronika Pachatz
    Christian Truden
    [J]. SN Applied Sciences, 2020, 2
12345