one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

The main objective of this paper is to propose a new hybrid algorithm for solving the Bi green vehicle routing problem (BGVRP) from BicriterionAnt metaheuristic. methodology used subdivided as follows: first, we introduce data GVRP or instances literature. Second, use first cluster route second technique using k-means algorithm, then apply BicriterionAntAPE (BicriterionAnt Adjacent Pairwise Exc...

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

The soft-clustered vehicle routing problem (Soft-CluVRP) is a relaxation of the clustered (CluVRP), which in turn variant generalized (GVRP). aim Soft-CluVRP to look for minimum cost group routes starting and ending at given depot set customers partitioned into priori defined, mutually exclusive exhaustive clusters, satisfying capacity constraints vehicles with supplementary property that all f...

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

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

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

Recent decades have seen increasing utilization of optimization packages, based on Operations Research and Mathematical Programming techniques, for effective management the provision goods services in distribution systems. Large numbers real-world applications widely shown that use computerized procedures process planning produces substantial savings (generally from 5% to 20%) global transporta...