Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles
with limited capacity from a central depot to a set of geographically dispersed customers with …

In this study, we introduce a logistic model for the delivery of small parcels to a set of service
points (SPs), and we present effective methods for solving it. In the traditional delivery …

As shown in recent researches, the costs in distribution systems may be excessive if routes
are ignored when locating depots. The location routing problem (LRP) overcomes this …

The coordination of just-in-time production and transportation in a network of partially
independent facilities to guarantee timely delivery to distributed customers is one of the most …

The paper considers heterogeneous fixed fleet vehicle routing with carbon emission to
minimizing the sum of variable operation costs. A cost-benefit assessment of the value of …

In this study, we consider the application of a simulated annealing (SA) heuristic to the truck
and trailer routing problem (TTRP), a variant of the vehicle routing problem (VRP). In the …

A generalization of the traditional vehicle routing problem (VRP) is studied in this paper.
Each customer may order several products, the vehicles are identical and have several …

This paper introduces a new hybrid algorithmic nature inspired approach based on particle
swarm optimization, for successfully solving one of the most popular supply chain …

This chapter proposes new VRP heuristics based on Iterated Local Search (ILS): a pure ILS,
a version with several offspring solutions per generation, called Evolutionary Local Search …

We present an adaptation of the active-guided evolution strategies metaheuristic for the
capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical …