Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/22481
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2021-10-26T20:10:46Z-
dc.date.available2021-10-26T20:10:46Z-
dc.date.issued2010-04-
dc.identifier.citationYurtkuran, A. ve Emel, E. (2010). "A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems". Expert Systems with Applications, 37(4), 3427-3433.en_US
dc.identifier.issn0957-4174-
dc.identifier.issn1873-6793-
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2009.10.005-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0957417409008719-
dc.identifier.urihttp://hdl.handle.net/11452/22481-
dc.description.abstractVehicle routing problems have been extensively analyzed within the last few decades, since they play a central role in optimization of distribution networks. This paper presents a new Hybrid Electromagnetism-like Algorithm for solving capacitated vehicle routing problems. Electromagnetism-like Algorithm is a population-based algorithm based on attraction-repulsion mechanisms between charged particles. A modified objective function value calculation approach, utilizing the Random-Key Procedure makes it possible for Electromagnetism-like Algorithm to solve known combinatorial optimization problems like capacitated vehicle routing problems. Here, the solutions obtained such are improved by a relatively new local search method, Iterated Swap Procedure, and tested on several benchmarking problems. The computational results show that the proposed Hybrid Electromagnetism-like Algorithm gives promising results within acceptable computational times when compared to other novel meta-heuristics.en_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Scienceen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCapacitated vehicle routing problemen_US
dc.subjectGenetic algorithmen_US
dc.subjectOptimizatonen_US
dc.subjectComputer scienceen_US
dc.subjectEngineeringen_US
dc.subjectOperations research & management scienceen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectDistributed parameter networksen_US
dc.subjectElectromagnetismen_US
dc.subjectHeuristic methodsen_US
dc.subjectVehiclesen_US
dc.subjectBenchmarking problemsen_US
dc.subjectCombinatorial optimization problemsen_US
dc.subjectComputational resultsen_US
dc.subjectComputational timeen_US
dc.subjectDistribution networken_US
dc.subjectElectromagnetism-like algorithmen_US
dc.subjectLocal search methoden_US
dc.subjectMeta heuristicsen_US
dc.subjectObjective function valuesen_US
dc.subjectPopulation-based algorithmen_US
dc.subjectVehicle routing problemsen_US
dc.subjectRouting algorithmsen_US
dc.titleA new hybrid electromagnetism-like algorithm for capacitated vehicle routing problemsen_US
dc.typeArticleen_US
dc.identifier.wos000274202900083tr_TR
dc.identifier.scopus2-s2.0-71349087430tr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.contributor.departmentUludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.tr_TR
dc.contributor.orcid0000-0003-2978-2811tr_TR
dc.contributor.orcid0000-0002-9220-7353tr_TR
dc.identifier.startpage3427tr_TR
dc.identifier.endpage3433tr_TR
dc.identifier.volume37tr_TR
dc.identifier.issue4tr_TR
dc.relation.journalExpert Systems with Applicationsen_US
dc.contributor.buuauthorYurtkuran, Alkın-
dc.contributor.buuauthorEmel, Erdal-
dc.contributor.researcheridAAH-1410-2021tr_TR
dc.contributor.researcheridN-8691-2014tr_TR
dc.subject.wosComputer science, artificial intelligenceen_US
dc.subject.wosEngineering, electrical & electronicen_US
dc.subject.wosOperations research & management scienceen_US
dc.indexed.wosSCIEen_US
dc.indexed.scopusScopusen_US
dc.wos.quartileQ1en_US
dc.wos.quartileQ2 (Computer science, artificial intelligence)en_US
dc.contributor.scopusid26031880400tr_TR
dc.contributor.scopusid6602919521tr_TR
dc.subject.scopusElectromagnetism; Inventory Systems; Stockoutsen_US
Appears in Collections:Scopus
Web of Science

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.