单车辆VRPPD的增量重路由算法

Proceedings of the 18th International Conference on Computer Systems and Technologies Pub Date : 2017-06-23 DOI:10.1145/3134302.3134326

R. Guralnik

{"title":"单车辆VRPPD的增量重路由算法","authors":"R. Guralnik","doi":"10.1145/3134302.3134326","DOIUrl":null,"url":null,"abstract":"Transportation of goods and transportation of persons routing algorithms are extensively studied since early 80's as a subtype of a Traveling Salesman Problem. This subtype includes VRPPD (Vehicle Routing Problem with Pickup and Delivery), courier systems and DARP (dial-a-ride problem). But for these systems to be effective in real world situations, they have to react quickly and efficiently to unexpected circumstances like dense traffic or road closing. With this in mind we developed an incremental rerouting algorithm which modifies initial solution route according to the new traffic conditions.","PeriodicalId":131196,"journal":{"name":"Proceedings of the 18th International Conference on Computer Systems and Technologies","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Incremental Rerouting Algorithm for single-vehicle VRPPD\",\"authors\":\"R. Guralnik\",\"doi\":\"10.1145/3134302.3134326\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transportation of goods and transportation of persons routing algorithms are extensively studied since early 80's as a subtype of a Traveling Salesman Problem. This subtype includes VRPPD (Vehicle Routing Problem with Pickup and Delivery), courier systems and DARP (dial-a-ride problem). But for these systems to be effective in real world situations, they have to react quickly and efficiently to unexpected circumstances like dense traffic or road closing. With this in mind we developed an incremental rerouting algorithm which modifies initial solution route according to the new traffic conditions.\",\"PeriodicalId\":131196,\"journal\":{\"name\":\"Proceedings of the 18th International Conference on Computer Systems and Technologies\",\"volume\":\"1997 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 18th International Conference on Computer Systems and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3134302.3134326\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th International Conference on Computer Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3134302.3134326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

货物运输和人员运输的路由算法作为旅行推销员问题的一个子类自80年代初以来得到了广泛的研究。该子类型包括VRPPD(车辆路线问题与取货和交付)，快递系统和DARP(拨号乘车问题)。但要使这些系统在现实世界中发挥作用，它们必须对交通拥挤或道路封闭等意外情况做出快速有效的反应。考虑到这一点，我们开发了一种增量重路由算法，该算法根据新的交通条件修改初始解决方案路由。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Incremental Rerouting Algorithm for single-vehicle VRPPD

Transportation of goods and transportation of persons routing algorithms are extensively studied since early 80's as a subtype of a Traveling Salesman Problem. This subtype includes VRPPD (Vehicle Routing Problem with Pickup and Delivery), courier systems and DARP (dial-a-ride problem). But for these systems to be effective in real world situations, they have to react quickly and efficiently to unexpected circumstances like dense traffic or road closing. With this in mind we developed an incremental rerouting algorithm which modifies initial solution route according to the new traffic conditions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 18th International Conference on Computer Systems and Technologies

自引率

0.00%

发文量