Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Ay, Merhad" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Küçük Resim Yok
    Öğe
    An innovative data-driven integrated solution for ridesharing and dynamic vehicle routing
    (Taylor & Francis Ltd, 2025) Ay, Merhad; Ozbakir, Lale
    The increasing demand for flexible and sustainable mobility services has intensified interest in ridesharing and mobility-on-demand systems. However, current solutions remain limited, as they often neglect critical factors such as demand forecasting, vehicle repositioning, workload balance, and real-time adaptability. This study proposes an integrated data-driven framework for ridesharing and dynamic vehicle routing, composed of a periodic and dynamic components. By synchronising these stages, the system captures interdependencies between demand prediction and routing decisions, reducing inefficiencies caused by treating them separetely. The approach was validated on over 300,000 historical trips and tested with 9,016 real-time demands. Results show that the framework achieves a demand cancellation rate below 9%, balances driver workloads, and responds to new requests within 4 s. Sensitivity analyses reveal that omitting clustering or forecasting raises costs, while the full integration yields 6-10% savings. The proposed system provides a holistic, scalable, and sustainable real time optimisation model for future urban mobility.
  • Küçük Resim Yok
    Öğe
    Evaluating the Impact of Distance Metrics on K-means Clustering Performance with Geospatial Data
    (Springer Science and Business Media Deutschland GmbH, 2026) Ay, Merhad; Ozbakir, Lale
    Clustering algorithms are fundamental in data mining, machine learning, and statistical analysis, with K-means being one of the most popular due to its simplicity and efficiency. This study examines the impact of using different distance metrics (Euclidean and Vincenty) on the performance of the K-means clustering algorithm when applied to geographical data. While Euclidean distance is widely used for its straightforward computation, it may not be ideal for clustering geographical locations due to the Earth’s curvature. Vincenty’s formula, which accounts for the Earth’s ellipsoid shape, offers a potentially more accurate alternative. We conducted experiments using a dataset of 69,902 geographical points, evaluating the clustering performance based on Sum of Squared Errors (SSE), Davies-Bouldin Index (DBI), and Silhouette Index. Our results indicate that although Vincenty’s formula theoretically provides more precise distance measurements depending on the earth shape, the practical differences in clustering performance between Euclidean and Vincenty distances are minimal. Statistical analysis using the Mann–Whitney U test demonstrated that the observed differences lacked statistical significance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2026.

| Düzce Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Düzce Üniversitesi, Kütüphane ve Dokümantasyon Daire Başkanlığı, Düzce, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2026 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim