An improved discrete particle swarm optimization approach for a multi-objective optimization model of an urban logistics distribution network considering traffic congestion

被引:4
作者
Li, K. [1 ]
Li, D. [1 ]
Ma, H. Q. [2 ]
机构
[1] Shanghai Lixin Univ Accounting & Finance, Sch Business Adm, Shanghai, Peoples R China
[2] Shanghai Inst Visual Arts, Human Resources Dept, Shanghai, Peoples R China
来源
ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT | 2023年 / 18卷 / 02期
关键词
Urban logistics distribution network; Traffic congestion; Optimization; Modelling; Multi-objective optimization; Vehicle routing problem (VRP); Swarm intelligence; Discrete particle swarm optimization algorithm (DPSO); VEHICLE-ROUTING PROBLEM; GENETIC ALGORITHM; EMISSION MODELS; SEARCH; ROAD; FUEL;
D O I
10.14743/apem2023.2.468
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
To optimize urban logistics networks, this paper proposes a multi-objective optimization model for urban logistics distribution networks (ULDN). The model optimizes vehicle usage costs, transportation costs, penalty costs for failing to meet time windows, and carbon emission costs, while also considering the impact of urban road traffic congestion on total costs. To solve the model, a DPSO (Discrete Particle Swarm Optimization) algorithm based on the basic principle of PSO (Particle Swarm Optimization) is proposed. The DPSO introduces multiple populations to handle multiple targets and uses a variable neighbourhood search strategy to improve the search ability of particles, which helps to improve the local search ability of the algorithm. Simulation results demonstrate the effectiveness of the proposed model in avoiding traffic congestion, reducing carbon emissions costs, and time penalty costs. The optimization comparison results between DPSO and PSO also verify the superiority of the DPSO algorithm. The proposed model can be applied to real-world urban logistics networks to improve their efficiency, reduce costs, and minimize environmental impact.
引用
收藏
页码:211 / 224
页数:14
相关论文
共 41 条
[1]   An exact approach for the consistent vehicle routing problem (ConVRP) [J].
Barros, L. ;
Linfati, R. ;
Escobar, J. W. .
ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT, 2020, 15 (03) :255-266
[2]   Faster rollout search for the vehicle routing problem with stochastic demands and restocking [J].
Bertazzi, Luca ;
Secomandi, Nicola .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (02) :487-497
[3]   Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm [J].
Cimen, Mustafa ;
Soysal, Mehmet .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2017, 54 :82-98
[4]   A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints [J].
Contardo, Claudio ;
Martinelli, Rafael .
DISCRETE OPTIMIZATION, 2014, 12 :129-146
[5]  
Dabic-Miletic S., 2023, J Industrial Intell, V1, P55, DOI 10.56578/jii010104
[6]   THE TRUCK DISPATCHING PROBLEM [J].
DANTZIG, GB ;
RAMSER, JH .
MANAGEMENT SCIENCE, 1959, 6 (01) :80-91
[7]   A comparative analysis of several vehicle emission models for road freight transportation [J].
Demir, Emrah ;
Bektas, Tolga ;
Laporte, Gilbert .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2011, 16 (05) :347-357
[8]   Vehicle routing to minimize time-dependent emissions in urban areas [J].
Ehmke, Jan Fabian ;
Campbell, Ann Melissa ;
Thomas, Barrett W. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (02) :478-494
[9]   The split delivery vehicle routing problem with minimum delivery amounts [J].
Gulczynski, Damon ;
Golden, Bruce ;
Wasil, Edward .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (05) :612-626
[10]   A three-dimensional ant colony optimization algorithm for multi-compartment vehicle routing problem considering carbon emissions [J].
Guo, Ning ;
Qian, Bin ;
Na, Jing ;
Hu, Rong ;
Mao, Jian-Lin .
APPLIED SOFT COMPUTING, 2022, 127