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.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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.
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.
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.
Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley.
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.
Martí, R., & Reinelt, G. (2011) The linear ordering problem: exact and heuristic methods in combinatorial optimization, (Vol. 175). Springer Science & Business Media.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
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)