Affiliation:
1. Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy
Abstract
In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the computation of a “surprisal” measure when selecting the solution columns. Computational experiments, performed on instances from the OR-Library, showed that SBH yields a 2.5% improvement in terms of the objective function value over the Chvatal’s algorithm while retaining similar execution times, making it suitable for real-time applications. The new heuristic was also compared with Kordalewski’s greedy algorithm, obtaining similar solutions in much shorter times on large instances, and Grossmann and Wool’s algorithm for unicost instances, where SBH obtained better solutions.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference37 articles.
1. A technique for the solution of massive set covering problems, with application to airline crew scheduling;Rubin;Transp. Sci.,1973
2. Marchiori, E., and Steenbeek, A. (2000, January 17). An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. Proceedings of the Real-World Applications of Evolutionary Computing: EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight Edinburgh, Scotland, UK.
3. Algorithms for railway crew management;Caprara;Math. Program.,1997
4. Combinatorial auctions;Abrache;Ann. Oper. Res.,2007
5. An integer programming approach to the vehicle scheduling problem;Foster;J. Oper. Res. Soc.,1976
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献