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...

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 ...

The NP-hard problem of vehicle routing and scheduling problem with fuzzy time windows and fuzzy goal is formulated and two heuristic algorithms for solving this problem are presented.

Many types of transportation systems, for example, public transit and commercial freight hauling and package delivery, may be categorized as being fleet operations. The environmental impacts of fleet operations such as these are affected by factors including the initial choice and selection of vehicles (types) comprising the fleet, vehicle age and maintenance, and the modal conditions under whi...

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...

Vehicle Routing Problem (VRP) is a key element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve a set of customers It is required that these vehicles return to the depot after s erving customers’ d...

Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle routing problem with time-dependent travel times due to potential traffic congestion is considered. Th...

We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be non-convex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers ...

Insertion heuristics have proven to be popular methods for solving a variety of vehicle routing and scheduling problems. In this paper, we focus on the impact of incorporating complicating constraints on the efficiency of insertion heuristics. The basic insertion heuristic for the standard vehicle routing problem has a time complexity of O(n). However, straightforward implementations of handlin...