Recent Harmony Search Algorithms for 0-1 Optimization Problems

The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.

[1]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[2]  Nicos Christofides,et al.  Zero-One Programming Using Non-Binary Tree-Search , 1971, Comput. J..

[3]  Broderick Crawford,et al.  Cultural Algorithms for the Set Covering Problem , 2013, ICSI.

[4]  S. G. Ponnambalam,et al.  Evolutionary Search Techniques to Solve Set Covering Problems , 2008 .

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6]  Gerosa Giacomo,et al.  Measurements of Soil Carbon Dioxide Emissions from Two Maize Agroecosystems at Harvest under Different Tillage Conditions , 2014, TheScientificWorldJournal.

[7]  Minrui Fei,et al.  A Discrete Harmony Search Algorithm , 2010 .

[8]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[9]  Panos M. Pardalos,et al.  An improved adaptive binary Harmony Search algorithm , 2013, Inf. Sci..

[10]  Steven Li,et al.  A simplified binary harmony search algorithm for large scale 0-1 knapsack problems , 2015, Expert Syst. Appl..

[11]  Richard H. Day,et al.  Letter to the Editor-On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming , 1965 .

[12]  Broderick Crawford,et al.  An Artificial Bee Colony Algorithm for the Set Covering Problem , 2014, CSOC.

[13]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[14]  Uwe Aickelin,et al.  A genetic algorithm approach for set covering problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[15]  Francis J. Vasko,et al.  Optimal Selection of Ingot Sizes Via Set Covering , 1987, Oper. Res..

[16]  Broderick Crawford,et al.  Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization , 2013, Expert Syst. Appl..

[17]  Melvin A. Breuer,et al.  Simplification of the Covering Problem with Application to Boolean Expressions , 1970, JACM.

[18]  Broderick Crawford,et al.  A 2-level Approach for the Set Covering Problem: Parameter Tuning of Artificial Bee Colony Algorithm by Using Genetic Algorithm , 2014, ICSI.

[19]  H. D. Ratliff,et al.  Optimal Defense of Multi-Commodity Networks , 1971 .

[20]  Moshe B. Rosenwein,et al.  An interactive optimization system for bulk-cargo ship scheduling , 1989 .

[21]  Zhi-Gang Ren,et al.  New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..

[22]  Broderick Crawford,et al.  A 2-level Metaheuristic for the Set Covering Problem , 2014, Int. J. Comput. Commun. Control.

[23]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[24]  Broderick Crawford,et al.  Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem , 2014, HCI.

[25]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[26]  Efthymios Housos,et al.  Automatic Optimization of Subproblems in Scheduling Airline Crews , 1997 .

[27]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[28]  Agha Iqbal Ali,et al.  A network relaxation based enumeration algorithm for set partitioning , 1989 .

[29]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[30]  Broderick Crawford,et al.  Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem , 2014, TheScientificWorldJournal.