Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/51547
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAkbay, M.A.-
dc.contributor.authorKalayci, C.B.-
dc.contributor.authorBlum, C.-
dc.date.accessioned2023-06-13T19:19:19Z-
dc.date.available2023-06-13T19:19:19Z-
dc.date.issued2023-
dc.identifier.isbn9783031300349-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://doi.org/10.1007/978-3-031-30035-6_2-
dc.identifier.urihttps://hdl.handle.net/11499/51547-
dc.description23rd European Conference on Evolutionary Computation in Combinatorial Optimisation, EvoCOP 2023, held as part of EvoStar 2023 -- 12 April 2023 through 14 April 2023 -- 291239en_US
dc.description.abstractThis study addresses the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries. In a two-echelon distribution network, large vehicles transport goods from central warehouses to satellites, while smaller and environmentally friendly vehicles distribute goods from these satellites to final customers. The considered problem also includes simultaneous pickup and delivery constraints that usually arise as a reverse logistics practice. A MILP model is developed and solved for small-sized problem instances using CPLEX. Since the tackled problem becomes rather complex because of the multi-tier structure and constraints, solving even small-sized instances using CPLEX requires very long computation times. Therefore, the application of a self-adaptive variant of the hybrid metaheuristic Construct, Merge, Solve & Adapt is proposed. In the context of problem instances too large for the application of CPLEX, our algorithm is compared to probabilistic versions of two well-known constructive heuristics. The numerical results show that our algorithm outperforms CPLEX in the context of rather small problem instances. Moreover, it is shown to outperform the heuristic algorithms when larger problem instances are concerned. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.en_US
dc.description.sponsorshipYLYS-2019; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK: 119M236en_US
dc.description.sponsorshipAcknowledgements. This paper was supported by grants TED2021-129319B-I00 and PID2019-104156GB-I00 funded by MCIN/AEI/10.13039/501100011033. Moreover, M.A. Akbay and C.B. Kalayci received support from the Technological Research Council of Turkey (TUBITAK) under grant number 119M236. The corresponding author was funded by the Ministry of National Education, Turkey (Scholarship Prog.: YLYS-2019).en_US
dc.language.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectEVRPen_US
dc.subjectsimultaneous pickup and deliveryen_US
dc.subjecttwo-echelonen_US
dc.subjectDistribution of goodsen_US
dc.subjectElectric vehiclesen_US
dc.subjectInteger programmingen_US
dc.subjectPickupsen_US
dc.subjectVehicle routingen_US
dc.subjectCentral warehouseen_US
dc.subjectDelivery constraintsen_US
dc.subjectEnvironmentally friendly vehiclesen_US
dc.subjectEVRPen_US
dc.subjectLarge vehiclesen_US
dc.subjectProblem instancesen_US
dc.subjectReverse logisticsen_US
dc.subjectSimultaneous pickup and deliveriesen_US
dc.subjectTwo-echelaen_US
dc.subjectVehicle Routing Problemsen_US
dc.subjectHeuristic algorithmsen_US
dc.titleApplication of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveriesen_US
dc.typeConference Objecten_US
dc.identifier.volume13987 LNCSen_US
dc.identifier.startpage16en_US
dc.identifier.endpage33en_US
dc.departmentPamukkale Universityen_US
dc.identifier.doi10.1007/978-3-031-30035-6_2-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.authorscopusid57205753430-
dc.authorscopusid54951330900-
dc.authorscopusid56269052900-
dc.identifier.scopus2-s2.0-85152551447en_US
dc.identifier.wosWOS:000999874000002en_US
dc.institutionauthor-
dc.identifier.scopusqualityQ3-
item.languageiso639-1en-
item.openairetypeConference Object-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept10.09. Industrial Engineering-
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

1
checked on Jun 29, 2024

Page view(s)

64
checked on May 27, 2024

Google ScholarTM

Check




Altmetric


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