The Consistent Vehicle Routing Problem

车辆路径问题 计算机科学 服务(商务) 水准点(测量) 运筹学 布线(电子设计自动化) 集合(抽象数据类型) 整数规划 整数(计算机科学) 业务 算法 计算机网络 营销 工程类 大地测量学 程序设计语言 地理
作者
Chris Groër,Bruce Golden,Edward Wasil
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:11 (4): 630-643 被引量:181
标识
DOI:10.1287/msom.1080.0243
摘要

In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time. In the paper “The Consistent Vehicle Routing Problem,” published in Manufacturing & Service Operations Management, ePub ahead of print December 4, 2008, http://dx.doi.org/10.1287/msom.1080.0243, the authors have amended the original text published online to correct an oversight in conveying the real-world problem studied in this article.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
2秒前
Polarlicht完成签到,获得积分10
3秒前
媛媛完成签到,获得积分10
3秒前
傲娇颖完成签到,获得积分10
5秒前
ShellyMaya完成签到 ,获得积分10
6秒前
7秒前
一只大憨憨猫完成签到,获得积分10
7秒前
JJ完成签到,获得积分10
7秒前
DrW完成签到,获得积分10
7秒前
隐形曼青应助yue采纳,获得10
8秒前
ccyy完成签到 ,获得积分10
8秒前
NexusExplorer应助腾腾腾采纳,获得10
9秒前
宿帅帅完成签到,获得积分10
10秒前
10秒前
Ningxin完成签到,获得积分10
10秒前
HHEHK发布了新的文献求助10
10秒前
柚子完成签到 ,获得积分10
10秒前
雨辰完成签到,获得积分10
12秒前
宿帅帅发布了新的文献求助10
12秒前
量子星尘发布了新的文献求助10
15秒前
15秒前
熠熠完成签到,获得积分10
15秒前
16秒前
zxzb完成签到,获得积分10
18秒前
苹果萧完成签到 ,获得积分10
21秒前
宋江他大表哥完成签到,获得积分10
21秒前
able发布了新的文献求助10
21秒前
王先生完成签到 ,获得积分10
22秒前
H.发布了新的文献求助10
22秒前
luoluo完成签到,获得积分10
23秒前
23秒前
高分子完成签到,获得积分10
23秒前
yian发布了新的文献求助10
24秒前
yar应助体贴凌柏采纳,获得10
25秒前
自由的雪一完成签到,获得积分10
25秒前
Ava应助李振博采纳,获得200
25秒前
JW发布了新的文献求助10
26秒前
无限的千凝完成签到 ,获得积分10
27秒前
CipherSage应助YeeYee采纳,获得10
27秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038303
求助须知:如何正确求助?哪些是违规求助? 3576013
关于积分的说明 11374210
捐赠科研通 3305780
什么是DOI,文献DOI怎么找? 1819322
邀请新用户注册赠送积分活动 892672
科研通“疑难数据库(出版商)”最低求助积分说明 815029