摘要
讨论在物流过程中以物流距离最短为决策目标的车辆路径优化问题。充分考虑各需求客户的硬时间窗要求,以所有车辆最短物流路径总距离作为优化目标,运用运筹学方法创建了数学优化模型。针对面向任务的物资供应路径问题的优化模型的求解问题,设计了基于改进的智能蚁群算法,给出对带硬时间窗的车辆路径问题求解的基本流程。
The problem of vehicle routing optimization with the shortest logistics distance as the decision goal in the logistics process is discussed.Considering the hard time-window requirement of each demand customer,taking the total distance of the shortest logistics path of all vehicles as the optimization target,a mathematical optimization model is established by using operations research method.In view of a solution to the optimization model of the task-oriented material supply path problem,an improved intelligent ant colony algorithm is designed,and the basic flow for solving vehicle routing problems with hard time windows is provided.
作者
艾云平
AI Yunping(School of International Business,Anhui Foreign Languages University,Hefei 231201,China)
出处
《长春大学学报》
2020年第5期8-12,共5页
Journal of Changchun University
基金
安徽省教育厅高校人文社会科学研究重点项目(Sk2018A0977)
安徽省教育厅质量工程重点项目(2018jyxm0277)
安徽外国语学院校级项目(awkytd1901)。
关键词
物资供应
路径优化
决策建模
时间窗
material supply
route optimization
decision modeling
time-window
