Standard

Incremental rerouting algorithm for single-vehicle VRPPD. / Guralnik, Roman.

Computer Systems and Technologies: 18th International Conference, CompSysTech 2017 - Proceedings. Том Part F132086 Association for Computing Machinery, 2017. стр. 44-51.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Guralnik, R 2017, Incremental rerouting algorithm for single-vehicle VRPPD. в Computer Systems and Technologies: 18th International Conference, CompSysTech 2017 - Proceedings. Том. Part F132086, Association for Computing Machinery, стр. 44-51, 18th International Conference on Computer Systems and Technologies, CompSysTech 2017, Ruse, Болгария, 22/06/17. https://doi.org/10.1145/3134302.3134326

APA

Guralnik, R. (2017). Incremental rerouting algorithm for single-vehicle VRPPD. в Computer Systems and Technologies: 18th International Conference, CompSysTech 2017 - Proceedings (Том Part F132086, стр. 44-51). Association for Computing Machinery. https://doi.org/10.1145/3134302.3134326

Vancouver

Guralnik R. Incremental rerouting algorithm for single-vehicle VRPPD. в Computer Systems and Technologies: 18th International Conference, CompSysTech 2017 - Proceedings. Том Part F132086. Association for Computing Machinery. 2017. стр. 44-51 https://doi.org/10.1145/3134302.3134326

Author

Guralnik, Roman. / Incremental rerouting algorithm for single-vehicle VRPPD. Computer Systems and Technologies: 18th International Conference, CompSysTech 2017 - Proceedings. Том Part F132086 Association for Computing Machinery, 2017. стр. 44-51

BibTeX

@inproceedings{93135eb06e0f41d88c68a262f60c1189,
title = "Incremental rerouting algorithm for single-vehicle VRPPD",
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.",
keywords = "DARP, Incremental rerouting, Vehicle routing problem",
author = "Roman Guralnik",
year = "2017",
month = jun,
day = "23",
doi = "10.1145/3134302.3134326",
language = "English",
volume = "Part F132086",
pages = "44--51",
booktitle = "Computer Systems and Technologies",
publisher = "Association for Computing Machinery",
address = "United States",
note = "18th International Conference on Computer Systems and Technologies, CompSysTech 2017 ; Conference date: 22-06-2017 Through 23-06-2017",

}

RIS

TY - GEN

T1 - Incremental rerouting algorithm for single-vehicle VRPPD

AU - Guralnik, Roman

PY - 2017/6/23

Y1 - 2017/6/23

N2 - 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.

AB - 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.

KW - DARP

KW - Incremental rerouting

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=85038419538&partnerID=8YFLogxK

U2 - 10.1145/3134302.3134326

DO - 10.1145/3134302.3134326

M3 - Conference contribution

AN - SCOPUS:85038419538

VL - Part F132086

SP - 44

EP - 51

BT - Computer Systems and Technologies

PB - Association for Computing Machinery

T2 - 18th International Conference on Computer Systems and Technologies, CompSysTech 2017

Y2 - 22 June 2017 through 23 June 2017

ER -

ID: 26266632