In this paper two new Mixed-integer linear programming models for fuel based vehicle routing problem are introduced. By considering the refueling accessibility in customer nodes, these models are formulated as a Fossil Fuel Capacitated Vehicle Routing Problem with Time Windows and the Green Bi-fuel VRPTW. A fuel delivery routing problem is a real world application of these models. Environmental...

   In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...

An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers squared. New replicable test problems that capture the typical speed variations of congested urban settings are pr...

This paper presents a hybrid evolutionary algorithm (HEA) to solve heterogeneous fleet vehicle routing problems with time windows. There are two main types of such problems, namely the fleet size and mix vehicle routing problem with time windows (F) and the heterogeneous fixed fleet vehicle routing problem with time windows (H), where the latter, in contrast to the former, assumes a limited ava...

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...

The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as operators to address the vehicle routing problem with time windows (VRPTW). We show that it allows to extend the self-organizing map to deal with a version of the vehicle routing problem with time windows where the number of vehicles is an input, and by adding some walking distance from customers t...

In this work we present a method to be used in decision support system (DSS), which solve the Vehicle Routing Problem with Time Windows. In order to find a good estimation of customers’ delivery time, we consider the fluctuations of the travel time. Solving the routing problems with time constraints without taking into account the fluctuations of the travel time during the day, can lead to seri...