Volume 72 | Issue 4 | Year 2026 | Article Id. IJMTT-V72I4P111 | DOI : https://doi.org/10.14445/22315373/IJMTT-V72I4P111
| Received | Revised | Accepted | Published |
|---|---|---|---|
| 27 Feb 2026 | 31 Mar 2026 | 21 Apr 2026 | 30 Apr 2026 |
Bhaskar Chatterjee, Bhawna Agrawal, Gaurav Sharma, "Optimization of Green Freight Transportation for Carbon Emission and Fuel Consumption," International Journal of Mathematics Trends and Technology (IJMTT), vol. 72, no. 4, pp. 74-82, 2026. Crossref, https://doi.org/10.14445/22315373/IJMTT-V72I4P111
[1] G.B.
Dantzig, and J.H. Ramser, “The Truck Dispatching Problem,” Management Science, vol. 6, no. 1, pp. 80-91, 1959.
[CrossRef]
[Google Scholar]
[Publisher Link]
[2] Gaurav
Sharma, S.H. Abbas, and Vijay Kumar Gupta, “Solving Transportation with the
Help of Various Methods of Linear Programming Problem,” Asian Journal of Current Engineering and Maths, pp. 81-83, 2012.
[Google Scholar]
[3] Ramë Likaj et al., “Application of Graph Theory to find Optimal Paths for the
Transportation Problem,” International
Journal f Current Engineering and Technology, vol. 3, no. 3, pp. 1099-1103,
2013.
[Google Scholar]
[Publisher Link]
[4] A.
Nagarajan, and K. Jeyaraman, “Multi-Objective
Transportation Problem with Interval Cost Coefficients Under Stochastic
Environment,” International Journal of
Computer & Organization Trends, vol. 4, no. 3, pp. 15-23, 2014. [CrossRef]
[Google Scholar]
[Publisher Link]
[5] E.W.
Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik, vol. 1, pp.
269-271, 2010.
[Google Scholar]
[Publisher Link]
[6] Boris
V. Cherkassky, Andrew V. Goldberg, and Tomasz Radzik, “Shortest Paths
Algorithms: Theory and Experimental Evaluation,” Mathematical Programming, vol. 73, no. 2, pp. 129-145, 2013.
[CrossRef]
[Google Scholar]
[Publisher Link]
[7] Jin
Y. Yen, “Finding the k Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, pp.
712-716, 2011.
[CrossRef]
[Google Scholar]
[Publisher Link]
[8] M.
Thorup, “Undirected Single-Source Shortest Paths with Positive Integer Weights
in Linear Time,” Journal of the ACM, vol.
46, no. 3, pp. 362-394, 2014.
[CrossRef]
[Google Scholar]
[Publisher Link]
[9] Camelia-M. Pintea, and Petrică C.
Pop, “An Improved Hybrid
Algorithm for Capacitated Fixed-Charge Transportation Problem,” Logic Journal of the IGPL, vol. 23,
no. 3, pp. 369-378, 2015.
[CrossRef]
[Google Scholar]
[Publisher Link]
[10] Swati Agarwal, and Shambhu Sharma, “A Minimax
Method for Time Minimizing Transportation Problem with Mixed Constraints,” International Journal of Computer &
Mathematical Sciences, vol. 7, no. 3, pp. 1-6, 2018.
[Google Scholar]
[11] Gurupada Maity, Sankar Kumar Roy,
and José Luis Verdegay, “Analyzing
Multimodal Transportation Problem and Its Application to Artificial
Intelligence,” Neural Computing and
Applications, vol. 32, pp. 2243-2256, 2020.
[CrossRef]
[Google Scholar]
[Publisher Link]
[12] Amrit Das, and Gyu M. Lee, “A Multi-Objective
Stochastic Solid Transportation Problem with the Supply, Demand, and Conveyance
Capacity Following the Weibull Distribution,” Mathematics, vol. 9, no. 15, pp. 1-21, 2021.
[CrossRef]
[Google Scholar]
[Publisher Link]
[13] Robert
Geisberger et al., “Contraction Hierarchies: Faster and Simpler Hierarchical
Routing in Road Networks,” ACM Journal on
Experimental Algorithmics, vol. 16, no. 1, pp. 1-23, 2012.
[CrossRef]
[Google Scholar]
[Publisher Link]
[14] S. Agarwal, and S. Sharma, “A Shootout Method
for Time Minimizing Transportation Problem with Mixed Constraints,” American Journal of Mathematical and
Management Sciences, vol. 39, no. 4, pp. 299-314, 2020.
[CrossRef] [Google Scholar] [Publisher Link]