The multi-depot electric vehicle location routing problem with time windows

Paz, Juan Camilo; Echeverri, Mauricio Granada; Escobar, John Willmer

doi:10.5267/j.ijiec.2017.4.001

Cited by 50 publications

(30 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…More specifically, the methodology employs a genetic algorithm to solve the problem due to its computational difficulty. Similar difficult problems by using approximate algorithms were proposed by Bolaños et al (2015), Paz et al (2018) and Chávez et al (2016). The work proposed by Atan and Hüseyinoǧlu (2017) contains a similar study of the current work; the main difference is that our solution approach solves the problem optimality while at the same time is flexible enough.…”

Section: Review Of Literaturementioning

confidence: 78%

A flexible mathematical model for the planning and designing of a sporting fixture by considering the assignment of referees

Linfati

Gatica

Escobar³

2019

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper deals with the problems faced with the designing and planning of a sporting fixture considering correct referee assignments. A non-linear binary program model is proposed to solve the problems, which aims to minimize the sums of the differences that exist between the requirements of each match and the quality of the referee assigned achieving the design of the most adequate referee for each match. The efficiency of the proposed model is proved using some real data obtained from various fixtures for sports such as soccer, volleyball, and basketball. The mathematical model is solved by using CPLEX 12.7.0., which allows the automatic linearization of the problems. The results obtained demonstrate the efficiency of the proposed methodology for tackling problems, as well as its extension to other sporting disciplines, which require a similar type of planning. Similarly, given the robust nature of the proposed model, it is possible to implement other objective functions in accordance with the requirements of each league.

show abstract

Section: Review Of Literaturementioning

confidence: 78%

A flexible mathematical model for the planning and designing of a sporting fixture by considering the assignment of referees

Linfati

Gatica

Escobar³

2019

10.5267/j.ijiec

View full text Add to dashboard Cite

show abstract

“…Paz et al [86] addressed the multidepot electric vehicle location routing problem with time windows (MDEVL-RPTW) with three variants: (i) with BSS (MDEVLRPTW-BS); (ii) with partial recharging (MDEVLRPTW-PR) at CSs that could also be located at customers' locations; and (iii) with BSS and partial recharging (MDEVLRPTW-BSPR) where conventional charging is considered at customers' locations and battery swap is performed at a separately located BSSs. Three MIP models were presented for each case.…”

Section: Route Scheduling and Other Electric Variantsmentioning

confidence: 99%

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Erdelić

Carić

2019

Journal of Advanced Transportation

148

View full text Add to dashboard Cite

In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.

show abstract

“…They analyzed the effects of different objective functions. Paz et al (2017) also modeled the same problem considering multi depots and battery swapping option in some locations. integrated battery degradation into the model and optimized charging schedules at the depot.…”

Section: Related Literaturementioning

confidence: 99%

A matheuristic method for the electric vehicle routing problem with time windows and fast chargers

Keskin

Çatay

2018

Computers & Operations Research

160

View full text Add to dashboard Cite

The Electric Vehicle Routing Problem with Time Windows (EVRPTW) is an extension of the wellknown VRPTW where electric vehicles (EVs) are used instead of internal combustion engine vehicles. An EV has a limited driving range due to its battery capacity and may need recharging to complete its route. Recharging can be made at any battery level and may be at any quantity up to the battery capacity. Furthermore, the stations may be equipped with chargers with different power supply, power voltage, maximum current options which affect the recharge duration. In this study, we model the EVRPTW by allowing partial recharges with three recharging configurations which can be referred to as normal, fast and super-fast recharges. In faster options, the battery is charged with the same energy in a shorter time but at a higher cost. Our objective is to minimize the total recharging cost while operating minimum number of vehicles. We formulated this problem as a mixed integer linear program and solved the small instances using CPLEX. To solve the larger problems, we develop a matheuristic approach which couples the Adaptive Large Neighborhood Search (ALNS) approach with an exact method. Our ALNS is equipped with various destroy-repair algorithms to efficiently explore the neighborhoods and uses CPLEX to strengthen the routes obtained. We carried out extensive experiments to investigate the benefits of fast recharges and test the performance of our algorithm using benchmark instances from the literature. The results show the effectiveness of the proposed matheuristic and demonstrate the benefits of fast chargers on the fleet size and energy costs.

show abstract

The multi-depot electric vehicle location routing problem with time windows

Cited by 50 publications

References 19 publications

A flexible mathematical model for the planning and designing of a sporting fixture by considering the assignment of referees

A flexible mathematical model for the planning and designing of a sporting fixture by considering the assignment of referees

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

A matheuristic method for the electric vehicle routing problem with time windows and fast chargers

Contact Info

Product

Resources

About