版权说明 操作指南
首页 > 成果 > 详情

A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Qiu, Meng;Fu, Zhuo*;Eglese, Richard;Tang, Qiong
通讯作者:
Fu, Zhuo
作者机构:
[Fu, Zhuo; Tang, Qiong; Qiu, Meng] Cent S Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China.
[Eglese, Richard] Univ Lancaster, Management Sch, Lancaster, England.
[Tang, Qiong] Hengyang Normal Univ, Coll Econ & Management, Hengyang 421008, Peoples R China.
通讯机构:
[Fu, Zhuo] C
Cent S Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China.
语种:
英文
关键词:
Discrete split;Pickup and delivery;Routing;Tabu search
期刊:
Computers & Operations Research
ISSN:
0305-0548
年:
2018
卷:
100
页码:
102-116
基金类别:
National Natural Science Foundation of China (NSFC)National Natural Science Foundation of China (NSFC) [71271220]
机构署名:
本校为其他机构
院系归属:
经济与管理学院
摘要:
The Vehicle Routing Problem with Discrete Split Deliveries and Pickups is a variant of the Vehicle Routing Problem with Split Deliveries and Pickups, in which customers’ demands are discrete in terms of batches (or orders). It exists in the practice of logistics distribution and consists of designing a least cost set of routes to serve a given set of customers while respecting constraints on the vehicles’ capacities. In this paper, its features are analyzed. A mathematical model and Tabu Search algorithm with specially designed batch combinat...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com