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, Alok Singh, Yushin Ha, 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.
期刊介绍:
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.