A cuckoo search algorithm to improve a routing problem adapted to last mile e-commerce logistics

The rapid growth of e-commerce as an alternative to traditional face-to-face commerce has highlighted the logistical challenges of efficiently delivering goods to end consumers. A major problem is that recipients are often not available at the designated delivery locations during the delivery process, leading to reduced efficiency in last-mile logistics. This research works on a novel last-mile logistics framework where customers can provide multiple delivery points with different time windows. This logistical challenge represents a new and more complex variant of the vehicle routing problem with time windows. To address this problem, we present a metaheuristic approach using the cuckoo search algorithm.The results demonstrate that cuckoo search algorithm improves the costs on previous results achieved by other methodologies, allowing for greater efficiency in last-mile logistics planning.