Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Gitae | - |
dc.contributor.author | Ong, Yew Soon | - |
dc.contributor.author | Cheong, Taesu | - |
dc.contributor.author | Tan, Puay Siew | - |
dc.date.accessioned | 2021-09-03T21:44:22Z | - |
dc.date.available | 2021-09-03T21:44:22Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2016-08 | - |
dc.identifier.issn | 1524-9050 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/88016 | - |
dc.description.abstract | This paper proposes a dynamic vehicle routing problem (DVRP) model with nonstationary stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel time between two nodes, particularly in a city, may not be proportional to distance and changes both dynamically and stochastically over time. Considering this environment, we propose a Markov decision process model to solve this problem and adopt a rollout-based approach to the solution, using approximate dynamic programming to avoid the curse of dimensionality. We also investigate how to estimate the probability distribution of travel times of arcs which, reflecting reality, are considered to consist of multiple road segments. Experiments are conducted using a real-world problem faced by Singapore logistics/delivery company and authentic road traffic information. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | SOFT TIME WINDOWS | - |
dc.subject | REAL-TIME | - |
dc.subject | SHORTEST PATHS | - |
dc.subject | NETWORK | - |
dc.subject | ALGORITHMS | - |
dc.title | Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cheong, Taesu | - |
dc.identifier.doi | 10.1109/TITS.2016.2521779 | - |
dc.identifier.scopusid | 2-s2.0-84984984850 | - |
dc.identifier.wosid | 000381456400024 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, v.17, no.8, pp.2367 - 2380 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS | - |
dc.citation.volume | 17 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 2367 | - |
dc.citation.endPage | 2380 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Transportation | - |
dc.relation.journalWebOfScienceCategory | Engineering, Civil | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Transportation Science & Technology | - |
dc.subject.keywordPlus | SOFT TIME WINDOWS | - |
dc.subject.keywordPlus | REAL-TIME | - |
dc.subject.keywordPlus | SHORTEST PATHS | - |
dc.subject.keywordPlus | NETWORK | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Dynamic vehicle routing problem | - |
dc.subject.keywordAuthor | approximate dynamic programming | - |
dc.subject.keywordAuthor | uncertain travel times | - |
dc.subject.keywordAuthor | rollout algorithm | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.