This paper considers a multi-depot heterogeneous vehicle routing problem (MDHVRP) with time windows, which is very crucial for hazardous materials transportation. For this reason, we formalize as multi-objective MDHVRP optimization model, where the actual load dependent risk of transportation considered. To solve problem, propose hybrid evolutionary algorithm (HMOEA) and two-stage (TSA). In add...

T fleet size and mix vehicle routing problem with time windows (FSMVRPTW) is the problem of determining, at the same time, the composition and the routing of a fleet of heterogeneous vehicles aimed to serve a given set of customers. The routing problem requires us to design a set of minimum-cost routes originating and terminating at a central depot and serving customers with known demands, with...

Abstract In this paper, we study the recently introduced time-constrained maximal covering routing problem. problem, are given a central depot, set of facilities, and customers. Each customer is associated with subset facilities which can cover it. A feasible solution consists k Hamiltonian cycles on subsets depot. cycle must contain depot respect distance limit. The goal to maximize number cus...

In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the same route back. In this study, we present a modified Clarke-Wright parallel savings algorithm, a nearest insertion algorithm and a tabu search heuristic for the open vehicle routing problem with time deadlines. Some ra...

Transport on-demand is an issue in the Vehicle Routing Problem which involves transporting a collection of goods from source (depot) to their destination (customers) and inversely. This paper analyzes forecasts viability using discrete event systems subset this general problem known as pickup delivery problems literature projects on automated manufacturing cell with optimization approach for ve...

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood op...

We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite tr...

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

A typical vehicle routing problem can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points (cities, stores, warehouses, schools, customers etc). The routes must be designed in such a way that each point is visited only once by exactly one vehicle, all routes start and end at the depot, and the total demands of all points on one pa...