In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations In this paper we discuss several characteristics that distinguish them from standard vehicle routing problems and present a survey of the problem types and solution methods found in

† $ \‚ \ ‚ `‰ ` ¡  ‡ ‰ ¡ ¡ ‡ ¡ ¡ ¡ ‰ `\  ‚ ‰  ‚ \‚ ‰\ ‰ $   $‰ • ¡ ••  ‰ ••   ‰ $  ` ` ‰ ‡  ‚ ‡ ‚‰ ‚ ‰ ‰•  † $ ‰ $ \‚ \ ‚ `‰ ‚‰ « ¦ ‰ ¡ ‚ † $ ¢ ‚ `‰ ¬ †¢­ ¡ ‡  ¡ $ ¡‚ ‰ $ ‡ • ‰ ‰$¡ ‰ ¥\ ‰ † ‰ ¡ •  ‚  ‚‚   §¡ ‰ †¢ ¦ ‰ ‚‚ $  „ ¤ † `‰ ¬ ® ̄®­ ‰ ±¢‹¡ ¦¡ ¡ ‰  `\‚ 2  ` ‚ \ ` ¤ \ ‚ ` 3 ̄μ  ‡ ‚ ‡ ‰ • ¡  ‰  \ ‚ ` ¡ ‡  \$ • ¦ ‰ • `$‚ ‰ ¡ ‡  \ \ ‰ ‰ • ¡ ‰ \ ‚ `‰   ` ...

today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

The Vehicle Routing Problem of Logistics park distribution (VRPLPD) is an extension of the vehicle routing problem, which deals with simultaneous distribution of goods to customers. With the increasing importance of logistics activities, it is of great theoretical and practical significance to determine efficient and effective vehicle routes for simultaneous delivery activities. The study attem...

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants. The VRP is classified as an NP-hard problem. Hence, the use of exact optimization methods may be difficult to s...

The Vehicle routing problem with multiple use of vehicles is a variant of the standard vehicle routing problem in which the same vehicle may be assigned to several routes during a given planning period. A tabu search heuristic is developed for this problem. It is shown to produce high quality solutions on a series of test problems.

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restoc...