A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs

This paper presents a Population-based Strategic Oscillation (denoted by PBSO) algorithm for solving the linear ordering problem with cumulative costs (denoted by LOPCC). The proposed algorithm integrates several distinguished features, such as an adaptive strategic oscillation local search procedure and an effective population updating strategy. The proposed PBSO algorithm is compared with several state-of-the-art algorithms on a set of public instances up to 100 vertices, showing its efficacy in terms of both solution quality and efficiency. Moreover, several important ingredients of the PBSO algorithm are analyzed.

[1]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[2]  Fred W. Glover,et al.  A hybrid metaheuristic approach to solving the UBQP problem , 2010, Eur. J. Oper. Res..

[3]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[4]  Matteo Fischetti,et al.  The Linear Ordering Problem with cumulative costs , 2008, Eur. J. Oper. Res..

[5]  Nevio Benvenuto,et al.  Optimum power control and ordering in SIC receivers for uplink CDMA systems , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[6]  Fred W. Glover,et al.  General Purpose Heuristics for Integer Programming—Part II , 1997, J. Heuristics.

[7]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[8]  Gerhard Reinelt,et al.  The Linear Ordering Problem , 2011 .

[9]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

[10]  Lakhmi C. Jain,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2004, Lecture Notes in Computer Science.

[11]  Gerhard Reinelt,et al.  The linear ordering problem: algorithms and applications , 1985 .

[12]  Juan Martín Carpio Valadez,et al.  Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC) , 2010, KES.

[13]  Antti Toskala,et al.  WCDMA for UMTS: Radio Access for Third Generation Mobile Communications , 2000 .

[14]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[15]  Thomas Stützle,et al.  The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.

[16]  Fred W. Glover,et al.  The case for strategic oscillation , 2011, Ann. Oper. Res..

[17]  Abraham Duarte,et al.  Tabu search for the linear ordering problem with cumulative costs , 2011, Comput. Optim. Appl..

[18]  Abraham Duarte,et al.  Metaheuristics for the linear ordering problem with cumulative costs , 2012, Eur. J. Oper. Res..

[19]  Giovanni Righini.  A branch-and-bound algorithm for the linear ordering problem with cumulative costs , 2008, Eur. J. Oper. Res..