Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows

Duman, Ece Naz; Taş, Duygu; Çatay, Bülent

doi:10.1080/00207543.2021.1955995

Cited by 31 publications

(12 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They proposed a solution method based on VNS and TS and reported on the computational properties of the algorithm. Duman et al [17] proposed exact and heuristic algorithms based on branch-and-price-and-cut and on column generation to solve the EVRP with TWs.…”

Section: Related Literaturementioning

confidence: 99%

See 1 more Smart Citation

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

et al. 2022

View full text Add to dashboard Cite

Increasing environmental concerns and legal regulations have led to the development of sustainable technologies and systems in logistics, as in many fields. The adoption of multi-echelon distribution networks and the use of environmentally friendly vehicles in freight distribution have become major concepts for reducing the negative impact of urban transportation activities. In this line, the present paper proposes a two-echelon electric vehicle routing problem. In the first echelon of the distribution network, products are transported from central warehouses to satellites located in the surroundings of cities. This is achieved by means of large conventional trucks. Subsequently, relatively smaller-sized electric vehicles distribute these products from the satellites to demand points/customers located in the cities. The proposed problem also takes into account the limited driving range of electric vehicles that need to be recharged at charging stations when necessary. In addition, the proposed problem considers time window constraints for the delivery of products to customers. A mixed-integer linear programming formulation is developed and small-sized instances are solved using CPLEX. Furthermore, we propose a constructive heuristic based on a modified Clarke and Wright savings heuristic. The solutions of this heuristic serve as initial solutions for a variable neighborhood search metaheuristic. The numerical results show that the variable neighborhood search matches CPLEX in the context of small problems. Moreover, it consistently outperforms CPLEX with the growing size and difficulty of problem instances.

show abstract

Section: Related Literaturementioning

confidence: 99%

“…Constraint (15) ensures that each customer is served by only one satellite. Constraints ( 16), (17), and (19) ensure that each electric vehicle completes its tour at the same satellite from which it started the tour. Constraint (18) guarantees that each electric vehicle can provide service through only one satellite.…”

Section: Notations and Setsmentioning

confidence: 99%

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

et al. 2022

View full text Add to dashboard Cite

show abstract

“…As a result, scholars have begun to explore the use of heuristic algorithms. Building on a column algorithm, Duman et al . (2022) offered two branch-and-price-and-cut approaches: exact method and heuristic method, and the results demonstrate that the heuristic method performs better for larger instances.…”

Section: Literature Reviewmentioning

confidence: 99%

An electric vehicle routing model with charging stations consideration for sustainable logistics

Li,

Lim,

Xiong

et al. 2023

IMDS

View full text Add to dashboard Cite

PurposeRecently, electric vehicles have been widely used in the cold chain logistics sector to reduce the effects of excessive energy consumption and to support environmental friendliness. Considering the limited battery capacity of electric vehicles, it is vital to optimize battery charging during the distribution process.Design/methodology/approachThis study establishes an electric vehicle routing model for cold chain logistics with charging stations, which will integrate multiple distribution centers to achieve sustainable logistics. The suggested optimization model aimed at minimizing the overall cost of cold chain logistics, which incorporates fixed, damage, refrigeration, penalty, queuing, energy and carbon emission costs. In addition, the proposed model takes into accounts factors such as time-varying speed, time-varying electricity price, energy consumption and queuing at the charging station. In the proposed model, a hybrid crow search algorithm (CSA), which combines opposition-based learning (OBL) and taboo search (TS), is developed for optimization purposes. To evaluate the model, algorithms and model experiments are conducted based on a real case in Chongqing, China.FindingsThe result of algorithm experiments illustrate that hybrid CSA is effective in terms of both solution quality and speed compared to genetic algorithm (GA) and particle swarm optimization (PSO). In addition, the model experiments highlight the benefits of joint distribution over individual distribution in reducing costs and carbon emissions.Research limitations/implicationsThe optimization model of cold chain logistics routes based on electric vehicles provides a reference for managers to develop distribution plans, which contributes to the development of sustainable logistics.Originality/valueIn prior studies, many scholars have conducted related research on the subject of cold chain logistics vehicle routing problems and electric vehicle routing problems separately, but few have merged the above two subjects. In response, this study innovatively designs an electric vehicle routing model for cold chain logistics with consideration of time-varying speeds, time-varying electricity prices, energy consumption and queues at charging stations to make it consistent with the real world.

show abstract

“…Desaulniers et al (2016) studied the EVRPTW with both full and partial recharging cases, and attempted to solve those optimally using branch-price-and-cut algorithms. Recently, Duman et al (2021) developed exact and heuristic methods based on branch-and-price-and-cut to sovle the same problem, and presented new best solutions. Cortés-Murcia et al (2019) extended the EVRPTW where the customer can be served via alternative transportation methods (walking, bikes, drones, etc.)…”

Section: Literature Reviewmentioning

confidence: 99%

Electric vehicle routing problem with flexible deliveries

Sadati

Akbari

Çatay

2022

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

In the past few years, growing concerns about the climate change have forced governments to initiate tighter environmental regulations and tougher emission reduction targets.These initiatives have increased the interest on alternative fuels and heightened the public awareness on electromobility. To cut their dependency on fossil fuels, logistics operators started employing electric vehicles (EVs) in their fleet, which brings in additional challenges to their operational planning. In addition, with an ever-growing interest in e-commerce, parcel delivery is taking new shapes by offering flexible delivery options to the customers. To mitigate these issues, we introduce the Electric Vehicle Routing Problem with Flexible Deliveries (EVRP-FD), where the customers are served using a fleet of EVs that can recharge their batteries along their routes.In this problem, a customer may specify multiple delivery locations and the delivery can be made to one of these locations within its predetermined time window. Our objective is to minimize the total distance travelled by using minimum number of vehicles in the fleet. We first formulate the mathematical model of the problem. Next, we develop a hybrid Variable Neighborhood Search method coupled with Tabu Search by proposing new mechanisms to solve the problem effectively.Then, we verify the performance of our algorithm on instances published in the literature. We also introduce new instances for the EVRP-FD and perform an extensive computational study to investigate the trade-offs associated with different operational factors. Finally, we present a case study in Nottingham, UK to provide further insights.

show abstract

Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows

Cited by 31 publications

References 54 publications

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

An electric vehicle routing model with charging stations consideration for sustainable logistics

Electric vehicle routing problem with flexible deliveries

Contact Info

Product

Resources

About