An Algorithm for Computing Solutions to the Range Limited Routing Problem Using Electrical Trucks
Increasing urban intensification has caused civic planners to devote additional resources to more appropriate logistics planning. Electric vehicles have proved to be both a lower cost alternative and more environmentally friendly than the more ubiquitous internal combustion engine vehicles. However,...
Gespeichert in:
Veröffentlicht in: | WSEAS TRANSACTIONS ON COMPUTERS 2020-03, Vol.19, p.47-53 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Increasing urban intensification has caused civic planners to devote additional resources to more appropriate logistics planning. Electric vehicles have proved to be both a lower cost alternative and more environmentally friendly than the more ubiquitous internal combustion engine vehicles. However, prevailing decision-making formulations employed by municipalities and businesses are not necessarily computationally conducive for the evaluation and optimization of urban transportation systems using electric vehicles. An innovative computational approach, the range limited routing problem, is introduced that enables urban planners to more readily evaluate the contributions of electric vehicles to the city logistics decision-making process. While there is no generalized solution technique for solving this new formulation, this paper employs the Firefly Algorithm (FA) metaheuristic to solve the range limited routing problem using electric trucks. |
---|---|
ISSN: | 1109-2750 |
DOI: | 10.37394/23205.2020.19.7 |