SEQUENTIAL INSERTION ALGORITHM FOR SOLVING HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM WITH MULTIPLE TRIPS, SPLIT DELIVERY AND TIME WINDOW

• Main Author: (NIM : 23409005); Pembimbing : Suprayogi, Ph.D, WINARNO
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/17572
• Institution: Institut Teknologi Bandung

Heterogeneous fixed fleet vehicle routing problem with mulitple trips, split delivery and time window is a route and scheduling problem of vehicle, where the <br /> <br /> <br /> vehicle consist of some types and limited number. The vehicle does some trips in the one tur and one customer can be visited some vehicles for fulfilling demand. <br /> <br /> <br /> The vehicles do trip to customer in the time window. <br /> <br /> <br /> This case has been solved use sequential insertion algorithm approach to get recent solution. Then be continued recent solution improvement using local search <br /> <br /> <br /> technique with relocation 1-0 for minimizing total distribution cost. The major improvement to arrange the sequential insertion algorithm are expanding customer time window gradually until all demand fulfilled when <br /> <br /> <br /> shortage of vehicles. This research proposes penalty cost for compensate violating customer time window. The relocation 1-0 operator move node from one route to <br /> <br /> <br /> other route intra tur and inter tur to improve the solution. Increasing of loading-discharging and vehicle speed decrease objective function, whereas increasing of demand and penalty cost increase objective function. <br /> <br /> <br /> Developed sequential insertion algorithm can solve limited homogenous and nontime window case, but these cannot solve single trip and non split delivery case.