The Maritime Inventory Routing Problem (MIRP) is a complex combinatorial optimization problem that involves the routing of a heterogeneous fleet of ships and the management of inventories in producing and consuming ports. Due to peculiarities of the maritime environment, such as significant loading and unloading times and berthing restrictions in ports, adapting solutions to similar routing problems is not trivial, making MIRP a unique challenge. This study proposes the application of meta-heuristics to find effective solutions, especially for large instances where exact methods have been shown to be unfeasible. Using a framework based on Iterated Local Search, several approaches to representations of solutions with different construction algorithms, neighborhoods and disturbances are combined. This methodology allows exploring several possibilities and identifying the most appropriate ones for the context of maritime routing. In addition, the project aims to develop a library in Julia capable of reading MIRPLib instances, which is a set of instances published in 2017 by Papageorgiou et al., 2017, used to evaluate and compare the performance of solutions with other solutions in the literature.