#TITLE_ALTERNATIVE#

• Main Author: ARVIANTO (NIM: 23406023), ARY
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/11877
• Institution: Institut Teknologi Bandung

Vehicle Routing Problem represent problems of vehicle route determination having the character of hard combinatorial that has received a lot of attention in operation research literature. Various VRP variant have emerging in many research. Existence of multiple compartments and product, the enabling of multiple trips and split delivery represent. aspect problems of VRP which have developed by Komara ( 2006), but many real case where cutomer consider service time using arrangement of open and closed work time which more than once in one certain horison planning (multiple time windows). It is important, on one hand to, multiple time windows wide applicability in real world cases and practically setting, and on the other hand this model represents NP-hard aspect. Problem of this research concerning determination sum up and vehicle route to the condition of multiple time windows with multiple compartments and product, multiple trips and split delivery aspect consideration. To solve this problem, first step is develop mathematics based on former models, and then solves the mathematics model with heuristic by developing sequential insertion algorithm and relocation 1-0 based on Komara research. The algorithms are implemented in Local Search (LS) technique that used trouble-shooting base in this research. Last step is conducted model verification with examination use hipotetic data and also NTT and Timor leste data, then conduct analysis of algorithm, the ability of model application, and change of parameter analysis and also investigate the effect. <br /> <br />