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
Xiaomeng Ma , Xujin Pu , Yaping Fu
{"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 ,&nbsp;Xujin Pu ,&nbsp;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.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信