Minimizing the handling time in VRP with pickup-and-delivery and time windows

Abstract

Improving services through goods pickups and deliveries to expand the market is currently being carried out by many companies. This effort needs another step of optimization to avoid losses due to additional resources, such as time, which must be held by the company. In the case of simultaneous goods pickups and deliveries using a vehicle with single transport access, the policy of arranging goods in the vehicle can affect the length of time for service. Single transport access causes goods that want to be unloaded obstructed by the other goods, thus requires additional time for handling. In this paper, the problem of a vehicle’s route and handling time in picking and delivering goods with time windows is modeled as the Traveling Salesman Problem. The objective function of this problem is to minimize the total travel time and handling time during the picking and delivering goods. The model is implemented in the case of bicycle pickup and delivery services involving 15 bicycle shops. The capacity of the vehicle is 15 units of bicycle. In this case, a solution consisting the pickup and delivery route and optimal goods order is obtained with an objective function value of 334 minutes.

Optimizing the Process of Pick-Up and Delivery With Time Windows Using Ant Colony and Tabu Search Algorithms

“…This study uses the model and data in [1]. There is a bicycle shuttle case involving 14 bicycle shops in Bogor as a sample of customers and 1 as a depot.…”

“…Equation ( 18) -(20) are the sub-tour elimination constraints that guarantee the formation of a complete route. Equations (21) through (24) state the characteristics of each of the variables involved [1].…”

“…The ACOTS algorithm was then applied to the TSPPDHTW case as a continuation of [1] to solve the TSPPDHTW using the exact method with a computation time of about 134 hours with device specification Core I3 memory and 8GB VGA Intel Grafis. In this study, the case was solved using the heuristic method through the ACOTS Algorithm to accelerate the acquisition of a solution.…”

“…Therefore, so that the delivery process can be carried out effectively, in addition to determining the best route, a strategy for preparing goods in the vehicle is needed so that is can minimize the total travel and handling time. In [1] this can be categorized as solving the Traveling Salesman Problem and Pick-up and Delivery with Handling Costs and Time Windows (TSPPDHTW).…”

“…The TSPPDHTW case has been modeled by [1] and solved using the exact method. However, the search for solutions using exact methods has not succeeded in showing the efficiency model to be applied in real life.…”