Application of Dijkstra's Algorithm in Consumers Routing and Distance Least Squares Method in Firms Location

Shahbazi, Kiumars; Salimian, Salah

doi:10.30473/indeco.2019.26592.1059

Document Type : modeling

Authors

Kiumars Shahbazi ¹
salah salimian ²

¹ Professor of Economics, Urmia University, Urmia, Iran

² Ph.D. Student in Economics, Urmia University, Urmia, Iran

https://doi.org/10.30473/indeco.2019.26592.1059

Abstract

Many firms in the economy are government-owned and the prices of products or services are the same for consumers.In this situation, consumers’ problem will be that how to get to the firm via the shortest path (minimum cost). On the other hand, the problem for a government-owned firm or a monopoly firm that is providesfacilities include the oil and gas, electricity, water, telecommunications, and etc, can be raised where it would be located in the city in order to have the least possible distance for the all consumers.In this paper, the first question with Dijkstra's algorithm and the second question byusing least square of the distancehave been answered. The results show that consumer can find theshortest path to achieve thedesiredfirm and the shortest possible distance from all available agencies by Dijkstra's algorithm. Furthermore, optimal locations of firms dependon the number of consumers and how they are distributed.

Keywords

20.1001.1.24767077.1398.3.7.3.6

References

امینزاده گوهرریزی، بهرام؛ روشن، مینا و سیامک بدر (1391)، "ارزیابی تطبیقی روشهای مکانیابی شهرهای جدید در ایران (دهه 60 تا 80)"، شماره 23، سال نهم، صص 32- 21.

جعفرنژاد، احمد؛ کریمی دستجردی، داوود؛ فولادوندی، غلام‌رضا و محمد وفایی یگانه (1389)، "ارائه یک مدل تصمیمگیری چند معیاره برای انتخاب مکان بهینه استقرار نمایندگیهای شرکتهای بیمه در شهر تهران"، فصلنامه صنعت بیمه، سال بیست و چهارم، شماره 3 و 4 ، شماره مسلسل 96-95، صص 123-95.

خزائی،صفا (1380). تجزیه و تحلیل شبکه در GIS به منظور بهینهسازی کمکرسانی، گرایش عمران‌فتوگرامتری گروه مهندسی نقشهبرداری، دانشکده فنی دانشگاه تهران.

شای، آز (1393)، اقتصاد صنعتی: نظریه و کاربردها، ترجمه: دکتر کیومرث شهبازی، تهران: انتشارات مرکز نشر دانشگاهی.

صابریان، جواد؛ محمد سعدی مسگری (1389)، "مسیریابی بهینه براساس معیار زمان با توجه به شرایط متغیر ترافیکی"، مهندسی حملونقل، سال اول، شماره چهارم.

کالل، مس آندریو؛ نیس، مایکل و جری آر گرین (1995)، تئوری بازیها برگرفته از کتاب تئوری اقتصاد خرد، ترجمه: منصور اعتمادی و محمدتقی محبی، تهران: انتشارات دانشگاه امام صادق (ع).

نقیبی، فریدون؛ دلاور، محمودرضا و آرش رحمانی‌زاده (1382)، توسعه الگوریتم دایکسترا برای تعیین کوتاه‌ترین مسیر در GIS با تأکید بر دادههای حجیم، همایش ژئوماتیک 82، تهران: سازمان نقشه‌برداری کشور.

Averbakh, I.; Berman, O.; Drezner, Z. and G. Wesolowsky (2007), "The Uncapacitated Facility Location Problem with Demand-dependent Set up and Service Costs and Customer–Choice Allocation", European Journal of Operational Research, 179(1), pp. 956-967.

Bang, Y. Wu. and Kun-Mao, Chao (2004), Spanning Trees and Optimization Problems, CRC Press: USA. pp. 25-33.

Burdurla, E. & Ejder, E. (2006), "Location Choice for Furniture Industry Firms by using Analytical Hierarchy Process (AHP) Method". Journal of Science. 16(2), pp. 369-373.

Cormen, T. H.; Leiserson, C. E.; Rivest, R. L. and C. Stein (2001). Introduction to Algorithms. MIT Press and McGraw-Hill. pp. 588-601.

