#TITLE_ALTERNATIVE#

• Main Author: BACHTIYAR (NIM: 23412029), CANDRA
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/26192
• Institution: Institut Teknologi Bandung

<p align="justify">Capacitated green vehicle routing problem (CGVRP) is an extension of green vehicle routing problem (GVRP). It characterized by focusing on the environmental and economic costs by implementing effective routes to meet the environmental concerns while fulfilling customer demand. Mathematical model of CGVRP is formulated and a simulated annealing (SA) heuristic is proposed for its solution. CGVRP formulated as a mixed integer linear program (MILP). The objective of CGVRP is minimizing <br /> <br /> total travel distance which using an alternative fuel vehicle (AFV). Numerical experiment and sensitivity analysis are conducted based on Erdogan and Miller-Hooks (2012) with random of demand. Result of numerical experiment shows that SA algorithm is capable of obtaining good CGVRP solutions within a reasonable amount of time. A small amount vehicle capacity cause increasing total travel distance until 35%. The sensitivity analysis shows that the vehicle capacity effect to the total travel distance. The largest number of vehicle capacity reduces travel distance and the total travel distance is dependent on the number of customer and the vehicle driving range.<p align="justify">