• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace Home
  • Mühendislik Fakültesi
  • Endüstri Mühendisliği Bölümü
  • Endüstri Mühendisliği Bölümü Tez Koleksiyonu
  • View Item
  •   DSpace Home
  • Mühendislik Fakültesi
  • Endüstri Mühendisliği Bölümü
  • Endüstri Mühendisliği Bölümü Tez Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Okul Servisi Araçlarını Rotalama Problemi için Yenilikçi Bir Yaklaşım

View/Open
10258415.pdf (2.283Mb)
Date
2019-06-25
Author
Albayrak, Seda


xmlui.mirage2.itemSummaryView.MetaData
Show full item record
Abstract
Modeling and solving vehicle routing problems is nowadays emerging as a need in various fields. Among these, it is seen that one of the types that have a wide area and which is looking for the most suitable solution in a short time period is the school bus clustering, routing and scheduling problem. School bus routing problem is defined as the problem that students reside in certain regions can be assigned to the school buses in the most appropriate way and that they can serve different schools in the shortest time with the most appropriate route within the school buses itself. It is not possible to model and solve it directly by classical methods because of many objectives and constraints it contains. In the literature, it is seen that there are many studies in which the problem is addressed in whole or in part. Both exact and variety of developed heuristic algorithms have sought out to provide optimal solutions. In this study, the solution of the problem of clustering and routing for a school bus company serving many schools with different number of students is presented. A hybrid model is used with different clustering techniques and routing methods in order to reduce the costs and increase the profit as much as possible by optimizing the bus routes and number of buses in the student transportation service company. The results are compared with the solutions of saving algorithm for the example in this study, which is expressed as the capacity constrained and open vehicle routing problem.
URI
http://hdl.handle.net/11655/9266
xmlui.mirage2.itemSummaryView.Collections
  • Endüstri Mühendisliği Bölümü Tez Koleksiyonu [30]
Hacettepe Üniversitesi Kütüphaneleri
Açık Erişim Birimi
Beytepe Kütüphanesi | Tel: (90 - 312) 297 6585-117 || Sağlık Bilimleri Kütüphanesi | Tel: (90 - 312) 305 1067
Bizi Takip Edebilirsiniz: Facebook | Twitter | Youtube | Instagram
Web sayfası: www.library.hacettepe.edu.tr | E-posta: openaccess@hacettepe.edu.tr
Contact Us | Send Feedback


|| || || || ||

|| || || ||

|| || || || || ||

DSpace software copyright © 2002-2016  DuraSpace
Theme by 
Atmire NV
 

 


| HÜ Açık Erişim Politikası |
| HÜAES Veri Giriş Rehberleri |

DSpace@Hacettepe
huk openaire onayı
by OpenAIRE

livechat

sherpa/romeo
Dergi Adı/ISSN || Yayıncı

Exact phrase only All keywords Any

BaşlıkbaşlayaniçerenISSN


Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeDepartmentPublisherLanguageRightsIndexing SourceFundingThis CollectionBy Issue DateAuthorsTitlesSubjectsTypeDepartmentPublisherLanguageRightsIndexing SourceFunding

My Account

LoginRegister

Statistics

View Usage Statistics

DSpace software copyright © 2002-2016  DuraSpace
Theme by 
Atmire NV