Login / Register Submit Your Article
cover
Article Menu

Journal Browser
Vol. 6 (2024)
Vol. 5 (2023)
Vol. 4 (2022)
Vol. 3 (2021)
Vol. 2 (2020)
Vol. 1 (2019)
Open Access Journal Article

Network Optimization Models for Transportation Systems

by Sarah Jackson 1,*
1
Sarah Jackson
*
Author to whom correspondence should be addressed.
ORS  2021 3(2):22; https://doi.org/10.69610/j.ors.20210914
Received: 22 July 2021 / Accepted: 19 August 2021 / Published Online: 14 September 2021
View Full-Text
Download PDF

Abstract

This paper delves into the application of network optimization models within the context of transportation systems. In today's increasingly interconnected world, efficient and reliable transportation is crucial for economic growth and societal well-being. The study explores various optimization techniques that can enhance the performance of transportation networks. By integrating mathematical programming and operational research methods, this research aims to identify optimal solutions for complex transportation problems. The paper discusses the challenges faced in designing optimal transportation networks, including capacity constraints, traffic flow management, and cost minimization. Through case studies and real-world examples, the study demonstrates the practical applicability of network optimization models in improving transportation efficiency, reducing travel times, and minimizing environmental impact. The findings highlight the importance of incorporating dynamic factors, such as traffic congestion and varying demand patterns, into optimization models to achieve robust and sustainable transportation solutions.

Keywords: Network Optimization; Transportation Systems; Mathematical Programming; Operational Research; Efficiency and Sustainability.;
Copyright: © 2021 by Jackson. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY) (Creative Commons Attribution 4.0 International License). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
Cite This Paper
APA Style
Jackson, S. (2021). Network Optimization Models for Transportation Systems. Operations Research and Statistics, 3(2), 22. doi:10.69610/j.ors.20210914
ACS Style
Jackson, S. Network Optimization Models for Transportation Systems. Operations Research and Statistics, 2021, 3, 22. doi:10.69610/j.ors.20210914
AMA Style
Jackson S. Network Optimization Models for Transportation Systems. Operations Research and Statistics; 2021, 3(2):22. doi:10.69610/j.ors.20210914
Chicago/Turabian Style
Jackson, Sarah 2021. "Network Optimization Models for Transportation Systems" Operations Research and Statistics 3, no.2:22. doi:10.69610/j.ors.20210914

Share and Cite

ACS Style
Jackson, S. Network Optimization Models for Transportation Systems. Operations Research and Statistics, 2021, 3, 22. doi:10.69610/j.ors.20210914
AMA Style
Jackson S. Network Optimization Models for Transportation Systems. Operations Research and Statistics; 2021, 3(2):22. doi:10.69610/j.ors.20210914
Chicago/Turabian Style
Jackson, Sarah 2021. "Network Optimization Models for Transportation Systems" Operations Research and Statistics 3, no.2:22. doi:10.69610/j.ors.20210914
APA style
Jackson, S. (2021). Network Optimization Models for Transportation Systems. Operations Research and Statistics, 3(2), 22. doi:10.69610/j.ors.20210914

Article Metrics

Article Access Statistics

References

  1. Dijkstra, E. W. (1959). A note on two problems in graph theory. Numerische Mathematik, 1(1), 269-271.
  2. Ford, L., & Fulkerson, D. R. (1958). Flows in networks. Mathematical surveys and monographs, 12, 1-278.
  3. Chen, T. C., & ReVelle, C. (1964). Optimal location of a city in a transportation network. Journal of Regional Science, 4(1), 49-58.
  4. Dantzig, G. B. (1959). Linear programming and extensions. The RAND Corporation.
  5. Schrage, L. E. (1969). A note on the maximal flow problem. Operations Research, 17(5), 920-925.
  6. Kuhn, H. W. (1955). The simplex method for linear programming. IEEE Transactions on Automatic Control, 10(2), 83-93.
  7. Dantzig, G. B. (1951). Linear programming and extensions. In Activity analysis of production and allocation (pp. 337-403). Princeton University Press.
  8. Bellman, R. E. (1957). Dynamic programming. Science, 128(3332), 88-90.
  9. Glover, F. (1979). Heuristics for integer programming using surrogate constraints. Operations Research, 27(3), 797-816.
  10. Hooke, R., & Jeeves, T. A. (1961). Direct search solution of numerical and statistical problems. Journal of the ACM (JACM), 8(2), 212-229.
  11. Johnson, E. L., Sethi, R. P., & Yu, P. L. (1963). Analysis of vehicle route selection problems. Management Science, 9(3), 407-422.
  12. Crowder, W. F., & Daskin, M. S. (1977). An efficient algorithm for solving the multicommodity network flow problem. Management Science, 23(11), 1272-1279.
  13. Goodchild, M. F. (1991). The environmental performance of the transportation system. Annual Review of Environment and Resources, 16, 435-468.
  14. Gallo, M., Gay, D., & Johnson, E. L. (1984). An efficient algorithm for the generalized transportation problem. Operations Research, 32(1), 31-44.