A heuristic algorithm to VRP with the consideration of customers' service preference
A heuristic algorithm to VRP with the consideration of customers' service preference
复制标题
考虑客户服务偏好的VRP启发式算法
DOI：
10.1109/fskd.2014.6980822
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Jianyong Zhang
中科院分区：
文献类型：
--
作者：
Jun Yu Li;Jianyong Zhang
本文将传统的带时间窗的车辆路径问题扩展到用能够代表顾客偏好的模糊到期时间代替时间窗的情况。在对模糊到期时间和模糊车辆路径问题进行简单描述后，建立了该问题的多目标数学模型。然后，针对此类问题提出了一种基于插入启发式的混合遗传算法。在该算法中，采用改进的推-碰撞-抛过程来处理问题的模糊性质。最后，进行了广泛的计算分析，确定了不同目标之间的权衡，并通过遗传算法与改进的所罗门插入启发式算法的比较证明了遗传算法的优越性。
In this paper, The traditional vehicle routing problem with time windows is expanded to the situation that the time window is replaced by fuzzy due time which can represent the preferences of the customers. After a simple description of fuzzy due time and the fuzzy vehicle routing problem, a multi-objective mathematical model for the problem is built. Then, an insertion heuristic-based hybrid genetic algorithm is proposed to this kind of problem. In this algorithm, the modified push-bump-throw procedure is employed to handle the fuzzy nature of the problem. Finally, an extensive computational analysis is presented, which identifies the tradeoffs between the different objectives, and the superiority of the genetic algorithm is proved through the comparison of the genetic algorithms with improved Solomon insert heuristic algorithm.