返回
Genetic algorithm for a delivery problem with mixed time windows
DOI:10.1016/j.cie.2021.107478.png)
摘要
En 中文
This research aims to improve transportation planning decisions for a production company, which produces seasoning powder in Thailand and the logistics provider. Due to restrictions in Bangkok and its metropolitan area, the routing problem becomes one with two types of time windows. A mixed integer programming model is formulated, which aims to minimize a cost function which consists of fixed vehicle costs, variable vehicle costs and fuel costs. This approach has its limits in terms of problem size. Therefore a genetic algorithm (GA) has been developed to approximate the optimal solution. The proposed GA has a specific initialization algorithm which generates feasible random solutions. A partial factorial design of GA parameters is implemented to determine the suitable parameter values, which guide the genetic algorithm. The solution of the GA and the mixed integer programming model of the current problems were compared. The maximum optimal gap was between 0 and 0.21%, while the computational time was reduced between 67.78 and 99.45%. The results show that the planning time by a dispatcher is reduced significantly and the cost is strongly reduced, due to the fact that less vehicles are used.
Keyword:
Vehicle routing problem with time window
Mixed integer programming
Genetic algorithm
Construction heuristic
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Simulated annealing metaheuristics for the vehicle routing problem with time windows带时间窗车辆路径问题的模拟退火元启发式算法
Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法

