Solving the Linear Ordering Problem Using a Genetic Algorithm with Local Search

被引：0
|
作者：
Cergibozan, C. [1 ]
Tasan, A. S. [1 ]
机构：
[1] Dokuz Eylul Univ, Dept Ind Engn, Izmir, Turkey
来源：
NEW GLOBAL PERSPECTIVES ON INDUSTRIAL ENGINEERING AND MANAGEMENT | 2019年
关键词：
Linear ordering problem; Genetic algorithm; Local search;
D O I：
10.1007/978-3-319-93488-4_16
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The linear ordering problem (LOP) is an NP-hard problem in combinatorial optimization. The problem has been investigated in many research areas such as mathematics, logistics, economics, computer science, etc. The complexity motivates researchers to find effective solution methods to the problem. The aim of this study is to develop an efficient algorithm to solve LOP. In this study, a genetic algorithm based approach is proposed for LOP. An additional local search component is embedded in the algorithm to intensify the search. Proposed algorithm is applied to a number of LOP instances taken from the LOLIB. At the end of the computational study, competitive and effective results are found.
引用
收藏
页码：135 / 141
页数：7
相关论文
共 50 条
  • [1] Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm
    Bernardino, Eugenia M.
    Bernardino, Anabela M.
    Sanchez-Perez, Juan M.
    Gomez-Pulido, Juan A.
    Vega-Rodriguez, Miguel A.
    [J]. INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE 2008, 2009, 50 : 225 - +
  • [2] Solving Facility Rearrangement Problem Using a Genetic Algorithm and a Heuristic Local Search
    Suzuki, Atsushi
    Yamamoto, Hisashi
    [J]. INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2012, 11 (02): : 170 - 175
  • [3] Iterated Local search for the Linear Ordering Problem
    Castilla Valdez, Guadalupe
    Bastiani Medina, Shulamith S.
    [J]. INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2012, 3 (01): : 12 - 20
  • [4] A Genetic and Iterative Local Search Algorithm for solving Subgraph Isomorphism Problem
    Farahani, Mina Mazraeh
    Chaharsoughi, Seyed Kamal
    [J]. 2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT (IEOM), 2015,
  • [5] Solving the Linear Ordering Problem via A Memetic Algorithm
    Song, Jingyu
    Zhao, Haidan
    Zhou, Taoqin
    Tao, Ye
    Lu, Zhipeng
    [J]. PROCEEDINGS OF THE FUTURE TECHNOLOGIES CONFERENCE (FTC) 2018, VOL 2, 2019, 881 : 421 - 430
  • [6] A Genetic Programming Approach for Solving the Linear Ordering Problem
    Pop, P. C.
    Matei, O.
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, PT II, 2012, 7209 : 331 - 338
  • [7] Genetic algorithm with iterated local search for solving a location-routing problem
    Derbel, Houda
    Jarboui, Bassem
    Hanafi, Said
    Chabchoub, Habib
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) : 2865 - 2871
  • [8] Efficient local search algorithms for the linear ordering problem
    Sakuraba, Celso S.
    Yagiura, Mutsunori
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (06) : 711 - 737
  • [9] An efficient tabu search algorithm for the linear ordering problem
    Sakabe, Masahiro
    Yagiura, Mutsunori
    [J]. JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2022, 16 (04):
  • [10] Designing a hybrid genetic algorithm for the linear ordering problem
    Huang, GF
    Lim, A
    [J]. GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT I, PROCEEDINGS, 2003, 2723 : 1053 - 1064
12345