.png){kind=icon}
返回
Generalized Maximum Benefit Multiple Chinese Postman Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2015.01.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Chinese Postman Problem (CPP)
Arc routing problems with profit
Multiple vehicle routing
Security patrolling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
The profitable arc tour problem: Solution with a branch-and-price algorithm有利可图的arc游览问题: 使用分支和价格算法的解决方案
.png){kind=icon}
PREAI
分享收藏
分享收藏Problem-Oriented Guides for Police: Problem-Specific Guides Series Guide No. 25: Identity Theft
PREAI
分享收藏
查看更多内容