Scheduling Carbon Dioxide Transfers Between Two Ports via Mixed-Integer Linear Programming and Heuristic Approaches
摘要
The optimization of CO \(_2\) transfers via ships between two ports is addressed by means of a scheduling approach based on the solution of a mixed-integer linear programming (MILP) problem. The goal is to keep the temporary storage buffers at the ports as empty as possible while satisfying suitable constraints. Since the solution of the optimization problem may be time consuming, a greedy heuristic based on a threshold mechanism is also presented. Owing to its reduced computational requirements, the heuristic can be successfully used to provide an initial solution for the MILP-based approach, thus improving performances. Preliminary simulation results are showcased to assess the effectiveness of the two approaches.