论文部分内容阅读
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.