Hybrid metaheuristic optimization for multi-criteria truck–drone collaborative routing in sustainable supply chains
持続可能なサプライチェーンにおける多基準トラック・ドローン協調ルーティングのためのハイブリッドメタヒューリスティック最適化 (AI 翻訳)
M. K. N, G. M.
🤖 gxceed AI 要約
日本語
本研究は、ラストマイル物流の二酸化炭素排出削減を目的として、アリコロニー最適化とバタフライ最適化を組み合わせた新しいハイブリッドアルゴリズムを提案する。提案手法は、トラックとドローンの協調ルーティング問題において、走行距離、納期、排出量を同時に最小化し、従来の単一アルゴリズムよりも優れた性能を示した。
English
This paper proposes a novel hybrid ACO+BOA algorithm for the truck-drone collaborative routing problem, aiming to minimize distance, makespan, and carbon emissions in last-mile logistics. The hybrid approach consistently outperforms single-algorithm baselines, achieving up to 72.4% reduction in combined objective on benchmark instances.
Unofficial AI-generated summary based on the public title and abstract. Not an official translation.
📝 gxceed 編集解説 — Why this matters
日本のGX文脈において
日本の物流業界は2030年までにCO2排出量を46%削減する目標を掲げており、本研究成果は電動トラックとドローンを活用した配送最適化の実用化に寄与する可能性がある。特に、日本の都市部におけるラストマイル配送の効率化と脱炭素化に示唆を与える。
In the global GX context
This research addresses the critical challenge of decarbonizing last-mile logistics, a key focus area under global frameworks like the Paris Agreement. The hybrid optimization approach offers a scalable tool for integrating electric vehicles and drones, directly supporting emission reduction targets in urban delivery systems worldwide.
👥 読者別の含意
🔬研究者:The Hybrid ACO+BOA algorithm provides a novel optimization framework that can be extended to other multi-objective routing problems in sustainable logistics.
🏢実務担当者:Logistics planners can use this algorithm to design cost-effective and low-emission delivery networks combining electric trucks and drones.
🏛政策担当者:Policymakers can leverage the demonstrated emission reductions to support incentives for adopting drone-assisted delivery systems in urban areas.
📄 Abstract(原文)
Last-mile logistics accounts for approximately 28% of total logistics costs and is a major contributor to urban carbon emissions. The integration of drones with electric trucks offers a path toward more efficient and sustainable delivery, but the resulting Truck–Drone Collaborative Routing Problem (TDCRP) is NP-hard, combining binary customer-to-mode assignment, route sequencing, and drone sortie scheduling into a single combinatorial challenge that exact methods cannot solve at realistic instance sizes. This paper proposes a novel Hybrid ACO+BOA algorithm—the first to couple Ant Colony Optimisation (ACO) with the Butterfly Optimisation Algorithm (BOA) for any routing problem—to simultaneously minimize truck distance, delivery makespan, and carbon emissions in the TDCRP. ACO constructs 20 route sets per iteration using pheromone-heuristic guided selection. BOA refines the entire population using fragrance-scaled guided Or-opt relocation—a discrete analog of the continuous BOA position update—with greedy acceptance. Pheromone deposits are drawn from BOA-refined solutions, creating a reinforcing feedback loop. Five benchmark CVRP instances were evaluated against Pure ACO, BOA, PSO, and ABC over 20 independent runs each. A 33-configuration sensitivity analysis identified the optimal parameter set. Full non-parametric statistical validation was performed (Friedman, Nemenyi, Wilcoxon with Cohen's d ). The Hybrid achieved the lowest or statistically equivalent normalized combined objective on all five instances, with significant superiority on P-series instances. On P-n101-k4, it recorded a mean normalized objective of 0.2267 ± 0.0046—reductions of 5.2%, 63.6%, 72.4%, and 69.3% relative to ACO, BOA, PSO, and ABC, respectively. On A-series instances, the Hybrid was statistically equivalent to Pure ACO ( p >0.19), reflecting structural characteristics where short per-vehicle routes leave limited scope for BOA refinement. The Hybrid was significantly superior to BOA, PSO, and ABC on all instances ( p < 0.001, | d | = 13.7–47.8). Drone sorties were 1.9–3.1 × higher than non-ACO baselines, directly reducing fleet-level emission. Tightly coupling pheromone-guided construction with fragrance-scaled exploitation yields consistent, statistically validated improvements over all single-algorithm baselines. The algorithm provides a practical, scalable framework for sustainable last-mile logistics planning with computation times of 30–49 seconds remaining within daily scheduling horizons.
🔗 Provenance — このレコードを発見したソース
- semanticscholar https://doi.org/10.3389/frsc.2026.1798928first seen 2026-05-05 22:12:56
gxceed は公開メタデータに基づく研究支援データセットです。要約・翻訳・解説は AI 支援で生成されています。 最終的な解釈・検証は利用者が原典資料に基づいて行うことを前提とします。