HOW TO COMBINE VAM AND DIJKSTRA’S ALGORITHM

Abstract

Solving transportation problems sometimes does not only require using one method or algorithm. Sometimes it is necessary to use several methods or algorithms at once. In this research, combining the Vogel’s Approximation Method (VAM) and Dijkstra algorithm can be carried out if three assumptions are met. These three assumptions are based on the characteristics of each VAM and Dijkstra’s algorithm, as well as the compatibility between the two