This paper addresses a variant of the vehicle routing problem in which customers require
simultaneous pickup and delivery of goods during specific individual time windows …

The location and routing scheduling problems with cross-docking can be regarded as new
research directions for distribution networks in the supply chain. The aims of these problems …

Proliferation of multi-national corporations and extremely competitive business
environments have led to an unprecedented demand for third-party logistics services …

The use of mobile robots is growing every day. Path planning algorithms are needed to
allow the coordination of several robots, and make them travel with the least cost and …

The canonical firefly algorithm is basically developed for continuous optimization problems.
However, lots of practical problems are formulated as discrete optimization problems. The …

The capacitated vehicle routing problem (CVRP) is investigated in this research. To tackle
this problem, four state-of-the-art algorithms are employed: an improved intelligent water …

Organizations have recently become interested in applying new approaches to reduce fuel
consumptions, aiming at decreasing green house gases emission due to their harmful …

In this paper, a new mathematical model for a time-dependent vehicle routing problem
(TDVRP) is introduced as one of the sub-problems in the green VRP field. The model results …

In this paper, we consider the time-dependent multi-depot vehicle routing problem. The
objective is to minimize the total heterogeneous fleet cost assuming that the travel time …

We present a simulated annealing based algorithm for a variant of the vehicle routing
problem (VRP), in which a time window is associated with each client service and some …