Nourmohammadzadeh, Abtin
[Verfasser:in]
;
Hartmann, Sven
[Mitwirkende:r];
Westphal, Stefan
[Mitwirkende:r]
Mathematical modelling with exact, heuristic and meta-heuristic solution methodologies for the fuel-efficient platooning of heavy duty vehicles on road networks
Titel:
Mathematical modelling with exact, heuristic and meta-heuristic solution methodologies for the fuel-efficient platooning of heavy duty vehicles on road networks
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
As the demand for road transportation steadily increases and simultaneously the fuel price grows, transportation companies face with more challenges to reduce their costs, and more importantly, to mitigate the resulted environmental impacts. One promising approach for the sake of fuel consumption reduction is to make Heavy Duty Vehicles (HDVs) drive together in groups called "platoon" behind each other and in close prox- imity like a string. This reduces the aerodynamic drag or resistive force on vehicles and as a result less energy or fuel is required for the same movement. Another benet of platooning is that so the trac congestion of road networks can be lessened. Al- though the idea of platooning has been proposed since long ago, its realisation has only become recently possible due to the late advances in information, communications and computation technology. This doctoral thesis proposes a novel and unique approach to Fuel Ecient Platooning (for ease called FEP in the thesis) on large scale road networks. Two dierent mathematical models are presented which formulate the FEP problem from dierent aspects. Several real-life attitudes such as travel time constraints, maximum allowable distance, and also multiple speeds for vehicles are embedded in the models, which have not been addressed together in any previous work in the literature. Consequently, the main contributions, which are our solution methodologies are pro- posed in three categories. They gradually enable us to tackle bigger sizes of the problem. The rst one is attempting the exact solution of the two models by the powerful solver of CPLEX in the GAMS platform. Due to very high computational complexity, some changes are applied to the models to reduce the complexity and increase the biggest solvable size of the problem by the exact solver. The results of the two models and their decomplexied versions are compared together. Due to the limitations of exact solution approaches in terms of problem scale and the required execution time, heuristic ...