The green marine waste collector routing optimization with puma selectison-based neighborhood search algorithm

Abstract

Improper waste disposal by humans has created significant environmental issues in the marine ecosystem, including endangering aquatic life and accelerating the extinction of certain marine species. Due to the floating nature of the marine debris, the coordinates for collecting activities must be estimated in advance. In this article, GNOME software is used to estimate the coordinates of debris, and then a fleet of several ships is used to collect them. Also, a mixed integer linear programming model is presented for the routing optimization of debris collection fleets. The proposed optimization model formulates the objective function based on numerous factors, including labor cost, rent, and ship insurance, and considers constraints on fuel tank capacity, the time window, and the ship's cargo capacity. A new hybrid algorithm combining the Puma algorithm and neighborhood search is proposed to address the problem. Metropolis acceptance is used in the simulated annealing algorithm to avoid the local optima and greedy selection. Numerical examples of the marine survey and the port of Rotterdam are used to test the proposed approach, which has been proven effective in several scenarios. Results achieved from the proposed hybrid method demonstrate considerable performance improvement in solving the problem. This approach has decreased total fuel and labor costs by 10-15% compared to conventional methods, with minimized time window violation reaching 25%. These results show a significant reduction in total operational costs with proper scheduling and route planning. Correction (DOI: 10.1007/s10586-024-05018-w): https://www.webofscience.com/wos/woscc/full-record/WOS:001409655100009