Solving a stochastic programming with recourse model for the stochastic electric capacitated vehicle routing problem using a hybrid genetic algorithm

Elhassania Messaoud

European Journal of Industrial Engineering, 2022, vol. 16, issue 1, 71-90

Abstract: This study considers stochastic travel times in an electric capacited vehicle routing problem (ECVRP), where the used electric vehicles may need to visit charging stations due to their battery capacities. The main goal of the present paper is to solve a two-stage stochastic programming with recourse (SPR) model for this problem using a hybrid genetic algorithm (HGA) and a Monte Carlo sampling (MCS) procedure. To show the effectiveness of the proposed approach, the computational experiments are applied to 29 instances with up to 100 customers derived from benchmarks presented in the literature. Firstly the numerical results are compared to those found by CPLEX solver for the deterministic model, thereafter a very large number of scenarios is taken into consideration to evaluate this approach in the stochastic environment using a known probability distribution. [Received: 26 September 2020; Accepted: 5 February 2021]

Keywords: transport problem; electric vehicles; capacity constraint; stochastic travel times; stochastic programming with recourse model; genetic algorithm. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=119367 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:16:y:2022:i:1:p:71-90

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().