A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a...

Area of Science:

• Operations Research
• Logistics Management
• Environmental Science

Background:

• Rising fuel costs and environmental concerns necessitate efficient logistics solutions.
• Traditional vehicle routing models do not adequately address split deliveries for cost and carbon reduction.
• The need for sustainable practices in logistics is paramount.

Purpose of the Study:

• To address the vehicle routing problem with split deliveries by backpack.
• To develop a model that economizes logistics distribution costs and promotes low-carbon logistics.
• To enhance the global optimization ability of algorithms for sustainable logistics.

Main Methods:

• A discrete split delivery model where customer demand is split only by backpack was designed.
• A double-objective mathematical model was constructed.
• An adaptive tabu search (TS) algorithm with an adaptive penalty mechanism, random neighborhood selection, and reinitialization was developed.

Main Results:

• The proposed adaptive tabu search algorithm demonstrated effectiveness in solving the vehicle routing problem with split deliveries.
• Comparisons with existing literature validated the algorithm's performance.
• The method successfully reduces logistics distribution costs and carbon emissions.

Conclusions:

• The developed approach is effective for optimizing low-carbon logistics and reducing distribution expenses.
• The algorithm contributes to sustainable development by lowering carbon emissions in logistics.
• This research provides a viable solution for economizing logistics costs and environmental impact.