Skip to main content
SpringerLink
Log in
Book cover

New Global Perspectives on Industrial Engineering and Management pp 135–141Cite as

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

  • Conference paper
  • First Online:

  • 835 Accesses

Part of the book series: Lecture Notes in Management and Industrial Engineering ((LNMIE))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Campos, V., Glover, F., Laguna, M., & Martí, R. (2001). An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization, 21(4), 397–414.

    Article  MathSciNet  Google Scholar 

  • Duarte, A., Laguna, M., & Martí, R. (2011). Tabu search for the linear ordering problem with cumulative costs. Computational Optimization and Applications, 48(3), 697–715.

    Article  MathSciNet  Google Scholar 

  • Garcia, C. G., Pérez-Brito, D., Campos, V., & Martí, R. (2006). Variable neighborhood search for the linear ordering problem. Computers & Operations Research, 33(12), 3549–3565.

    Article  Google Scholar 

  • Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley.

    Google Scholar 

  • Laguna, M., Martí, R., & Campos, V. (1999). Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers & Operations Research, 26(12), 1217–1230.

    Article  Google Scholar 

  • Martí, R., & Reinelt, G. (2011) The linear ordering problem: exact and heuristic methods in combinatorial optimization, (Vol. 175). Springer Science & Business Media.

    Google Scholar 

  • Martí, R., Reinelt, G., & Duarte, A. (2012). A benchmark library and a comparison of heuristic methods for the linear ordering problem. Computational Optimization and Applications, 51(3), 1297–1317.

    Article  MathSciNet  Google Scholar 

  • Sakuraba, C. S., Ronconi, D. P., Birgin, E. G., & Yagiura, M. (2015). Metaheuristics for large-scale instances of the linear ordering problem. Expert Systems with Applications, 42(9), 4432–4442.

    Article  Google Scholar 

  • Schiavinotto, T., & Stützle, T. (2004). The linear ordering problem: Instances, search space analysis and algorithms. Journal of Mathematical Modelling and Algorithms, 3(4), 367–402.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Dokuz Eylul University, Izmir, Turkey

    C. Cergibozan & A. S. Tasan

Authors
  1. C. Cergibozan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Tasan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. S. Tasan .

Editor information

Editors and Affiliations

  1. Research Centre on Production Management and Engineering (CIGIP), Escuela Politécnica Superior de Alcoy Universitat Politècnica de València, Alcoy, Alicante, Spain

    Josefa Mula

  2. Brazilian Association of Production Engineering—ABEPRO, Rio de Janeiro, Brazil

    Rafael Barbastefano

  3. Research Centre on Production Management and Engineering (CIGIP), Escuela Politécnica Superior de Alcoy Universitat Politècnica de València, Alcoy, Alicante, Spain

    Manuel Díaz-Madroñero

  4. Research Centre on Production Management and Engineering (CIGIP), Escuela Politécnica Superior de Alcoy Universitat Politècnica de València, Alcoy, Alicante, Spain

    Raúl Poler

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cergibozan, C., Tasan, A.S. (2019). Solving the Linear Ordering Problem Using a Genetic Algorithm with Local Search. In: Mula, J., Barbastefano, R., Díaz-Madroñero, M., Poler, R. (eds) New Global Perspectives on Industrial Engineering and Management. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-93488-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93488-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93487-7

  • Online ISBN: 978-3-319-93488-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation