Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11779/1534
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÇatay, Bülent-
dc.contributor.authorDuman, Ece Naz-
dc.contributor.authorTaş, Duygu-
dc.date.accessioned2021-08-23T08:26:46Z
dc.date.available2021-08-23T08:26:46Z
dc.date.issued2021-
dc.identifier.citationDuman, E. N., Taş, D., & Çatay, B. (2021). Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. International Journal of Production Research, 1-22. ‌en_US
dc.identifier.issn1366-588X-
dc.identifier.issn0020-7543-
dc.identifier.urihttps://doi.org/10.1080/00207543.2021.1955995-
dc.identifier.urihttps://hdl.handle.net/20.500.11779/1534-
dc.descriptionFunding agency : Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) Grant number : 118M412en_US
dc.description.abstractIn this paper, we address the electric vehicle routing problem with time windows and propose two branch-and-price-and-cut methods based on a column generation algorithm. One is an exact algorithm whereas the other is a heuristic method. The pricing sub-problem of the column generation method is solved using a label correcting algorithm. The algorithms are strengthened with the state-of-the-art acceleration techniques and a set of valid inequalities. The acceleration techniques include: (i) an intermediate column pool to prevent solving the pricing sub-problem at each iteration, (ii) a label correcting method employing the ng-route algorithm adopted to our problem, (iii) a bidirectional search mechanism in which both forward and backward labels are created, (iv) a procedure for dynamically eliminating arcs that connect customers to remote stations from the network during the path generation, (v) a bounding procedure providing early elimination of sub-optimal routes, and (vi) an integer programming model that generates upper bounds. Numerical experiments are conducted using a benchmark data set to compare the performances of the algorithms. The results favour the heuristic algorithm in terms of both the computational time and the number of instances solved. Moreover, the heuristic algorithm is shown to be specifically effective for larger instances. Both algorithms introduce a number of new solutions to the literature.en_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectColumn generationen_US
dc.subjectBranch-and-price-and-cuten_US
dc.subjectLabelling algorithmsen_US
dc.subjectRoutingelectricen_US
dc.subjectElectric vehiclesen_US
dc.titleBranch-And Methods for the Electric Vehicle Routing Problem With Time Windowsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207543.2021.1955995-
dc.identifier.scopus2-s2.0-85111887999en_US
dc.authoridDuygu Taş / 0000-0002-3579-4600-
dc.description.woscitationindexScience Citation Index Expanded-
dc.identifier.wosqualityQ1-
dc.description.WoSDocumentTypeArticle; Early Access
dc.description.WoSInternationalCollaborationUluslararası işbirliği ile yapılmayan - HAYIRen_US
dc.description.WoSPublishedMonthJulyen_US
dc.description.WoSIndexDate2021en_US
dc.description.WoSYOKperiodYÖK - 2020-21en_US
dc.identifier.scopusqualityQ1-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.startpage1-22en_US
dc.departmentMühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.relation.journalInternational Journal of Production Research (IJPR)en_US
dc.identifier.wosWOS:000679826100001en_US
dc.institutionauthorTaş, Duygu-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.openairetypeArticle-
item.grantfulltextembargo_20400101-
item.cerifentitytypePublications-
Appears in Collections:Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
Branch and price and cut methods for the electric vehicle routing problem with time windows.pdf
  Until 2040-01-01
Full Text / Tam Metin2.09 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

30
checked on Nov 9, 2024

WEB OF SCIENCETM
Citations

32
checked on Nov 9, 2024

Page view(s)

34
checked on Nov 4, 2024

Google ScholarTM

Check




Altmetric


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