Article detail · 2021
Electric vehicle routing with flexible time windows: a column generation solution approach
Journal
Transportation Letters: The International Journal of Transportation ResearchISSN 1942-7867
The ISSN points to another catalog journal; the name is from the YÖKSİS record.
- Year
- 2021
- Type
- article
Data source split
- YÖKSİS YÖKSİS article record
- YÖKSİS venue Transportation Letters: The International Journal of Transportation Research
- Catalog match (ISSN) Transportation Letters
- OpenAlex OpenAlex enrichment (abstract, citations, topics)
Abstract
OpenAlex · English
In this paper, we introduce the Electric Vehicle Routing Problem with Flexible Time Windows (EVRPFTW) in which vehicles are allowed to serve customers before and after the earliest and latest time window bounds, respectively. The objective of this problem is to assign electric vehicles to feasible routes and make schedules with minimum total cost that includes the traveling costs, the costs of using electric vehicles and the penalty costs incurred for earliness and lateness. The proposed mathematical model is solved by a column generation procedure. To generate an integer solution, we solve an integer programming problem using the routes constructed by the column generation algorithm. We further develop a linear programming model to compute the optimal times to start service at each customer for the selected routes. A number of well-known benchmark instances is solved by our solution procedure to evaluate the operational gains obtained by employing flexible time windows.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
54 citations
OpenAlex cited_by_count (cache / database)
16 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows 2022
- Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows 2022
- Pickup and delivery with electric vehicles under stochastic battery depletion 2020
- A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows 2023
- The fleet size and mix vehicle routing problem with synchronized visits 2022
- Managing returnable transport items in a vendor managed inventory system 2023
- A bidirectional branch-and-price algorithm with Pulse procedure for the Electric Vehicle Routing Problem with flexible deliveries 2024
- A bidirectional branch-and-price algorithm with Pulse procedure for the Electric Vehicle Routing Problem with flexible deliveries 2024
- A Reinforcement Learning-Based Solution for the Capacitated Electric Vehicle Routing Problem from the Last-Mile Delivery Perspective 2025
- A Reinforcement Learning-Based Solution for the Capacitated Electric Vehicle Routing Problem from the Last-Mile Delivery Perspective 2025