CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Development of an Algorithm for all Type of Transportation Problems

by Pawan Tamta, Bhagwati Pande, H.S Dhami
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 30 - Number 6
Year of Publication: 2011
Authors: Pawan Tamta, Bhagwati Pande, H.S Dhami
10.5120/3645-5091

Pawan Tamta, Bhagwati Pande, H.S Dhami . Development of an Algorithm for all Type of Transportation Problems. International Journal of Computer Applications. 30, 6 ( September 2011), 24-30. DOI=10.5120/3645-5091

@article{ 10.5120/3645-5091,
author = { Pawan Tamta, Bhagwati Pande, H.S Dhami },
title = { Development of an Algorithm for all Type of Transportation Problems },
journal = { International Journal of Computer Applications },
issue_date = { September 2011 },
volume = { 30 },
number = { 6 },
month = { September },
year = { 2011 },
issn = { 0975-8887 },
pages = { 24-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume30/number6/3645-5091/ },
doi = { 10.5120/3645-5091 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:16:17.981030+05:30
%A Pawan Tamta
%A Bhagwati Pande
%A H.S Dhami
%T Development of an Algorithm for all Type of Transportation Problems
%J International Journal of Computer Applications
%@ 0975-8887
%V 30
%N 6
%P 24-30
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The present work is an attempt for the development of user friendly algorithm, applicable to all type of transportation situations. The algorithms developed hitherto address a particular type of transportation problem only. Apart from this several numbers of steps are found to be involved in these algorithms which make them complicated for programming purposes. Here an effort is being made to develop a simple logical technique for the development of a general algorithm. A computer program has also been developed using the C++ programming language to support the efficiency of the logic applied in the algorithm. This general algorithm is not based on linear programming model and has the advantage of solving all types of Transportation Problems in only two steps. A numerical example has been given to elucidate the process.

References
  1. Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatoshi Sakawa (2006)Longest path analysis in networks of queuew:Dynamic scheduling problems, European Journal of Operational Research, Volume 174, Issue 1, pp.132-149.
  2. Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili(2010) ,The CoMirror algorithm for solving nonsmooth constrained convex problems, Operations research letter , Volume 38, pp.493-498.
  3. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE(2001): An approach to universal topology generation, in: Proc. of the MASCOTS’01, pp. 346–353.
  4. Bernard Fortz, Michael Poss(2010)Easy distributions for combinatorial optimization problems with probabilistic constraints, Operations research letter,Pages 545-549, volume 38.
  5. Brugmann, J., 2009. Welcome to the Urban Revolution: How Cities are Changing the World. Toronto: The Penguin Group.
  6. Daisuke Hirata, Toshihiro Matsumura(2010), On the uniqueness of Bertrand equilibrium, operations research letter, Pages 533-535 volume 38.
  7. Garcia-Palomares, J.C. (2010). Urban sprawl and travel to work: the case of the metropolitan area of Madrid. Journal of Transport Geography, 18, 197-213.
  8. Goetz, A.R., Vowles, T.M., Tierney, S. (2009). Bridging the Qualitative-Quantitative Divide in Transport Geography. The Professional Geography, 61(3), 323-335. .
  9. Hall, D. (2010). Transport geography and new European realities: a critique. Journal of Transport Geography, 18, 1-13.
  10. Han, S.S. (2010). Managing motorization in sustainable transport planning: the Singapore experience. Journal of Transport Geography, 18, 314-321..
  11. John A. Morrison(2010),Optimal trunk reservation for an overloaded link operations research letter ,Pages 499-501,volume 38.
  12. Keith Sandrock (1988), A Simple Algorithm for solving Small Fixed-Charge Transportation Problems, Journal Of Operation Research, pp 467-475,volume 39.
  13. Lane, B.W. (2010). The relationship between recent gasoline price fluctuations and transit ridership in major US cities. Journal of Transport Geography, 18, 214-221.
  14. Lauri Ahlroth, André Schumacher, Harri Haanpää(2010), On the power of lookahead in online lot-sizing, operations research letter, Pages 522-526,volume 38.
  15. Line, T., Chatterjee, K., Lyons, G. (2010). The travel behaviour intentions of young people in the context of climate change. Journal of Transport Geography, 18, 238-246.
  16. L.M.A. Drummond, M. Santos and E. Uchoa (2009), A distributed dual ascent algorithm for Steiner problems in multicast routing, Networks 53 , pp. 170–183.
  17. Matthew J. Sobel, Joseph G. Szmerekovsky, Vera Tilson (2009), Scheduling projects with stochastic activity durarion to maximize expected net present value, Europian Journal of Operation Reaearch,Volume 198, Issue 3,1November 2009,Pages 697-705.
  18. Sharat Israni, Jerry Sanders (1982), Two dimensional cutting stock problem research, Journal of Manufacturing Systems, Volume 1, Issue 2, pp 69-82.
  19. Spears, J., Kalinowski, T. (2010, March 30). Toronto commuting times worst of 19 major cities. The Toronto Star. Retrieved March 25, 2010 from the World Wide Web: http://www.thestar.com/news/gta/transportation/article/787400--toronto-commuting- times-
  20. Yasmine, F., Larsen, J., El-Geneidy, A. (2010). Examining Travel Distances by Walking and Cycling in Montreal, Canada. School of Urban Planning, McGill University. Retrieved March 1, 2010 from the World Wide Web: http://tram.mcgill.ca/Multimedia/posters/walk_cycle_distance.pdf.
Index Terms

Computer Science
Information Sciences

Keywords

Wij (weight for ith source node and jth destination node) Dj (demand at jth destination node) Cij (unit transportation cost between ith source node and jth destination node) ui (multiplier for ith row) vj( multiplier for jth column)..

Powered by PhDFocusTM