This paper proposes two new distance-constrained capacitated vehicle routing problems (DCVRPs) to investigate for the first time, and study potential benefits in flexibly assigning start and end depots. The first problem, DCVRP Fix is an extension of the traditional symmetric DCVRP, with additional service and travel time constraints, minimization of the number of vehicles and flexible applicat...

Aiming at the multi-depot heterogeneous vehicle routing problem under time-dependent road network and soft time window, considering fixed cost, window penalty cost transportation an optimization model of is established with objective minimizing distribution cost. According to characteristics problem, a hybrid genetic algorithm variable neighborhood search temporal–spatial distance designed. Cus...

How to reduce the accidents of hazardous materials has become an important and urgent research topic in safety management materials. In this study, we focus on half open multi-depot heterogeneous vehicle routing problem for transportation. The goal is determine allocation optimal route with minimum risk cost A novel transportation model presented considering variation loading, types, category. ...

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

The vehicle routing problem with time windows (VRPTW) is a representation of a wellknown transportation problem. It involves customers, depot, vehicles and constraints on delivery time (time windows) and capacity on vehicles. To minimize cost, the solution of a VRPTW problem must satisfy all the constraints while minimising the total distance for the lowest number of vehicles. Clearly an order ...