Many objective test suite for perishable goods distribution with product-specific perishability models

IF 9.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Swarm and Evolutionary Computation Pub Date : 2026-10-01 Epub Date: 2026-10-03 DOI:10.1016/j.swevo.2026.102555
Member Joy Usigbe, Alok Singh, Yushin Ha, Rammohan Mallipeddi
{"title":"Many objective test suite for perishable goods distribution with product-specific perishability models","authors":"Member Joy Usigbe,&nbsp;Alok Singh,&nbsp;Yushin Ha,&nbsp;Rammohan Mallipeddi","doi":"10.1016/j.swevo.2026.102555","DOIUrl":null,"url":null,"abstract":"<div><div>Perishable goods distribution (PGD) systems operate under tightly coupled routing, scheduling, refrigeration, and product-quality constraints, making them among the most challenging classes of multi-objective vehicle routing problems. Despite the growing application of Multi-Objective Evolutionary Algorithms (MOEAs) to cold-chain logistics, the absence of benchmark test suites that simultaneously capture the structural complexity of real-world perishable goods networks continues to limit rigorous algorithm design, evaluation and fair comparative analysis. Existing routing benchmarks often neglect critical characteristics such as heterogeneous perishability behavior, asymmetric spatial clustering, time-critical delivery framework, route-position-dependent quality degradation, and product incompatibility constraints, resulting in simplified optimization landscapes that insufficiently model practical cold-chain operations. This study proposes a structured multi-objective benchmark test suite with 15 PGD instances generated through a customer-type-driven framework with explicitly controlled structural properties and difficulty characteristics to address this gap. The proposed test suite integrates demand heterogeneity, temporal feasibility pressure, multi-source incompatibility relationships, specific quality loss dynamics, and diverse spatial topologies to evaluate the performance of MOEAs under realistic cold-chain conditions. The representative state-of-the-art MOEAs are evaluated across conflicting objectives and constraints. Experimental analyses and results show performance variations across instances, thereby providing a scalable and structurally diverse benchmark test suite with baseline performance. This study provides a foundation for the development, evaluation, and reproducible comparison of future optimization methods for sustainable and efficient PGD systems.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"109 ","pages":"Article 102555"},"PeriodicalIF":9.6000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650226002750","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/10/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Perishable goods distribution (PGD) systems operate under tightly coupled routing, scheduling, refrigeration, and product-quality constraints, making them among the most challenging classes of multi-objective vehicle routing problems. Despite the growing application of Multi-Objective Evolutionary Algorithms (MOEAs) to cold-chain logistics, the absence of benchmark test suites that simultaneously capture the structural complexity of real-world perishable goods networks continues to limit rigorous algorithm design, evaluation and fair comparative analysis. Existing routing benchmarks often neglect critical characteristics such as heterogeneous perishability behavior, asymmetric spatial clustering, time-critical delivery framework, route-position-dependent quality degradation, and product incompatibility constraints, resulting in simplified optimization landscapes that insufficiently model practical cold-chain operations. This study proposes a structured multi-objective benchmark test suite with 15 PGD instances generated through a customer-type-driven framework with explicitly controlled structural properties and difficulty characteristics to address this gap. The proposed test suite integrates demand heterogeneity, temporal feasibility pressure, multi-source incompatibility relationships, specific quality loss dynamics, and diverse spatial topologies to evaluate the performance of MOEAs under realistic cold-chain conditions. The representative state-of-the-art MOEAs are evaluated across conflicting objectives and constraints. Experimental analyses and results show performance variations across instances, thereby providing a scalable and structurally diverse benchmark test suite with baseline performance. This study provides a foundation for the development, evaluation, and reproducible comparison of future optimization methods for sustainable and efficient PGD systems.
许多针对易腐货物分布的客观测试套件具有特定于产品的易腐模型
易腐货物配送(PGD)系统在紧密耦合的路线、调度、冷藏和产品质量约束下运行,使其成为多目标车辆路线问题中最具挑战性的一类。尽管多目标进化算法(moea)在冷链物流中的应用越来越多,但缺乏能够同时捕捉现实世界易腐货物网络结构复杂性的基准测试套件,这继续限制了严格的算法设计、评估和公平的比较分析。现有的路线基准通常忽略了关键特征,如异构易腐性行为、不对称空间聚类、时间关键交付框架、路线位置相关的质量退化和产品不兼容性约束,导致优化景观简化,无法充分模拟实际冷链操作。本研究提出了一个结构化的多目标基准测试套件,其中包含15个PGD实例,通过客户类型驱动的框架生成,具有明确控制的结构属性和难度特征,以解决这一差距。提出的测试套件集成了需求异质性、时间可行性压力、多源不兼容关系、特定质量损失动态和不同空间拓扑,以评估moea在现实冷链条件下的性能。在相互冲突的目标和约束条件下评估具有代表性的最先进的moea。实验分析和结果显示了跨实例的性能变化,从而提供了具有基线性能的可伸缩和结构多样化的基准测试套件。该研究为未来可持续高效PGD系统优化方法的开发、评价和可重复性比较提供了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书