Skip to content
Review Open access

A TWO-LEVEL MULTI-OBJECTIVE MODEL AND SIMULATED ANNEALING METAHEURISTIC FOR COST, CO2 EMISSION, AND CUSTOMER SATISFACTION OPTIMIZATION IN LAST-MILE DELIVERY

2026 · Pesquisa Operacional · 0 citations · 16 references

Abstract

ABSTRACT Last-mile delivery-the final and most critical stage of fulfilling customer orders-is typically the most costly and time-consuming component of the distribution process. Optimizing this stage is therefore essential for improving the overall efficiency and sustainability of logistics operations. This study begins with a comprehensive review of the principal contributions to last-mile delivery optimization. Building on insights from existing models and metaheuristics, we propose a new two-level framework in which customers are served through distribution centers, ensuring that each customer location lies within a designated coverage area. The framework consists of two interconnected levels: depot to distribution center routing and distribution center to customer delivery. To support this structure, we develop a new optimization model and a Simulated Annealing-based metaheuristic inspired by the vehicle routing problem with time windows and tailored specifically to last-mile customer service operations. Computational results demonstrate that the proposed approach provides both economic benefits-through reduced travel distance-and environmental advantages through lower CO2 emissions. Moreover, the routing plan generated at the second level allows for the quantification of customer satisfaction-averaging 72.5% for the optimization model and 100% for the metaheuristic-thereby providing a more comprehensive and robust evaluation of delivery.

Read PDF

Similar papers

Open access 2026

From Feasibility to Multi-Criteria Optimization in Service Team Transport Scheduling: A Declarative and Metaheuristic Perspective

The scalability of a multi-criteria optimization for the Service Team Transport Scheduling (STTS) problem is investigated, minimizing total travel time, maximum vehicle worktime, and total vehicle engagement time to define scale-aware algorithmic boundaries essential for real-time decision support systems.

Jarosław Rudy, G. Radzki · 0 citations
Open access Sep 2026

A Three-Stage Hierarchical Framework Using Hybrid Genetic Algorithm for Logistics Optimization in Multi-Item and Multi-Vehicle Environments

This study addresses the logistics optimization problem in multi-supply, multi-demand, multi-item, and multi-vehicle environments, modeled directly on the structure and constraints of an actual logistics field operation rather than on a generic combinatorial abstraction. The research objective is to minimize logistics...

Jaeyoung Shim, Myoungjin Choi · 0 citations
Open access Aug 2026

A Hybrid Algorithm Approach to Designing a Three-Echelon Supply Chain Network Model

This study addresses a large-scale location–allocation problem in a three-echelon automotive supply chain comprising 382 suppliers, candidate distribution centers, and six assembly plants. The planning task is to redesign the inbound consolidation network while minimizing transportation and distribution center operatin...

Xu-Yang Wang, Wen-Fei Zhang, Shu-Hai Fan · 0 citations
Sep 2026

A Hybrid Evolutionary Algorithm for Time-Dependent Green Vehicle Routing Problem with Time Windows and Route Balancing in Cold Chain.

This paper focuses on the cold chain logistics and proposes a multi-objective Vehicle Routing Problem (VRP) model that seeks to minimize the total cost of cold chain logistics and maximize the fairness of employees' workloads. This model first incorporates carbon emissions into the cost structure, and also discretely c...

Jian-Hao Xu, Zhuang Yang, Yang Wang · 0 citations
Open access Sep 2026

Performance Comparison Among Classical Metaheuristic Algorithms for Stochastic Last-Mile Delivery Routing Problem

Last-mile delivery routing requires simultaneous control of distance, travel time, service deadlines, vehicle capacity, workload balance, operating cost, emissions, and uncertainty. This study provides a controlled low-budget comparison of ten classical metaheuristics for a LaDe-calibrated stochastic CVRPTW. The GA, DE...

B. Thango, O. Omoruyi · 0 citations
Open access Oct 2026

A Hybrid Metaheuristic for Bin Packing Problem with Conflicts and Item-Dependent Bin Costs

This paper investigates a new transportation problem arising in automotive parts milk-run logistics under a business contract in which the payment for each vehicle is determined by the maximum direct shipment cost among its assigned suppliers, plus a fixed stop-off charge for each additional supplier. The company deter...

Wei Xiao, Yu-Miao Huang, Si-Ping Min et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.