清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

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秒前
17秒前
喵叽发布了新的文献求助10
23秒前
桐桐应助喵叽采纳,获得10
54秒前
平平平平完成签到 ,获得积分10
59秒前
rockyshi完成签到 ,获得积分10
1分钟前
1分钟前
新新新新新发顶刊完成签到 ,获得积分10
1分钟前
科目三应助科研通管家采纳,获得10
1分钟前
柚子完成签到 ,获得积分20
1分钟前
柚子关注了科研通微信公众号
1分钟前
猪嗝铁铁完成签到,获得积分10
1分钟前
文静如南完成签到 ,获得积分10
2分钟前
003完成签到,获得积分10
2分钟前
2分钟前
2分钟前
无悔完成签到 ,获得积分10
2分钟前
001完成签到,获得积分10
2分钟前
3分钟前
3分钟前
喵叽发布了新的文献求助10
3分钟前
锅包肉完成签到 ,获得积分10
3分钟前
002完成签到,获得积分10
3分钟前
3分钟前
科研通AI2S应助科研通管家采纳,获得10
3分钟前
CodeCraft应助科研通管家采纳,获得10
3分钟前
Sandy完成签到,获得积分0
3分钟前
小白菜完成签到 ,获得积分10
3分钟前
3分钟前
digger2023完成签到 ,获得积分10
4分钟前
史琛完成签到,获得积分20
4分钟前
4分钟前
4分钟前
WenJun完成签到,获得积分10
5分钟前
5分钟前
5分钟前
科目三应助科研通管家采纳,获得10
5分钟前
科目三应助科研通管家采纳,获得10
5分钟前
史琛发布了新的文献求助10
5分钟前
乒坛巨人完成签到 ,获得积分10
5分钟前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Technical Brochure TB 814: LPIT applications in HV gas insulated switchgear 1000
Immigrant Incorporation in East Asian Democracies 600
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
A Preliminary Study on Correlation Between Independent Components of Facial Thermal Images and Subjective Assessment of Chronic Stress 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3968504
求助须知:如何正确求助?哪些是违规求助? 3513331
关于积分的说明 11167297
捐赠科研通 3248697
什么是DOI,文献DOI怎么找? 1794417
邀请新用户注册赠送积分活动 875030
科研通“疑难数据库(出版商)”最低求助积分说明 804664