We present a novel variation of the vehicle routing problem VRP . Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service 1-VRPPD . 1-VRPPD deals with multiple vehicles and is t...

the problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. the purpose of this paper is to develop a vehicle routing problem (vrp) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

The objective of vehicle routing problem (VRP) is to design a set of vehicle routes in which a fixed fleet of delivery vehicles from one or several depots to a number of customers have to be set with some constraints. To this date in the literature, many instances of VRP model have been introduced and applied for various types of scheduling problems. However, when implemented in a real life app...

Abstract: In order to solve the vehicle routing problem with pickup and delivery (VRPPD), this paper proposed an improved quantum genetic algorithm based on different constraint conditions. Firstly, a mathematical model was established aiming at minimizing the dispatching time and the total cost. Secondly, the paper proposes the improved quantum genetic algorithm and non dominated sorting strat...

This paper considers a special vehicle routing problem, the two-echelon problem with simultaneous delivery and pickup demands (2E-VRPSDP). The 2EVRPSDP differs from classic transportation problems in two ways. First, freight depot to customers is managed by shipping through intermediate satellites. Second, each customer 2E-VRPSDP may have demands. an extension of (2E-VRP) (VRPSDP). A variable n...

Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. A widely-encountered type of PDP is the Stacker Crane Problem (SCP), where each commodity/customer is associated with a pickup location and a delivery location, and the objective is to find a minimum-length ...

In this paper, we introduce a new variant of Location-Routing Problem (LRP), namely the LRP with simultaneous pickup and delivery (LRPSPD). The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demand of each customer must be performed with same vehicle and the overall cost is minimized. We propose two polynomial-size mixed ...

This paper studies the vehicle scheduling problem in cities for the pickup and delivery service. Considering customer point as vehicle collaboration point, we propose a two-stage algorithm based on customer point collaboration through the theory of optimization. In addition to considering the problem whether the isolated customer point is collaborative, the algorithm also takes into account the...