Abstract
Es zamanli topla dagit arac rotalama problemi; musterilerin dagitim ve toplama taleplerinin es zamanli olarak karsilandigi bir arac rotalama problemidir. Bu tez kapsaminda bir ana depo uzerinden 76 musteriye hizmet saglayacak bir firmanin arac rotalama problemi ele alinmistir. Minimum sayida arac kullanimi ile gidilen mesafeyi en kucukleyecek arac rotalarinin olusturulmasi hedeflenmistir. Problem cozumu icin literaturde yer alan karisik tamsayili matematiksel model kullanilmistir ve sezgisel bir algoritma gelistirilmistir. Farkli buyuklukteki veri setlerine algoritma uygulanmis elde edilen cozumler regresyon analizi ile degerlendirilmistir.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
