A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem

Citation

Li J & Kwan RSK (2004) A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem. Journal of Mathematical Modelling and Algorithms, 3 (3), pp. 263-283. https://doi.org/10.1023/b%3Ajmma.0000038619.69509.bf

Abstract
This paper reports an evolutionary meta-heuristic incorporating fuzzy evaluation for some large-scale set covering problems originating from the public transport industry. First, five factors characterized by fuzzy membership functions are aggregated to evaluate the structure and generally the goodness of a column. This evaluation function is incorporated into a refined greedy algorithm to make column selection in the process of constructing a solution. Secondly, a self-evolving algorithm is designed to guide the constructing heuristic to build an initial solution and then improve it. In each generation an unfit portion of the working solution is removed. Broken solutions are repaired by the constructing heuristic until stopping conditions are reached. Orthogonal experimental design is used to set the system parameters efficiently, by making a small number of trials. Computational results are presented and compared with a mathematical programming method and a GA-based heuristic.

Keywords
set covering; fuzzy subset; evolutionary algorithm; scheduling

Journal
Journal of Mathematical Modelling and Algorithms: Volume 3, Issue 3