Abstract
AbstractThis article develops and implements time-dependent shortest path and assignment algorithms for vehicle routing and assignment during a no-notice evacuation. A time-dependent shortest path algorithm with arc labeling is designed to improve computer storage space efficiency. Visual Basic for Application (VBA) is used to improve time efficiency of both shortest path and assignment algorithms. Performance of the algorithms is analyzed and compared through implementation in VBA and the General Algebraic Modeling System (GAMS). Since VBA seamlessly integrates with Microsoft Excel and enables efficient data manipulation, the algorithms implemented in VBA are more efficient and obtain optimal solutions faster than those implemented in the GAMS. The shortest path algorithm with arc labeling implemented in VBA may be used for real-time vehicle routing for large road networks during no-notice evacuations.
Highlights
In a generalized vehicle routing problem (VRP), multiple vehicles travel from origins to destinations
Conclusions and future research This paper develops a new time-dependent shortest path (TDSP) algorithm with arc labeling and integrates it with the assignment algorithm to identify the optimal solution and value for the time-dependent vehicle routing problems (TDVRPs) in real time
The experiments show that the algorithms implemented in Visual Basic for Application (VBA)® may be used for real-time vehicle routing in large road networks
Summary
In a generalized vehicle routing problem (VRP), multiple vehicles travel from origins (depots; Montoya-Torres, Franco, Isaza, Jiménez, & Herazo-Padilla, 2015) to destinations (demand points). One of the objectives of the VRP is to minimize total travel time or the latest arrival time for a fleet of vehicles while meeting demand at destinations. Research on the VRP stemmed from the traveling salesman problem (Dantzig, Fulkerson, & Johnson, 1954) and was further developed in some early applications (Balas & Toth, 1985; Clarke & Wright, 1964; Haimovich, Rinnooy Kan, & Stougie, 1988; Laporte, Nobert, & Taillefer, 1987). Most early studies assumed vehicle travel time between two nodes was static and did not change regardless of traffic. Travel time between two nodes may be described as a function of the node and time at which a vehicle begins to travel and the node at which the vehicle plans to arrive
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
