Abstract

This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. In this paper, a solution approach based on tabu search (TS) is proposed. In the proposed TS, the sequential insertion (SI) algorithm is used to construct an initial solution. A neighbor structure is generated by applying an operator order consisting of eleven operators of relocation, exchange, and crossover operators. A tabu solution code (TSC) method is applied as a tabu restriction mechanism. Computational experiments are carried out to examine the performance of the proposed TS using hypothetical instances. The performance of the proposed TS is compared to the local search (LS) and the genetic algorithm (GA). The comparison shows that the proposed TS is better in terms of the objective function value.

Highlights

  • This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP)

  • The proposed tabu search (TS) is compared to the genetic algorithm (GA) proposed previously by Suprayogi and Mahaputra [34]

  • The third component in the objective function is changed from the maximum of tour duration time (MDT) to the range of tour duration time (RDT)

Read more

Summary

Introduction

This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) includeing the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. The characteristic of multiple trips indicates that each vehicle may perform more than one route or trip during a planning horizon. One of real VRPs discussed in this paper is a delivery and pickup of the liquefied petroleum gas (LPG) tubes. Each LPG retailer has a delivery demand of filled tubes and a pickup demand of empty tubes. Each retailer has a time window where unloading of filled tubes and loading of empty tubes must be carried out. Trucks carrying filled tubes depart from the depot to the retailers and return to the depot to carry empty tubes from the retailers

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call