Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can't store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system

Advanced GIS-based Multi-Function Support System for Identifying the Best Route

تحظى نظم المعلومات الجغرافية(GIS)  بدور مهم في التعامل مع التطبيقات الاستراتيجية التي يتم فيها تنظيم البيانات كسجلات لطبقات متعددة في قاعدة بيانات. علاوةعلى ذلك، توفرنظم المعلومات الجغرافية وظائف متعددة مثل جمع البيانات وتحليلها وعرضها. أثبت تنظم المعلومات الجغرافية فعاليتها في مجالات دراسة متنوعة من خلال التعامل مع أنواع مختلفة من المشاكل للعديدمن التطبيقات. ومع ذلك،فإن معالجة حجم كبير من البيانات في نظام المعلومات الجغرافية لايزال يمثل قضية مهمة. أكبر عقبة هي تصميم إطار عمل لاتخاذ القرار المكاني يركز على نظم المعلومات الجغرافية التي تعمل على إدارة مجموعة واسعة من البيانات المحددة لتحقيق الأداء الصحيح. من المفيد جدًا دعم صانعي القرار من خلال توفيرأنظمة دعم القرار القائمة على نظم المعلومات الجغرافية التي تقلل بشكل كبيرمن التكلفة المتضمنة عند التنقل بين موقعين. لذلك، في هذه الورقة، تم بناء نظام متقدم لدعم القرار لتحديد أفضل طريق بين موقعين وفقً المعاييرمختلفة مثل المسافة و وقت السفر وسلامة الطريق وميزات أخرى. يتضمن النموذج المقترح عدة مراحل؛ تنزيل خرائط جوجل و معالجتها مسبقًا، ودمجها مع قاعدة البيانات، وتحديد أفضل طريق من خلال استخدام خوارزمية متقدمة للذكاء الاصطناعي. علاوةعلى ذلك،يتم استخدام قاعدة بيانات خرائط الشوارع المفتوحة(OSM)  في هذاا لنموذج ويتم تنفيذها باستخدام منصة أنظمة المعلومات الجغرافية الكمية.(QGIS) تتمثل إحدى المزايا الرئيسية لهذا النموذج في أن يكون أسرع عن طريق إزالة تأثيرالبيانات غير المعالجة مثلا لقيم الفارغة والطرق غير المرتبطة على مستويات خرائط جوجل غيرالمتصلة بالإنترنت. تعرض نتائج هذا النموذج المقترح أفضل مسار يربط المصدربالوجهة،وجدول يتضمن المعلومات الكاملة لهذا المسار.Geographic Information Systems (GIS) are obtaining a significant role in handling strategic applications in which data are organized as records of multiple layers in a database. Furthermore, GIS provide multi-functions like data collection, analysis, and presentation. Geographic information systems have assured their competence in diverse fields of study via handling various problems for numerous applications. However, handling a large volume of data in the GIS remains an important issue. The biggest obstacle is designing a spatial decision-making framework focused on GIS that manages a broad range of specific data to achieve the right performance. It is very useful to support decision-makers by providing GIS-based decision support systems that significantly reduce the cost involved when moving between two locations. Therefore, in this paper, an advanced decision support system is built for identifying the best route between two locations according to various criteria such as distance, travel time, the safety of the road, and other features. The proposed model includes several stages; Google Maps downloading, preprocessing, integrating with the database, and identifying the best route by utilizing advanced algorithms of artificial intelligence. Furthermore, the Open Street Maps (OSM) database is utilized in this model and implemented using the Quantum Geographic Information Systems (QGIS) platform. One of the main merits of this model is to be faster by removing the influence of non-processed data like null values and unlinked roads on offline google maps levels. The outcomes of this proposed model display the best route which connects the source with the destination, and a table including the entire information for this route

Developing a spatial decision support system for sustainable built environments in Abu Dhabi

 The research aims at developing a set of sustainability indicators for the challenging Abu Dhabi built environment and examine the possible use of GIS. The research has illustrated the real potential of the sustainability indicators for managing built environment sustainability performance and provides a clear perspective on how the proposed indicators can be used to develop a DSS to assess and improve Abu Dhabi’s sustainability

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words