Basit öğe kaydını göster

dc.contributor.authorDemirtas, Umut
dc.contributor.authorDemirtas, Yonca
dc.contributor.authorOzdemir, Erhan
dc.date.accessioned2021-03-05T19:45:26Z
dc.date.available2021-03-05T19:45:26Z
dc.identifier.citationDemirtas Y., Ozdemir E., Demirtas U., "A Particle Swarm Optimization for the Dynamic Vehicle Routing Problem", 6th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO), İstanbul, Türkiye, 27 - 29 Mayıs 2015
dc.identifier.othervv_1032021
dc.identifier.otherav_d0c31e78-b357-4bca-b30d-7ae18f4dfc7b
dc.identifier.urihttp://hdl.handle.net/20.500.12627/137997
dc.identifier.urihttps://doi.org/10.1109/icmsao.2015.7152224
dc.description.abstractVarious versions of the Vehicle Routing Problem (VRP) have been studied for many years. VRP is a static problem, while in the real world, many problems have dynamic nature. In the Dynamic VRP (DVRP), not all information about the problem is known at the beginning of the planning horizon, and, in most cases the information can change after the solution process begins. This two characteristics make the DVRP harder than static VRP. In this study the DVRP is examined and a Particle Swarm Optimization algorithm is proposed. The most known benchmarks are solved with the proposed algorithm and the results are compared with the previous employed methods in the literature.
dc.language.isoeng
dc.subjectMühendislik ve Teknoloji
dc.subjectHarita Mühendisliği-Geomatik
dc.subjectMühendislik, Bilişim ve Teknoloji (ENG)
dc.subjectMühendislik
dc.subjectMÜHENDİSLİK, MULTİDİSİPLİNER
dc.titleA Particle Swarm Optimization for the Dynamic Vehicle Routing Problem
dc.typeBildiri
dc.contributor.departmentGebze Teknik Üniversitesi , ,
dc.contributor.firstauthorID84995


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster