An Adaptive Memetic Algorithm for Dynamic Electric Vehicle Routing Problem with Time-Varying Demands

Na Wang, Yihao Sun and Hongfeng Wang

Mathematical Problems in Engineering, 2021, vol. 2021, 1-10

Abstract:

Dynamic electric vehicle routing problem (DEVRP) is an extension of the electric vehicle routing problem (EVRP) into dynamic logistical transportation system such that the demand of customer may change over time. The routing decision of DEVRP must concern with the driving range limitation of electric vehicle (EV) in a dynamic environment since both load degree and battery capacity are variable according to the time-varying demands. This paper proposes an adaptive memetic algorithm, where a special encoding strategy, an adaptive local search operator, and an economical random immigrant scheme are employed in the framework of evolutionary algorithm, to solve DEVRP efficiently. Numeric experiments are carried out upon a series of test instances that are constructed from a stationary VRP benchmark. The computational results show that the proposed algorithm is more effective in finding high-quality solution than several peer algorithms as well as significant in improving the capacity of the routing plan of EVs in dynamic transportation environment.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/6635749.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/6635749.xml (text/xml)

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:hin:jnlmpe:6635749

DOI: 10.1155/2021/6635749

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().