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.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Industrial Engineering Pub Date : 2025-02-01 DOI:10.1016/j.cie.2024.110755
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.5000,"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于q -学习和基于问题知识的协同进化算法的生鲜农产品多目标综合收获配送调度
随着人们对食品安全和饮食健康的日益关注,新鲜农产品的新鲜度和质量变得越来越重要。通过缩短供应链,农场到门的供应模式是一种很有前途的方式,可以提供高新鲜度和高质量的FAPs。这种供应模式的特点是将收获和分配一起调度,比单独调度这两个活动要复杂得多。同时做出与收获和分配阶段相关的多个决策并处理它们之间的关系以实现整体优化是具有挑战性的。这些挑战创造了对特定建模和优化方法的需求,以提高操作效率。为此,本研究提出了一个多目标综合FAP采收分配调度问题。首先,建立了最小化总运营成本和最大化客户满意度的数学模型。其次,提出了一种基于q学习的具有问题特定知识的协同进化算法(Q-CEA-K),其中种群和Pareto档案分别执行全局和局部搜索。设计了两个基于问题特定知识的启发式规则来生成初始解,并推导了五个属性,用于开发基于知识的局部搜索方法。提出了群体与帕累托档案之间的协同搜索策略。在此基础上,采用q -学习方法选择种群的搜索框架。最后,通过大量实验,将Q-CEA-K算法与三种最先进的算法和数学规划求解器CPLEX进行了比较。比较和统计分析结果证实了Q-CEA-K在解决所考虑问题方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Competing for the most profitable tour: the orienteering interdiction game A two-stage approach for collaborative scheduling of closed-loop manufacturing considering dynamic power cost: An enhanced Benders decomposition optimization Budget-scalable inference-time hybrid MCTS for enhancing DRL-based flexible job shop scheduling Integrated workforce and territory planning for home social care under variable demand A Data-Driven Multi-Objective optimization framework for dynamic job shop scheduling with order Acceptance, inventory and Energy-Aware decisions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1