Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11779/1534
Title: Branch-And Methods for the Electric Vehicle Routing Problem With Time Windows
Authors: Çatay, Bülent
Duman, Ece Naz
Taş, Duygu
Keywords: Column generation
Branch-and-price-and-cut
Labelling algorithms
Routingelectric
Electric vehicles
Publisher: Taylor and Francis
Source: 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. ‌
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.
Description: Funding agency : Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) Grant number : 118M412
URI: https://doi.org/10.1080/00207543.2021.1955995
https://hdl.handle.net/20.500.11779/1534
ISSN: 1366-588X
0020-7543
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 full 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 11, 2024

Google ScholarTM

Check




Altmetric


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