A Hybrid Evolutionary Algorithm for the Page Number Minimization Problem

被引：0
|
作者：
Satsangi, Dharna [1 ]
Srivastava, Kamal [1 ]
Gursaran [1 ]
机构：
[1] Dayalbagh Educ Inst, Dept Math, Agra, Uttar Pradesh, India
来源：
TRENDS IN COMPUTER SCIENCE, ENGINEERING AND INFORMATION TECHNOLOGY | 2011年 / 204卷
关键词：
Pagenumber problem; Hybrid Evolutionary Algorithm; Depth First Search; PAGENUMBER; NETWORKS; GRAPHS; BOOKS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we present a hybrid evolutionary algorithm (HEA) for solving the pagenumber problem. In HEA. random depth first search of the graph is used for placing the vertices on the spine and an edge embedding heuristic is designed to distribute the edges on a minimal number of pages. The results show that the algorithm achieves the optimal pagenumber for most of the standard graphs tested by us. HEA performance is also compared with the GA described by Kapoor et al. [1] on select instances of standard and random graphs. It is observed that HEA gives a better solution for most of the instances.
引用
收藏
页码：463 / 475
页数：13
相关论文
共 50 条
  • [21] An effective hybrid evolutionary algorithm for the set orienteering problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    INFORMATION SCIENCES, 2024, 654
  • [22] Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem
    Chaves, Antonio Augusto
    Nogueira Lorena, Luiz Antonio
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (05) : 5013 - 5018
  • [23] An effective hybrid evolutionary algorithm for the clustered orienteering problem
    Wu, Qinghua
    He, Mu
    Hao, Jin-Kao
    Lu, Yongliang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 313 (02) : 418 - 434
  • [24] An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization
    Miguel Ángel González
    Inés González-Rodríguez
    Camino R. Vela
    Ramiro Varela
    Soft Computing, 2012, 16 : 2097 - 2113
  • [25] An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization
    Angel Gonzalez, Miguel
    Gonzalez-Rodriguez, Ines
    Vela, Camino R.
    Varela, Ramiro
    SOFT COMPUTING, 2012, 16 (12) : 2097 - 2113
  • [26] K-page crossing number minimization problem: An evaluation of heuristics and its solution using GESAKP
    Satsangi, Dharna
    Srivastava, Kamal
    Srivastava, Gursaran
    MEMETIC COMPUTING, 2013, 5 (04) : 255 - 274
  • [27] A MODIFIED HYBRID ALGORITHM FOR SOLVING A COMPOSITE MINIMIZATION PROBLEM IN BANACH SPACES
    Chang, Shih-Sen
    Liu, Min
    Zhao, Liangcai
    Tang, Jinfang
    JOURNAL OF NONLINEAR AND VARIATIONAL ANALYSIS, 2019, 3 (03): : 357 - 364
  • [28] A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    COMPUTERS & OPERATIONS RESEARCH, 2022, 144
  • [29] A hybrid evolutionary algorithm to solve the job shop scheduling problem
    Cheng, T. C. E.
    Peng, Bo
    Lu, Zhipeng
    ANNALS OF OPERATIONS RESEARCH, 2016, 242 (02) : 223 - 237
  • [30] A hybrid evolutionary algorithm for the resource constrained project scheduling problem
    Thammano, Arit
    Phu-ang, Ajchara
    PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 17TH '12), 2012, : 834 - 837
12345