The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

We consider a Periodic Load-dependent Capacitated Vehicle Routing Problem (PLCVRP) encountered by medical centers and medical waste collection companies for the design of a weekly inventory routing schedule to transport medical wastes to treatment sites. In addition to minimization of transportation risk, occupational risk related to temporary storage of hazardous wastes at the health-care cent...

We consider a special case of the symmetric capacitated vehicle routing problem, in which a fleet of K identical vehicles must serve n customers, each with a given demand consisting in a set of rectangular two-dimensional weighted items. The vehicles have a two-dimensional loading surface and a maximum weight capacity. The aim is to find a partition of the customers into routes of minimum total...

This paper aims to present a generalized ontology model for the Vehicle Routing Problem (VRP) and it gives some out-plant material handling case studies. The is logistics task where customers with specific need products are served within least possible distance traveled by vehicles. has been highly investigated in operations research, computer science, transportation mathematics. As our new app...

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...