Multi-Point Constructive Search maintains a small set of "elite solutions" that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems and quasi-group completion problems, multi-point constructive search performs significantly better than chronological backtracking and bounded backtracking with random restart. © Springer-Verlag Berlin Heidelberg 2005.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Beck, J. C. (2005). Multi-point constructive search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 737–741). https://doi.org/10.1007/11564751_55