Solution Merging in Matheuristics for Resource Constrained Job Scheduling

Matheuristics have been gaining in popularity for solving combinatorial optimisation problems in recent years. This new class of hybrid method combines elements of both mathematical programming for intensification and metaheuristic searches for diversification. A recent approach in this direction has been to build a neighbourhood for integer programs by merging information from several heuristic solutions, namely construct, solve, merge and adapt (CMSA). In this study, we investigate this method alongside a closely related novel approach—merge search (MS). Both methods rely on a population of solutions, and for the purposes of this study, we examine two options: (a) a constructive heuristic and (b) ant colony optimisation (ACO); that is, a method based on learning. These methods are also implemented in a parallel framework using multi-core shared memory, which leads to improving the overall efficiency. Using a resource constrained job scheduling problem as a test case, different aspects of the algorithms are investigated. We find that both methods, using ACO, are competitive with current state-of-the-art methods, outperforming them for a range of problems. Regarding MS and CMSA, the former seems more effective on medium-sized problems, whereas the latter performs better on large problems.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  Andreas T. Ernst,et al.  Hybrids of Integer Programming and ACO for Resource Constrained Job Scheduling , 2014, Hybrid Metaheuristics.

[3]  Carlo Vercellis,et al.  Hierarchical models for multi-project planning and scheduling , 1993 .

[4]  Alf Kimms,et al.  Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds , 2001, Ann. Oper. Res..

[5]  Maria Grazia Speranza,et al.  A survey on matheuristics for routing problems , 2014, EURO J. Comput. Optim..

[6]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[7]  Christian Blum,et al.  Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem , 2016, EvoCOP.

[8]  Christodoulos A. Floudas.  Generalized Benders Decomposition , 2009, Encyclopedia of Optimization.

[9]  Christina Freytag,et al.  Using Mpi Portable Parallel Programming With The Message Passing Interface , 2016 .

[10]  Halina Kwasnicka,et al.  Nature Inspired Methods and Their Industry Applications—Swarm Intelligence Algorithms , 2018, IEEE Transactions on Industrial Informatics.

[11]  K. Umamaheswari,et al.  A bio-inspired swarm intelligence technique for social aware cognitive radio handovers , 2017, Comput. Electr. Eng..

[12]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[13]  Matthijs den Besten,et al.  Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.

[14]  D. Thiruvady,et al.  A lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows , 2014, Journal of Heuristics.

[15]  Andreas T. Ernst,et al.  Parallel ant colony optimization for resource constrained job scheduling , 2016, Ann. Oper. Res..

[16]  Xiaodong Li,et al.  A merge search algorithm and its application to the constrained pit problem in mining , 2018, GECCO.

[17]  Christian Blum,et al.  Hybrid Metaheuristics: Powerful Tools for Optimization , 2016 .

[18]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[19]  Maxim A. Dulebenets,et al.  A Self-Adaptive Evolutionary Algorithm for the Berth Scheduling Problem: Towards Efficient Parameter Control , 2018, Algorithms.

[20]  Andreas T. Ernst,et al.  Constraint-based ACO for a shared resource constrained scheduling problem , 2013 .

[21]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[22]  Andreas T. Ernst,et al.  A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem , 2019, Australasian Conference on Artificial Intelligence.

[23]  Andreas T. Ernst,et al.  Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO , 2019, HM.

[24]  Andreas T. Ernst,et al.  Genetic programming approach to learning multi-pass heuristics for resource constrained job scheduling , 2018, GECCO.

[25]  L. Dagum,et al.  OpenMP: an industry standard API for shared-memory programming , 1998 .

[26]  Antonio Bolufé Röhler,et al.  Matheuristics: Optimization, Simulation and Control , 2009, Hybrid Metaheuristics.

[27]  Xin-She Yang,et al.  Bio-inspired computation: Where we stand and what's next , 2019, Swarm Evol. Comput..

[28]  Dorit S. Hochbaum,et al.  Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem , 2000, Oper. Res..

[29]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[30]  Andreas T. Ernst,et al.  Resource constraint scheduling with a fractional shared resource , 2011, Oper. Res. Lett..

[31]  David Avis,et al.  Optimized open pit mine design, pushbacks and the gap problem—a review , 2014, Journal of Mining Science.

[32]  Mario Vanhoucke,et al.  A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows , 2010 .

[33]  Guy Desaulniers,et al.  A matheuristic for the liner shipping network design problem , 2014 .

[34]  Andreas T. Ernst,et al.  Lagrangian Particle Swarm Optimization for a resource constrained machine scheduling problem , 2012, 2012 IEEE Congress on Evolutionary Computation.

[35]  Erik Demeulemeester,et al.  On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints , 2001, Manag. Sci..

[36]  Christian Blum.  Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition , 2016, HM.

[37]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[38]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[39]  Federico Della Croce,et al.  A variable neighborhood search based matheuristic for nurse rostering problems , 2014, Ann. Oper. Res..

[40]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[41]  Manuel López-Ibáñez,et al.  Construct , Merge , Solve & Adapt : A New General Algorithm For Combinatorial Optimization , 2015 .

[42]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[43]  Andreas T. Ernst,et al.  Resource Constrained Job Scheduling with Parallel Constraint-Based ACO , 2017, ACALCI.

[44]  Xiaodong Li,et al.  Towards solving large-scale precedence constrained production scheduling problems in mining , 2017, GECCO.

[45]  Su Nguyen,et al.  Evolving Large Reusable Multi-pass Heuristics for Resource Constrained Job Scheduling , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[46]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[47]  Andreas T. Ernst,et al.  Scheduling medical residents' training at university hospitals , 2019, Eur. J. Oper. Res..

[48]  Andreas T. Ernst,et al.  A hybrid differential evolution algorithm with column generation for resource constrained job scheduling , 2019, Comput. Oper. Res..