{"title":"K-Objective Time-Varying Shortest Path Problem with Zero Waiting Times at Vertices","authors":"G. Shirdel, H. Rezapour","doi":"10.3923/TASR.2015.278.285","DOIUrl":null,"url":null,"abstract":"This study considers a k-objective time-varying shortest path problem, which cannot be combined into a single overall objective. In this problem, the transit cost to traverse an arc is varying over time, which depend upon the departure time at the beginning vertex of the arc. An algorithm is presented for finding the efficient solutions of problem and its complexity of algorithm is analyzed. Finally, an illustrative example is also provided to clarify the problem.","PeriodicalId":23261,"journal":{"name":"Trends in Applied Sciences Research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Trends in Applied Sciences Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3923/TASR.2015.278.285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This study considers a k-objective time-varying shortest path problem, which cannot be combined into a single overall objective. In this problem, the transit cost to traverse an arc is varying over time, which depend upon the departure time at the beginning vertex of the arc. An algorithm is presented for finding the efficient solutions of problem and its complexity of algorithm is analyzed. Finally, an illustrative example is also provided to clarify the problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
