Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem
The 3-flip neighborhood local search (3FNLS) is an excellent heuristic algorithm for the set covering problem which has dominating performance on the most challenging crew scheduling instances from Italy railways. We introduce a method to further improve the effectiveness of 3FNLS by incorporating random flat move to its search process. Empirical studies show that this can obviously improve the solution qualities of 3FNLS on the benchmark instances. Moreover, it updates two best known solutions within reasonable time.
KeywordsSet Covering Problem 3-flip Local Search Random Flat Move
Unable to display preview. Download preview PDF.
- 2.Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 1069–1072 (1990)Google Scholar
- 10.Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)Google Scholar