Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11779/1534
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Çatay, Bülent | - |
dc.contributor.author | Duman, Ece Naz | - |
dc.contributor.author | Taş, Duygu | - |
dc.date.accessioned | 2021-08-23T08:26:46Z | |
dc.date.available | 2021-08-23T08:26:46Z | |
dc.date.issued | 2021 | - |
dc.identifier.citation | Duman, 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.issn | 1366-588X | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | https://doi.org/10.1080/00207543.2021.1955995 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11779/1534 | - |
dc.description | Funding agency : Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) Grant number : 118M412 | en_US |
dc.description.abstract | In 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.iso | en | en_US |
dc.publisher | Taylor and Francis | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Column generation | en_US |
dc.subject | Branch-and-price-and-cut | en_US |
dc.subject | Labelling algorithms | en_US |
dc.subject | Routingelectric | en_US |
dc.subject | Electric vehicles | en_US |
dc.title | Branch-And Methods for the Electric Vehicle Routing Problem With Time Windows | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1080/00207543.2021.1955995 | - |
dc.identifier.scopus | 2-s2.0-85111887999 | en_US |
dc.authorid | Duygu Taş / 0000-0002-3579-4600 | - |
dc.description.woscitationindex | Science Citation Index Expanded | - |
dc.identifier.wosquality | Q1 | - |
dc.description.WoSDocumentType | Article; Early Access | |
dc.description.WoSInternationalCollaboration | Uluslararası işbirliği ile yapılmayan - HAYIR | en_US |
dc.description.WoSPublishedMonth | July | en_US |
dc.description.WoSIndexDate | 2021 | en_US |
dc.description.WoSYOKperiod | YÖK - 2020-21 | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.startpage | 1-22 | en_US |
dc.department | Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.relation.journal | International Journal of Production Research (IJPR) | en_US |
dc.identifier.wos | WOS:000679826100001 | en_US |
dc.institutionauthor | Taş, Duygu | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.grantfulltext | embargo_20400101 | - |
item.cerifentitytype | Publications | - |
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 | Size | Format | |
---|---|---|---|---|
Branch and price and cut methods for the electric vehicle routing problem with time windows.pdf Until 2040-01-01 | Full Text / Tam Metin | 2.09 MB | Adobe PDF | View/Open Request a copy |
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.