Multi-objective integrated harvest and distribution scheduling for fresh agricultural products with farm-to-door requirements using Q-learning and problem knowledge-based cooperative evolutionary algorithms
IF 6.7 1区 工程技术Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
{"title":"Multi-objective integrated harvest and distribution scheduling for fresh agricultural products with farm-to-door requirements using Q-learning and problem knowledge-based cooperative evolutionary algorithms","authors":"Xiaomeng Ma , Xujin Pu , Yaping Fu","doi":"10.1016/j.cie.2024.110755","DOIUrl":null,"url":null,"abstract":"<div><div>Due to growing concerns about food safety and dietary health, the freshness and quality of fresh agricultural products (FAPs) are becoming increasingly important. The farm-to-door supply mode is a promising method for delivering FAPs with high freshness and quality by shortening supply chains. This supply mode is characterized by scheduling harvest and distribution together, which is more complex than scheduling the two activities independently. It is challenging to simultaneously make multiple decisions related to the harvest and distribution stages and handle their relationships to achieve overall optimization. These challenges create the need for particular modelling and optimization approaches to improve operation efficiency. To this end, this study proposes a multi-objective integrated FAP harvest and distribution scheduling problem. First, a mathematical model is formulated to minimize the total operation cost and maximize customer satisfaction. Second, a Q-learning-based cooperative evolutionary algorithm with problem-specific knowledge (Q-CEA-K) is developed, in which the population and Pareto archive execute global and local searches, respectively. Two heuristic rules based on problem-specific knowledge are designed to produce initial solutions, and five properties are derived and used to develop knowledge-based local search methods. Cooperative strategies are proposed to realize collaborative search between the population and Pareto archive. Furthermore, the Q-learning method is used to select a search framework for the population. Finally, Q-CEA-K is compared with three state-of-the-art algorithms and a mathematical programming solver CPLEX through extensive experiments. The comparison and statistical analysis results confirm the superiority of Q-CEA-K in solving the problem under consideration.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110755"},"PeriodicalIF":6.7000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224008775","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Due to growing concerns about food safety and dietary health, the freshness and quality of fresh agricultural products (FAPs) are becoming increasingly important. The farm-to-door supply mode is a promising method for delivering FAPs with high freshness and quality by shortening supply chains. This supply mode is characterized by scheduling harvest and distribution together, which is more complex than scheduling the two activities independently. It is challenging to simultaneously make multiple decisions related to the harvest and distribution stages and handle their relationships to achieve overall optimization. These challenges create the need for particular modelling and optimization approaches to improve operation efficiency. To this end, this study proposes a multi-objective integrated FAP harvest and distribution scheduling problem. First, a mathematical model is formulated to minimize the total operation cost and maximize customer satisfaction. Second, a Q-learning-based cooperative evolutionary algorithm with problem-specific knowledge (Q-CEA-K) is developed, in which the population and Pareto archive execute global and local searches, respectively. Two heuristic rules based on problem-specific knowledge are designed to produce initial solutions, and five properties are derived and used to develop knowledge-based local search methods. Cooperative strategies are proposed to realize collaborative search between the population and Pareto archive. Furthermore, the Q-learning method is used to select a search framework for the population. Finally, Q-CEA-K is compared with three state-of-the-art algorithms and a mathematical programming solver CPLEX through extensive experiments. The comparison and statistical analysis results confirm the superiority of Q-CEA-K in solving the problem under consideration.
期刊介绍:
Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.