Abstract
Recently, due to the growth in machine learning and data mining, for scheduling applications in China’s industrial intelligence, we are quite fortunate to witness a paradigm of evolutionary scheduling via learning, which includes a new tool of evolutionary transfer optimization (ETO). As a new subset in ETO, single-objective to multi-objective/many-objective optimization (SMO) acts as a powerful, abstract and general framework with wide industrial applications like shop scheduling and vehicle routing. In this paper, we focus on the general mechanism of selection that selects or gathers elite and high potential solutions towards gathering/transferring strength from single-objective problems, or gathering/transferring storms of knowledge from solved tasks. Extensive studies in vehicle routing problems with time windows (VRPTW) on well-studied benchmarks validate the great universality of the SMO framework. Our investigations (1) contribute to a deep understanding of SMO, (2) enrich the classical and fundamental theory of building blocks for genetic algorithms and memetic algorithms, and (3) provide a completive and potential solution for VRPTW.
Author supplied keywords
Cite
CITATION STYLE
Xu, W., Wang, X., Guo, Q., Song, X., Zhao, R., Zhao, G., … He, D. (2022). Gathering Strength, Gathering Storms: Knowledge Transfer via Selection for VRPTW. Mathematics, 10(16). https://doi.org/10.3390/math10162888
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.