This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each must visit some pick up nodes first, for instance, warehouses to orders then makes deliveries customers in list. Each pickup node has its own list more than one requiring delivery. The objective is minimize total travelling cost while real-world application constraints, such as...

In the Vehicle Routing Problem with Time Windows, a set of customers are served by a eet of vehicles of limited capacity, initially located at a central depot. Each customer provides a period of time in which they require service, which may consist of repair work or loading/unloading the vehicle. The objective is to nd tours for the vehicles, such that each customer is served in its time window...

In emergency planning, consideration of emergency priorities is a necessity. This paper presents new formulations of the facility location problem (FLP) and vehicle routing problem with time windows (VRPTW) with considerations of priority. Our models ensure that higher priority locations are considered before the lower priority ones, for both facility and routing decisions. The FLP is solved us...

this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

In this paper we consider the vehicle routing problem with soft time window constraints (VRPSTW), in which vehicles are allowed to service customers before and after the earliest and latest time window bounds, respectively. This relaxation comes at the expense of appropriate penalties that re3ect the e4ect that time window violations have on the customers’ satisfaction. The problem is of partic...

This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost.  In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...