2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC) 2019
DOI: 10.1109/icnsc.2019.8743322
|View full text |Cite
|
Sign up to set email alerts
|

Using Group Role Assignment to Solve Dynamic Vehicle Routing Problem

Abstract: The Dynamic Vehicle Routing Problem (DVRP) is a more complex problem than the traditional Vehicle Routing Problem (VRP) in the combinatorial optimization of operations research. With more degrees of freedom, DVRP introduces new challenges while judging the merit of a given route plan. This thesis utilized the time slice strategy to solve dynamic and deterministic routing problems. Based on Group Role Assignment (GRA) and two different routing methods (Modified Insertion heuristic routing and Modified Composite… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 81 publications
0
1
0
Order By: Relevance
“…Similarly, dynamic vehicle routing aims to minimize the cost of serving customers dispersed across various locations by updating vehicle routes as new information is received [52][53][54][55]. To address these issues, the technique of re-optimization can be employed [49,56,57], which breaks down the dynamic issue into a set of static problems and generates an initial schedule or route, then re-optimizes it at two scenarios: fixed time intervals [58][59][60][61] or real-time response to new events happens, known as event-driven re-optimization [50,52,57,62]. The time-slice method's limitation in effectively managing urgent dynamic events is due to its inability to promptly assimilate new information; thus, its utility is restricted to less timesensitive issues, including customer requests that do not have a narrow time frame [56].…”
Section: Dynamic Scheduling Problems and Dynamic Vehicle-routing Prob...mentioning
confidence: 99%
“…Similarly, dynamic vehicle routing aims to minimize the cost of serving customers dispersed across various locations by updating vehicle routes as new information is received [52][53][54][55]. To address these issues, the technique of re-optimization can be employed [49,56,57], which breaks down the dynamic issue into a set of static problems and generates an initial schedule or route, then re-optimizes it at two scenarios: fixed time intervals [58][59][60][61] or real-time response to new events happens, known as event-driven re-optimization [50,52,57,62]. The time-slice method's limitation in effectively managing urgent dynamic events is due to its inability to promptly assimilate new information; thus, its utility is restricted to less timesensitive issues, including customer requests that do not have a narrow time frame [56].…”
Section: Dynamic Scheduling Problems and Dynamic Vehicle-routing Prob...mentioning
confidence: 99%
“…Here data of travel is required at least 1 day before to design the routes and system cannot handle passenger who decides to travel at immediate. On the other hand [3] stating the complexity of Dynamic Route planning introduces new challenges while judging the merit of given dynamic route. The paper proposes O(m 3 ) to O(m 4 ) algorithm which is acceptable only for smaller net-work and fewer number of requests.…”
Section: Motivation and Related Workmentioning
confidence: 99%