.png){kind=icon}
返回
A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: Passenger pickup algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.02.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fixed-fleet heterogeneous vehicle routing is a type of vehicle routing problem that aims to provide service to a specific customer group with minimum cost, with a limited number of vehicles with different capacities. In this study, a new intuitional algorithm, which can divide the demands at the stops for fixed heterogeneous vehicle routing, is developed and tested on tests samples. The algorithm is compared to the BATA Algorithm available in the literature in relation to the number of vehicles, fixed cost, variable cost and total cost. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
routing
algorithm
heterogeneous fleet
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Sol–gel derived nanoporous cerium oxide film for application to cholesterol biosensor溶胶-凝胶衍生的纳米多孔氧化铈薄膜在胆固醇生物传感器中的应用
PREAI
分享收藏A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem异构固定车队车辆路径问题的阈值接受元启发式
PREAI
分享收藏 没有更多内容
没有更多内容