Answers are grounded in this paper and cite their sources.
Given the constraints of limited storage space and unpredictable customer demand in last-mile Hyper-local Networks (HLN), optimising this process has become crucial for on-demand and same-day delivery, especially for megacities and metropolitan entrepreneurs, startups, and small firms with limited space and also to demand fulfilling e-commerce giant. To address this challenge, a novel metaheuristic algorithm called the Orthogonal Criminal Search Optimisation Algorithm (OCSOA), inspired by Criminal Search Optimisation, is introduced in this paper. The effectiveness of the algorithm is assessed through simulations of benchmark functions and a real-world problem associated with last-mile HLN. Comparative analysis reveals that OCSOA outperforms traditional optimisation methods by demonstrating robust exploration and exploitation capabilities. Through extensive testing, it emerges as the leading algorithm with a low Type II error rate in the Wilcoxon Signed Rank test. Additionally, three case studies are conducted, considering the varying levels of customer demand, and the results highlight significant performance enhancements and reduced computational time as demand increases. These simulated results contribute valuable insights into last-mile data, providing perspectives distinct from the high-cost data associated with e-commerce giants. The model also improved the necessity for convenience and cost optimality as per the end consumers' dire requirements.
No takes yet. Share an insight, caveat, or question.
Haorongbam et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: