PSO-Augmented NSGA-III Algorithm: A Combined Optimization Approach to Heterogeneous Vehicle Routing and Bin Packing Problems
Open Access
- 1 October 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 153497-153518
Abstract
This study presents an Integrated Particle Swarm Optimization and Nondominated Sorting Genetic Algorithm III (IPSO-NSGA-III) to address the combined optimization challenges in logistics enterprises of heterogeneous vehicle routing and bin packing. The algorithm is designed to optimize four critical performance metrics: travel distance, time penalty costs, vehicle loading efficiency, and fixed vehicle costs. By enhancing vehicle routing and bin packing strategies, the approach targets the reduction of logistics distribution costs and increases in vehicle loading rates, ultimately enhancing the cost-effectiveness of distribution operations. The performance of IPSO-NSGA-III is rigorously evaluated through multi-objective function testing and a detailed case study, where it is compared against other leading-edge algorithms. The case study results show that, the IPSO-NSGA-III outperforms the NSGA-III by delivering more effective solutions that consider the interplay between vehicle routing and bin packing. The optimized solutions facilitate a decrease in operational expenses and an improvement in logistics efficiency, which translates to higher customer satisfaction and stronger competitiveness for logistics companies.Keywords
Funding Information
- Key project of the Natural Science Foundation of Fujian Province, China (2022J02053)
- 2023 Graduate Science and Technology Innovation Program Project of Xiamen University of Technology (YKJCX2023035)
This publication has 40 references indexed in Scilit:
- An enhanced neighborhood search algorithm for solving the split delivery vehicle routing problem with two-dimensional loading constraintsComputers & Industrial Engineering, 2021
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split deliveryComputers & Operations Research, 2021
- Multi-objective vehicle routing and loading with time window constraints: a real-life applicationAnnals of Operations Research, 2019
- Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraintsEURO Journal on Transportation and Logistics, 2016
- Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrierComputers & Industrial Engineering, 2015
- Vehicle routing problems with loading constraints: state-of-the-art and future directionsOR Spectrum, 2014
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleetAnnals of Operations Research, 2014
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windowsCentral European Journal of Operations Research, 2011
- Ant colony optimization for the two-dimensional loading vehicle routing problemComputers & Operations Research, 2009
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraintsNetworks, 2007