Shortest path analysis in dynamic transportation networks by expert systems: a case study in Ankara, Bahcelievler district by using genetic algorithms

Download
143534.pdf
2003
Eke, Gökhan
Show full item record
87
views
0
downloads
https://hdl.handle.net/11511/13148
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Shortest path optimization of haul road design in underground mines using an evolutionary algorithm
Yardımcı, Ahmet Güneş; Karpuz, Celal (Elsevier BV, 2019-10-01)
All types of underground mine access serve as permanent openings to transfer men and extracted material throughout the life of an operation. Development and operating costs are predominantly controlled by the haul road length. However, the most common method to design the main haul road is to rely on the empirical knowledge of skilled mine design experts. This is sufficient for simple mine layouts. However, determination of the optimum path without violating navigation constraints in complex underground net...
Shortest Path Estimation Considering Kinematical Constraints of Main Haulage Roads in Underground Mines A Heuristic Algorithm
Yardımcı, Ahmet Güneş; Karpuz, Celal (2016-10-07)
Main haulage road carries the traffic of men, equipment, extracted rock and ventilation air in underground mines. These roads may contain straight or spiral portions with gradient or a combination. For a few decades, sophisticated underground mine design solutions based on Computer Aided Design (CAD) principles are extensively used by industry professionals. Today, companies still rely on the subjective solutions of skilled mine design specialists for the main haulage road design. However, there is no uniqu...
Minimum-weight spanning tree algorithms - A survey and empirical study
Bazlamaçcı, Cüneyt Fehmi (2001-07-01)
The minimum-weight spanning tree problem is one of the most typical and well-known problems of combinatorial optimisation. Efficient solution techniques had been known for many years. However, in the last two decades asymptotically faster algorithms have been invented. Each new algorithm brought the time bound one step closer to linearity and finally Karger, Klein and Tarjan proposed the only known expected linear-time method. Modern algorithms make use of more advanced data structures and appear to be more...
Peak-aware traffic prediction with deep learning models and a driver simulation method with probabilistic hybrid automaton
Acun, Fatih; Aydın Göl, Ebru; Kalkan, Sinan; Department of Computer Engineering (2022-8)
Accurately predicting traffic is crucial due to its impact on urban life in many aspects. Several statistical methods, machine learning, and deep learning approaches are applied to different traffic datasets. In general, traffic follows a stable behavior except for the morning and evening peaks which span a small period in time. To consider a prediction model to be accurate, it must demonstrate successful results during peak hours. In this thesis, a novel distance to mean weighting technique is presented th...
Smooth breaks and nonlinear mean reversion in real interest parity: Evidence from East Asian countries
Gülcü, Abdullah; Yıldırım Kasap, Dilem (Informa UK Limited, 2019-08-18)
This study aims to explore the empirical validity of the real interest rate parity (RIP) hypothesis for East Asian countries using Japan as the base country. To this end, we employ the recently proposed unit root tests of Christopoulos and Leon-Ledesma that account for both multiple smooth structural breaks of unknown form and nonlinear mean reversion in the series. Our empirical results uncover overwhelming evidences in favor of the RIP hypothesis for the whole countries in our sample. More specifically, t...
Citation Formats
G. Eke, “Shortest path analysis in dynamic transportation networks by expert systems: a case study in Ankara, Bahcelievler district by using genetic algorithms,” M.S. - Master of Science, Middle East Technical University, 2003.
METU IIS - Integrated Information Service open@metu.edu.tr