In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with traditional fuel. The vehicle may change propulsion mode at any point of time. The unitary travel cost is much lower for distances covered in the electric mode. An electric battery has a limited capacity and...

I the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same ...

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...

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...