Abstract
The shortest path problem (SPP) is one of the most typical and basic optimization problems in network theory for decades, and it covers a series of practical application problems, such as urban planning, logistics transportation, engineering and power grid strain analysis, etc. The circumstance where the weight of arcs in a network contains both randomness and uncertainty is considered, and the case of the weights of arcs with uncertain random variables is focused on in this paper. Here, we introduced a new model of the SPP which is based on the new definition of uncertain random variables cross entropy, and the newly established model can be used to find the path with the closest chance distribution to the ideal SP. The efficiency of this model is also evaluated in the final part.
Sign-in/Register to access full text options 
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.
