.png){kind=icon}
返回
A genetic algorithm for the simultaneous delivery and pickup problems with time window
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.08.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper concerns a Simultaneous Delivery and Pickup Problem with Time Windows (SDPPTW). A mixed binary integer programming model was developed for the problem and was validated. Due to its NP nature, a co-evolution genetic algorithm with variants of the cheapest insertion method was proposed to speed up the solution procedure. Since there were no existing benchmarks, this study generated some test problems which revised from the well-known Solomon's benchmark for Vehicle Routing Problem with Time Windows (VRPTW). From the comparison with the results of Cplex software and the basic genetic algorithm, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Bi-directional logistics
Simultaneous delivery and pickup
Vehicle routing problem with time windows
Co-evolution genetic algorithm
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls一种用于具有回程的大型车辆路径问题的统一启发式方法
OAAI
.png){kind=icon}
OAAI分享收藏Lasso solution strategies for the vehicle routing problem with pickups and deliveries带有提货和送货的车辆路径问题的Lasso解决方案策略
PREAI
分享收藏分享收藏分享收藏
查看更多内容