This study provides an explanation of the use of metaheuristic methods to solve the Maritime Inventory Routing Problem (MIRP). MIRP is a variation of the Inventory Routing Problem (IRP) which uses ships to distribute products. This study presents and maps the factors that are considered and the objectives to be achieved for each study. Algorithms and calculation results from each metaheuristic method used for certain MIRP problems are also described therefor that they can be used as reference material for selecting the metaheuristic method to solve the MIRP problem being developed. From this research also shows that research on the use of metaheuristic methods to complete MIRP has a great opportunity to be developed.