A meta-heuristic with orthogonal experiment for the set covering problem

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 3, 2004, Pages 263-283

  Li, Jingpeng ^a   Kwan, Raymond S K ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Evolutionary algorithm; Fuzzy subset; Scheduling; Set covering

Indexed keywords

EID: 18744374890     PISSN: 15701166     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000038619.69509.bf     Document Type: Article

References (23)

1. Aickelin, U.: An indirect genetic algorithm for set covering problems, J. Oper. Res. Soc. 53 (2002), 1118-1126.
2. Beasley, J. E.: A Lagrangian heuristic for set covering problems, Naval Res. Logist. 37 (1990), 151-164.
3. Beasley, J. E.: OR-Library: Distribution test problems by electronic mail, J. Oper. Res. Soc. 41 (1990), 1069-1072.
4. Beasley, J. E. and Chu, P. C.: A genetic algorithm for the set covering problem, European J. Oper. Res. 94 (1996), 392-404.
5. Caprara, A., Fischetti, M. and Toth, P.: A heuristic method for the set covering problem, Oper. Res. 47(1999). 730-743.
6. Dénes, J. and Keedwell, A. D.: Latin Square and Their Applications, English Universities Press Limited, Budapest, 1974.
7. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
8. Fores, S., Proll, L. and Wren, A.: TRACS II: A hybrid IP/heuristic driver scheduling system for public transport, J. Oper. Res. Soc. 53 (2002), 1093-1100.
9. Haddadi, S.: Simple Lagrangian heuristic for the set covering problem, European J. Oper. Res. 97(1997), 200-204.
10. Karmarkar, N.: A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), 373-395.
11. Kling, R. M. and Banerjee, P.: ESP: A new standard cell placement package using simulated evolution, in Proceedings of the 24th ACM/IEEE Design Automation Conference, 1987, pp. 60-66.
12. Kwan, R. S. K, Kwan, A. S. K. and Wren, A.: Evolutionary driver scheduling with relief chains, Evolutionary Computation 9 (2001), 445-460.
13. Li, J. and Kwan, R. S. K.: A fuzzy simulated evolution algorithm for the driver scheduling problem, in Proceedings of the 2001 IEEE Congress on Evolutionary Computation, IEEE Press, 2001, pp. 1115-1122.
14. Li, J. and Kwan, R. S. K.: A fuzzy theory based evolutionary approach for driver scheduling, in L. Spector et al. (eds), Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufman, 2001, pp. 1152-1158.
15. Li, J. and Kwan, R. S. K.: A fuzzy genetic algorithm for driver scheduling, European J. Oper. Res. 147 (2003), 334-344.
16. Ohlsson, M., Peterson, C. and Söberderg, B.: An efficient mean field approach to the set covering problem, European J. Oper. Res. 133 (2001), 583-599.
17. Sen, S.: Minimal cost set covering using probabilistic methods, in Proceedings of the 1993 ACM Symposium on Applied Computing: States of the Art and Practice, 1993, pp. 157-164.
18. Slavík, P.: A tight analysis of the greedy algorithm for set cover, in ACM Symposium on Theory of Computing, 1996, pp. 435-441.
19. Solar, M., Parada, V. and Urrutia, R.: A parallel genetic algorithm to solve the set-covering problem, Comput. Oper. Res. 29 (2002). 1221-1235.
20. Srinivasan, A.: Improved approximations of packing and covering problems, in ACM Symposium on Theory of Computing, 1995, pp. 268-276.
21. Taguchi, G.: System of Experimental Design, Vols. 1 and 2, UNIPUB/Kraus International Publications, New York, 1987.
22. The triplex design group of Chinese Association of Statistics: Orthogonal Method and Triplex Design, Science Press, Beijing, 1987.
23. Zadeh, L. A.: Fuzzy sets, Inform. Control 8 (1965), 338-353.