this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

Following the occurrence of unexpected events and natural disasters, a highly important relief operation is the transferring of relief commodities from the distribution centers (CDs) to shelters. In this paper, a three-level network consisting of depot of vehicles, distribution centers and shelters has been considered for routing and scheduling of relief vehicles through introducing a multi-obj...

Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. We consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each veh...

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

This paper introduces a green inventory routing problem with a heterogeneous fleet which extends the conventional inventory routing problem by considering environmental impacts and heterogeneous vehicles. A comprehensive objective is proposed, which minimizes the sum of inventory cost and routing cost, where the latter includes driver wage, vehicle fixed cost, fuel and emission costs, in which ...

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

The purpose of this research is to present a new mathematical modeling for a vehicle routing problem considering concurrently the criteria such as distance, weight, traffic considerations, time window limitation, and heterogeneous vehicles in the reverse logistics network for collection of expired products. In addition, we aim to present an efficient solution approach according to differential ...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a heterogeneous #eet of vehicles with various capacities, "xed costs, and variable costs. This article describes a tabu search heuristic for the HVRP. On a set of benchmark instances, it consistently produces high-quality solutions, including several new ...