Abstract
Due to its complexity, modeling of the transportation network involves a very large number of node choices for completion of a travel route. Conventional route choice models approach this problem from the mathematical point of view. In this paper, a System‐of‐Systems approach is used to model a Personal Air Vehicle (PAV) network, and a traveler's route choice model in a multi‐leg travel scenario is proposed. Both the network and route choice model are designed using Object‐Oriented (OO) programming techniques eliminating the usage of complicated matrix calculations as in many other mathematical models. The practical limitations of the shortest path problem are not usually in the solution itself, but in the application of it in the simulation environment. This paper also covers some of the most important concepts of the Traveling Salesman Problem (TSP) and an idea to tackle TSP is suggested with a modified model.
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.
