福建电脑2025,Vol.41Issue(6):11-17,7.DOI:10.16707/j.cnki.fjpc.2025.06.003
混合优化算法求解动态需求的车辆路径问题
Hybrid Optimization Algorithm For Vehicle Routing Problem With Dynamic Demand
张维维 1刘晓轩1
作者信息
- 1. 商丘工学院信息与电子工程学院 河南 商丘 476000
- 折叠
摘要
Abstract
In order to solve the dynamic customer demand problem in the supplier's delivery process,this paper proposes a vehicle path planning method that comprehensively considers carbon emissions and customer satisfaction.Applying a hybrid optimization algorithm to solve vehicle path planning,a two-stage model of"pre optimization+real-time optimization"is adopted by constructing a multi-objective function.Pre optimization is based on the greedy insertion method of simulated annealing algorithm,while real-time optimization combines dynamic information and uses multiple neighborhood search operators to optimize sub paths.The experiment confirmed the effectiveness of the method proposed in this paper.关键词
车辆路径问题/动态需求/客户满意度/碳排放Key words
Vehicle Routing Problem/Dynamic Demand/Customer Satisfaction/Carbon Emission分类
计算机与自动化引用本文复制引用
张维维,刘晓轩..混合优化算法求解动态需求的车辆路径问题[J].福建电脑,2025,41(6):11-17,7.