An electromagnetism metaheuristic for the unicost set covering problem

European Journal of Operational Research

Volumn 205, Issue 2, 2010, Pages 290-300

  Naji Azimi, Zahra ^a   Toth, Paolo ^a   Galli, Laura ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Combinatorial optimization; Electromagnetism metaheuristic; Unicost set covering problem

Indexed keywords

ELECTROMAGNETISM THEORY; FIXED NUMBERS; INITIAL POPULATION; LOCAL OPTIMA; LOCAL SEARCH; META HEURISTIC ALGORITHM; META-HEURISTIC APPROACH; METAHEURISTIC; PARAMETER SETTING; SET COVERING PROBLEM; SOLUTION SPACE;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; POPULATION STATISTICS;

ELECTROMAGNETISM;

EID: 77049112707     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.01.035     Document Type: Article

References (28)

1. Aickelin U. An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society 53 (2002) 1118-1126
2. Bautista J., and Pereira J. A GRASP algorithm to solve the unicost set covering problem. Computers and Operations Research 34 (2007) 3162-3173
3. Beasley J.E. An algorithm for set covering problems. European Journal of Operational Research 31 (1987) 85-93
4. Beasley J.E. OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society (1990) 41-1072
5. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
6. Birbil S.I., and Fang S.C. An electromagnetism-like mechanism for global optimization. Journal of Global Optimization 25 (2003) 263-282
7. Caprara A., Fischetti M., Toth P., Vigo D., and Guida P.L. Algorithms for railway crew management. Mathematical Programming 79 (1997) 125-141
8. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 (1999) 730-743
9. Caprara A., Fischetti M., and Toth P. Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
10. Caserta M. Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner K.F., Gendreau M., Greistorfer P., Gutjahr W.J., Hartl R.F., and Reimann M. (Eds). Metaheuristics: Progress in Complex Systems Optimization (2007), Springer, Berlin 3-63
11. Ceria S., Nobili P., and Sassano A. Set Covering Problem. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1998), John Wiley and Sons, USA 415-428
12. Chen S.H., Chang P.C., Chan C.L., and Mani V. A hybrid electromagnetism-like algorithm for single machine scheduling problem. Lecture Notes in Computer Science 4682 (2007) 543-552
13. Davoudpour H., and Hadji Molana M. Solving flow shop sequencing problem for deteriorating jobs by using electro magnetic algorithm. Journal of Applied Sciences 8 22 (2008) 4121-4128
14. Debels D., De Reyck B., Leus R., and Vanhoucke M. A hybrid scatter search/electromagnetism metaheuristic for project scheduling. European Journal of Operational Research 169 2 (2006) 638-653
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, USA
16. Haouari M., and Chaouachi J.S. A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem. Journal of the Operational Research Society 53 (2002) 792-799
17. Javadian N., Gol Alikhani M., and Tavakkoli-Moghaddam R. A discrete binary version of the electromagnetism-like heuristic for solving traveling salesman problem. Lecture Notes in Computer Science 5227 (2008) 123-130
18. Lan G., DePuy G.W., and Whitehouse G.E. An effective and simple heuristic for the set covering problem. European Journal of Operational Research 176 (2007) 1387-1403
19. Lessing L., Dumitrescu I., and Stützle T. A comparison between ACO algorithms for the set covering problem. Lecture Notes in Computer Science 3172 (2004) 1-12
20. Maenhout B., and Vanhoucke M. An electromagnetism metaheuristic for the nurse scheduling problem. Journal of Heuristics 13 4 (2007) 359-385
21. Naderi B., Zandieh M., Khaleghi Ghoshe Balagh A., and Roshanaei V. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications 36 6 (2009) 9625-9633
22. Rahmati K., Molavi M., Naderi B., and Soltani M. A hybridization of simulated annealing and electromagnetism for flowshop problems with skipping probability. Journal of Applied Sciences 9 13 (2009) 2438-2444
23. Salari M., and Naji-Azimi Z. Introduction to electromagnetism algorithm for the examination timetabling problem and comparison of it with other metaheuristics. Pacific Journal of Optimization 2 (2006) 341-366
24. Solar M., Parada V., and Urrutia R. A parallel genetic algorithm to solve the set covering problem. Computers and Operations Research 29 (2002) 1221-1235
25. Tavakkoli-Moghaddam R., Khalili M., and Naderi B. A hybridization of simulated annealing and electromagnetism-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Computing 13 10 (2009) 995-1006
26. Umetani S., and Yagiura M. Relaxation heuristics for the set covering problem. Journal of the Operations Research Society of Japan 50 (2007) 350-375
27. Wu, P., Yang, K.J., Fang, H.C., 2006. A revised EM-like algorithm + K-OPT method for solving traveling salesman problem. In: First International Conference on Innovative Computing, Information and Control, ICICIC'06; Art No. 1691858, pp. 546-549.
28. Yagiura M., Kishida M., and Ibaraki T. A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research 172 (2006) 472-499