THE SHORTEST PATH PROBLEM SOLVING WITH TIME WINDOW FOR PERISHABLE PRODUCTS

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

According to Graf theory, the shortest path determination is a problem of looking for a path between two vertices in a weighted graph to obtain the minimum <br /> <br /> <br /> amount of weight. Therefore, the determination of the shortest path problem also called optimization problem for determining the trajectory of the point of origin to <br /> <br /> <br /> point of destination by minimizing costs. Several algorithms have been developed in solving this problem. Each algorithm has a different way of solving a particular problem. In this study, carried out the development of algorithms to determine the critical path from origin point to destination point on a network for the delivery of products that have deterioration and limited time window to minimize the total cost and the selection of vehicles that will be used for solving the problem. The Algorithm that developed is Dijkstra's algorithm. The first stages of development the algorithm is to modify the network of the problem study. Network <br /> <br /> <br /> modification is done by making the network replication. The second stage is to make problem-solving steps to minimize the total cost, consists of a fixed cost of <br /> <br /> <br /> the vehicle, variable cost of the vehicle, vehicle turnover costs, deterioration cost and parking fees with modified Dijkstra algorithm. Dijkstra modifications made <br /> <br /> <br /> since the problems studied can not be modeled mathematically. To test the developed algorithm, we used hypothetical data. Numerical examples in this study were the determination of the shortest path with time window and the determination of the shortest path without time window with a non-linear deterioration function.