This vehicle routing problem involves finding a set of trips, one for each vehicle and to pick up known quantities of perishable goods from a set of geographically dispersed suppliers to the cargo terminal of an international airport in south India. The pickup time is based on the deterministic departure time of the flights. The objective of this Vehicle routing problem with Pickup and Delivery...

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

Artificial Intelligent (AI) techniques make a great influence on real-world distribution operations due to the complexity and the difficulty of finding an optimal solution within the limited time frame. To bridge the gap between standard problems in distribution and the real world problems, in this research, the standard VRP problem is extended to Multi Depot Vehicle Routing Problem with Time W...

This work examines the Capacitated Vehicle Routing Problem with Balanced Routes and Time Windows (CVRPBRTW). The problem aims at optimizing the total distance cost, the number of vehicles used, and the route balancing, under the existence of time windows and other constraints. The problem is formulated as a Multi-Objective Optimization Problem where all objectives are tackled simultaneously, so...

Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The elements that characterize it are mainly the presence of multiple objectives, constraints concerning multiple time windows, heterogeneous fleet, maximum duration of the subtours, and multiple visits. Two variants of the...