Abstract Suppose that one is given a Vehicle Routing Problem (VRP) on road network, but does not have access to detailed information about network. One could obtain heuristic solution by solving modified version of the problem, in which true distances are replaced with planar Euclidean distances. We test this heuristic, two different types VRP, using real network data for twelve cities across w...

In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which three-dimensional shapes of transported cargo are accounted for. This approach, in contrast to the standard capacitated VRP (CVRP) formulation, is appropriate when transported commodities are not perfectly divisible, but have fixed and heterogeneous dimensions. However, nesting a version of a threedim...

In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors address...

This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geogr...

An optimal evacuation route plan has to be established to overcome the problem of poor coordination and uneven distribution of vehicles before or during disaster. This article introduces the evacuation vehicle routing problem (EVRP) as a new variant to the vehicle routing problem (VRP). EVRP is a process of moving vehicles from a vehicle location to the potentially flooded area (PFA), and from ...

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

Over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. These aspects are the economic, the environmental, the social and the safety aspects. In the Vehicle Routing Problem (VRP) literature, the economic issue has often been used, while the environmen...