Abstract The issue of carbon emission reduction has attracted extensive attention in academic circles, but there are few studies on the Pareto frontier analysis multi-depot green vehicle routing problem with multi-objective. In order to effectively balance economic and environmental effects, this paper constructs a bi-objective optimization model for open problems time windows, which takes oper...

The subject of the thesis is to investigate the dynamic version of the well-known vehicle routing problem in order to improve the performance of existing algorithms as well as to develop new algorithms. I would like to express my gratitude to Transportrådet for their belief and interest in this project. Next, I would like to thank my thesis advisor, professor Oli B.G. Madsen, for his support an...

Abstract In this paper, a new variant of the electric vehicle (EV) routing problem, which considers heterogeneous EVs, partial recharge, and recycling, is investigated based on logistic companies' practical operation. A mixed integer linear programming (MILP) model proposed to formulate problem. For small-scale scenarios, commercial solver, e.g., CPLEX, leveraged. large-scale instances faced by...

Due to the recent worries about environment, transportation companies are incentivized use Alternative Fuel Vehicles (AFVs) instead of conventional ones. However, due limited AFV driving range and since Stations (AFSs) usually not widespread on territory, routes AFVs have be properly planned in order prevent them from remaining without sufficient fuel reach depot or closest station. The Green V...

The vehicle routing problem (VRP) in trees is a restriction of the general vehicle routing problem in which the underlying graph is a tree. In this paper, we introduce several NP-complete variants of the problem (e.g., common-source, common-destinations, in-place, flexiblerequests, and bring-it-back), and we present five fast approximation algorithms for these variants. We mainly focus on the 2...