Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem

Abstract

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… (More)
DOI: 10.1007/978-3-319-11857-4_4

Topics

2 Figures and Tables

Slides referencing similar topics