Revistes Publicacions URV: SORT - Statistics and Operations Research Transactions> 2020

Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities

  • Datos identificativos

    Identificador: RP:4901
    Handle: https://hdl.handle.net/20.500.11797/RP4901
    Autores:
    Ouelhadj, DjamilaJuan, Angel A.Chica, ManuelEskandarpour, MajidHatami, Sara
    Resumen:
    The introduction of Electric Vehicles (EVs) in modern fleets facilitates green road transportation. However, the driving ranges of EVs are limited by the duration of their batteries, which arise new operational challenges. Hybrid fleets of gas and EVs might be heterogeneous both in loading capacities as well as in driving-range capabilities,whichmakes the design of efficient routing plans a difficult task. In this paper, we propose a newMulti-Round IteratedGreedy (MRIG) metaheuristic to solve the Heterogeneous Vehicle Routing Problem with Multiple Driving ranges and loading capacities (HeVRPMD). MRIG uses a successive approximations method to offer the decision maker a set of alternative fleet configurations,with different distance-based costs and green levels. The numerical experiments show that MRIG is able to outperform previous works dealing with the homogeneous version of the problem, which assumes the same loading capacity for all vehicles in the fleet. The numerical experiments also confirm that the proposed MRIG approach extends previous works by solving a more realistic HeVRPMD and provides the decision-maker with fleets with higher green levels.

  • Otros:

    Autor según el artículo: Ouelhadj, Djamila Juan, Angel A. Chica, Manuel Eskandarpour, Majid Hatami, Sara
    Palabras clave: vehicle routing problem
    Resumen: The introduction of Electric Vehicles (EVs) in modern fleets facilitates green road transportation. However, the driving ranges of EVs are limited by the duration of their batteries, which arise new operational challenges. Hybrid fleets of gas and EVs might be heterogeneous both in loading capacities as well as in driving-range capabilities,whichmakes the design of efficient routing plans a difficult task. In this paper, we propose a newMulti-Round IteratedGreedy (MRIG) metaheuristic to solve the Heterogeneous Vehicle Routing Problem with Multiple Driving ranges and loading capacities (HeVRPMD). MRIG uses a successive approximations method to offer the decision maker a set of alternative fleet configurations,with different distance-based costs and green levels. The numerical experiments show that MRIG is able to outperform previous works dealing with the homogeneous version of the problem, which assumes the same loading capacity for all vehicles in the fleet. The numerical experiments also confirm that the proposed MRIG approach extends previous works by solving a more realistic HeVRPMD and provides the decision-maker with fleets with higher green levels.
    Año de publicación de la revista: 2020
    Tipo de publicación: ##rt.metadata.pkp.peerReviewed## info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article

  • Palabras clave:

    vehicle routing problem

  • Documentos:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar