Finding the most eco-reliable path in dynamic and stochastic network: a Lagrangian relaxation-based approach
A eco-reliable path is defined to show reliability and sustainability in ecological shortest path problem.A 0-1 integer programming is formulated,in which the objective function is to minimize the probability of late arrival,and a least expected emission constraint is also added into the formulation.By Lagrangian relaxation approach,the primal model is relaxed into a dualized model which would be further decomposed into three sub-problems.The sub-gradient method is developed to reduce gaps between upper and lower bounds.Finally,a numerical experiments for real-world transportation network are implemented to demonstrate the efficiency and effectiveness of our proposed model and algorithms.
the most eco-reliable path dynamic and stochastic network random and time-dependent link travel time random and time-dependent link emission Lagrangian relaxation approach
Wenjie Li Lixing Yang Li Wang
State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,Beijing,100044,China
国内会议
福州
英文
1-6
2015-12-11（万方平台首次上网日期，不代表论文的发表时间）