The present work deals with dynamic vehicle routing problems in which new customers appear during the design or execution of the routing. We propose a parallel Adaptive Large Neighborhood Search (pALNS) that produces high quality routes in a limited computational time. Then, we introduce the notion of driver inconvenience and deVne a bi-objective optimization problem that minimizes the cost of ...

The classical vehicle routing problem involves to design a set of routes for a fleet of vehicles based at one central depot that is required to service a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers’ demand are known. In many practical distribution ...

Bi-Objective Modelling for Hazardous Materials Road-Rail Multimodal Routing Problem with Railway Schedule-Based Space-Time Constraints.[...].

This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The problem is expressed as a bi-criterion optimisation with the mutually exclusive aims of minimising both the total mean transit time and the total variance in transit time. In this paper we introduce a hybrid dynamic programming an...

The linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW) is a new version of city logistics. Four important issues are explored and fifteen sample examples used for demonstration. First, the LFVRPTW always yields better results than the vehicle routing problem with time windows (VRPTW). Second, LFVRPTW is advantageous compared with VRPTW. Third, more virtual de...

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

In this paper two new Mixed-integer linear programming models for fuel based vehicle routing problem are introduced. By considering the refueling accessibility in customer nodes, these models are formulated as a Fossil Fuel Capacitated Vehicle Routing Problem with Time Windows and the Green Bi-fuel VRPTW. A fuel delivery routing problem is a real world application of these models. Environmental...

Reliability is an important metric for unmanned aerial vehicles (UAVs) to perform important, complex, and dangerous tasks. In addition, reliability influences the operational cost in UAVs routing. order reduce of tasks, a method routing strategy optimization proposed from view mission this paper address limitations scheduling. Different previous studies on problem, proposes that can costs tasks...