Current, J. R.; ReVelle, C. S. and J.L. Cohon (1985), “The Maximum Covering/shortest Path Problem: a Multiobjective Network Design and Routing Formulation”, European Journal of Operational Research, 21(2), pp. 189–199.

Dechter, R. and J. Pearl (1985), “Generalized Bestfirst Search Strategies and the Optimality”, Journal of the ACM. 32(3). pp. 505-536.

Domenico, C. and F. Simone (2004), “Two-Levels-Greedy: a Generalization of Dijkstra’s Shortest Path Algorithm”, Electronic Notes in Discrete Mathematics. No. 17, pp. 81–86.

Donald, E.K. (1997), The Art Of Computer Programming, Vol. 1. Third Edition. Addison-Wesley. ISBN -201- 04- 89683.

Douglas B. W. (2001), Introduction to Graph Theory. Second Edition.Prentice Hall. ISBN 0-13-014400-2.

Kairanbay, M.; Hajar, M. J. (2013), “A Review and Evaluations of Shortest Path Algorithms”. International Journal of Acientific & Technology Research.2(6). pp. 2277-8616.

Karger, D. R.; Klein, P. N. and R.E. Tarjan (1995). “A Randomized Linear-time Algorithm to Find Minimum Spanningtrees”, Journal of the Aswcl.tmn for Computmg Machinery. 42(2). pp. 321–328.

Khyrina, A. F.; Burairah, H. and S.H. Abd (2015), “Modification of Dijkstra’s Algorithm for Safest and Shortest Path during Emergency Evacuation”, Applied Mathematical Sciences, 9(31), pp. 1531 – 1541.

Lukas, K. and M. Radomil (2013), “A Performance Comparison of Rapidly exploring Random Tree and Dijkstra’s Algorithm for Holonomic Robot Path Planning”, Recent Advances in Applied and Theoretical Mathematics. ISBN: 978-960-474-351-3.

Melaina, M. J. and M.H. Ross (2000), “The Ultimate Challenge: Developing an Infrastructure for Fuel Cell Vehicles”, Environment, 42(7), pp. 10–22.

Paolo, A.; Sanchez, S.; Jesus, A. and R. Hernaude (2001), An Object-genetic Method for Network Analysis in GIS: The Optimal and Shortest Path and Node Location, University of Colombia.

Prescott, E. and M. Visscher (1977), “Sequential Location among Firms with Foresight”, The Bell Journal of Economics. 8(2), pp. 378 - 393.

Preygel, A. (1999), Path Finding: A Comparison of Algorithms. Management Science. Matthews.

Țarțavulea, R. I. (2015), “Model for Determining the Optimum Location for Performance Improvement in Supply-Chain Strategies”, European Journal of Interdisciplinary Studies. 7(1), pp. 39–54.

Udi, M. (1989), Introduction to Algorithms - A Creative Approach. MIT Press and Addison-Wesley. ISBN- 02-12037-201.

Vaibhavi, P. and P. ChitraBaggar (2014), “A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application”, International Journal of P2P Network Trends and Technology (IJPTT). 5 – February 2014.

Wang, Y.W. and C.C. Lin (2009), “Locating road Vehicle Refueling Stations. Transportation Research Part E”, Logistics and Transportation Review. 45(5), pp. 821-829.

Wang, Y. W. and C.R. Wang (2009), “Locating Passenger Vehicle Refueling Stations”, Transport. Res. Part E (2010). 46(5), pp. 791-801.

Zhan, B. (1999), “Three Fastest Shortest Path Algorithms on Real Road Networks”, Southwest Texas State University, San Marcos. TX 78666. USA. 1(1). pp. 69-82.

فصلنامه پژوهش های اقتصاد صنعتی

Application of Dijkstra's Algorithm in Consumers Routing and Distance Least Squares Method in Firms Location

References

References

Volume 3, Issue 7 - Serial Number 7
April 2019
Pages 37-48

Application of Dijkstra's Algorithm in Consumers Routing and Distance Least Squares Method in Firms Location

References

References

Volume 3, Issue 7 - Serial Number 7April 2019Pages 37-48

Volume 3, Issue 7 - Serial Number 7
April 2019
Pages 37-48