返回
An improved multiobjective evolutionary algorithm for time-dependent vehicle routing problem with time windows
DOI:10.1016/j.eij.2024.100574.png)
摘要
En 中文
Time-dependent vehicle routing problem with time windows (TDVRPTW) is a pivotal problem in logistics domain. In this study, a special case of TDVRPTW with temporal-spatial distance (TDVRPTW-TSD) is investigated, which objectives are to minimize the total travel time and maximize customer satisfaction while satisfying the vehicle capacity. To address it, an improved multiobjective evolutionary algorithm (IMOEA) is developed. In the proposed algorithm, a hybrid initialization strategy with two efficient heuristics considering temporal-spatial distance is designed to generate high-quality and diverse initial solutions. Then, two crossover operators are devised to broaden the exploration space. Moreover, an efficient local search heuristic combing the adaptive large neighborhood search (ALNS) and the variable neighborhood descent (VND) is developed to improve the exploration capability. Finally, detailed comparisons with several state-of-the-art algorithms are tested on a set of instances, which verify the efficiency and effectiveness of the proposed IMOEA.
Keyword:
Vehicle routing problem
Time dependent
Time windows
Multiobjective optimization
Temporal-spatial distance
期刊
IF:
4.3
论文数:
786
被引数:
1.4K
机构
引用论文
An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information实时信息下动态车辆路径问题的面向对象评价框架
Robust vehicle routing problem with hard time windows under demand and travel time uncertainty需求和出行时间不确定性下具有硬时间窗的鲁棒车辆路径问题
A Multi Ant System based hybrid heuristic algorithm for Vehicle Routing Problem with Service Time Customization基于多蚂蚁系统的混合启发式算法求解具有服务时间定制的车辆路径问题

