This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

Original languageEnglish
Article number012012
JournalIOP Conference Series: Materials Science and Engineering
Issue number1
Publication statusPublished - 10 Apr 2018
Event1st International Conference on Industrial and Systems Engineering, IConISE 2017 - Denpasar, Bali, Indonesia
Duration: 29 Aug 201730 Aug 2017


Dive into the research topics of 'Split delivery vehicle routing problem with time windows: A case study'. Together they form a unique fingerprint.

Cite this