CTPATH: A Real World System to Enable Green Transportation by Optimizing Environmentaly Friendly Routing Paths

[1]  Jie Zhang,et al.  Finding the Shortest Path in Stochastic Vehicle Routing: A Cardinality Minimization Approach , 2016, IEEE Transactions on Intelligent Transportation Systems.

[2]  Andrés L. Medaglia,et al.  An exact method for the biobjective shortest path problem for large-scale road networks , 2015, Eur. J. Oper. Res..

[3]  Michele Amoretti,et al.  Advanced Technologies for Intelligent Transportation Systems , 2014, Intelligent Systems Reference Library.

[4]  Peter Sanders,et al.  Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates , 2014, SEA.

[5]  M. I. Amran,et al.  Minimizing travel claims cost with minimal-spanning tree model , 2014 .

[6]  Chao Yang,et al.  Solving Road-Network Congestion Problems by a Multi-objective Optimization Algorithm with Brownian Agent Model , 2013, PAAMS.

[7]  Mohamad Abdul-Hak,et al.  Dynamic Eco-Routing Methodology Using Petri Net , 2013 .

[8]  Daniel Krajzewicz,et al.  Recent Development and Applications of SUMO - Simulation of Urban MObility , 2012 .

[9]  Keivan Ghoseiri,et al.  An ant colony optimization algorithm for the bi-objective shortest path problem , 2010, Appl. Soft Comput..

[10]  Léon J. M. Rothkrantz,et al.  Travel time prediction for dynamic routing using Ant Based Control , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[12]  S. Hausberger.  Emission Factors from the Model PHEM for the HBEFA Version 3 , 2009 .

[13]  Jacques Teghem.  Multi-objective Combinatorial Optimization , 2009, Encyclopedia of Optimization.

[14]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[15]  Paolo Serafini,et al.  Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[16]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[17]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.