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


CERGİBOZAN Ç., TAŞAN A. S.

3rd Int Joint Conf on 23rd Int Conf on Ind Engn and Operat Management (ICIEOM) / Int ADINGOR Conf (ADINGOR) / Int IISE Conf (IISE) / Int AIM Conf (AIM) / Int ASEM Conf (ASEM) (IJC) - New Global Perspectives on Industrial Engineering and Management, Valencia, İspanya, 6 - 07 Temmuz 2017, ss.135-141 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1007/978-3-319-93488-4_16
  • Basıldığı Şehir: Valencia
  • Basıldığı Ülke: İspanya
  • Sayfa Sayıları: ss.135-141
  • Anahtar Kelimeler: Linear ordering problem, Genetic algorithm, Local search
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.