IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i16p2888-d886509.html
   My bibliography  Save this article

Gathering Strength, Gathering Storms: Knowledge Transfer via Selection for VRPTW

Author

Listed:
  • Wendi Xu

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Xianpeng Wang

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China)

  • Qingxin Guo

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Xiangman Song

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Ren Zhao

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Guodong Zhao

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Yang Yang

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Te Xu

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
    Key Laboratory of Data Analytics and Optimization for Smart Industry, Northeastern University, Shenyang 110819, China
    Frontier Science Center for Industrial Intelligence and System Optimization, Northeastern University, Shenyang 110819, China)

  • Dakuo He

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)

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.

Suggested Citation

  • Wendi Xu & Xianpeng Wang & Qingxin Guo & Xiangman Song & Ren Zhao & Guodong Zhao & Yang Yang & Te Xu & Dakuo He, 2022. "Gathering Strength, Gathering Storms: Knowledge Transfer via Selection for VRPTW," Mathematics, MDPI, vol. 10(16), pages 1-17, August.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:16:p:2888-:d:886509
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/16/2888/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/16/2888/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    2. Ying-ping Chen & Chung-Yao Chuang & Yuan-Wei Huang, 2012. "Inductive linkage identification on building blocks of different sizes and types," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(12), pages 2202-2213.
    3. Ruiz, Rubén & Pan, Quan-Ke & Naderi, Bahman, 2019. "Iterated Greedy methods for the distributed permutation flowshop scheduling problem," Omega, Elsevier, vol. 83(C), pages 213-222.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kangye Tan & Weihua Liu & Fang Xu & Chunsheng Li, 2023. "Optimization Model and Algorithm of Logistics Vehicle Routing Problem under Major Emergency," Mathematics, MDPI, vol. 11(5), pages 1-18, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    2. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    3. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    4. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    5. Arshad Ali & Yuvraj Gajpal & Tarek Y. Elmekkawy, 2021. "Distributed permutation flowshop scheduling problem with total completion time objective," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 425-447, June.
    6. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    7. Xiaohui Zhang & Xinhua Liu & Shufeng Tang & Grzegorz Królczyk & Zhixiong Li, 2019. "Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm," Energies, MDPI, vol. 12(17), pages 1-24, August.
    8. Jianhui Mou & Xinyu Li & Liang Gao & Wenchao Yi, 2018. "An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 789-807, April.
    9. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    10. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    11. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 2006. "Some aspects of scatter search in the flow-shop problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 654-666, March.
    12. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    13. Pourya Pourhejazy & Chen-Yang Cheng & Kuo-Ching Ying & Nguyen Hoai Nam, 2023. "Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups," Annals of Operations Research, Springer, vol. 322(1), pages 125-146, March.
    14. Said Aqil & Karam Allali, 2021. "On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time," Annals of Operations Research, Springer, vol. 296(1), pages 615-637, January.
    15. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S. & Gupta, Jatinder N.D., 2024. "Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times," Omega, Elsevier, vol. 123(C).
    16. Ferdinand Kóča & Hana Pačaiová & Renata Turisová & Andrea Sütőová & Peter Darvaši, 2023. "The Methodology for Assessing the Applicability of CSR into Supplier Management Systems," Sustainability, MDPI, vol. 15(17), pages 1-25, September.
    17. Franzin, Alberto & Stützle, Thomas, 2023. "A landscape-based analysis of fixed temperature and simulated annealing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 395-410.
    18. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.
    19. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    20. Wang, Yuhang & Han, Yuyan & Wang, Yuting & Tasgetiren, M. Fatih & Li, Junqing & Gao, Kaizhou, 2023. "Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 311(3), pages 816-832.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:16:p:2888-:d:886509. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.