{"title":"A heuristic approach to optimizing the loading of homogeneous marine cargo","authors":"Michał Bernardelli","doi":"10.37190/ord220201","DOIUrl":null,"url":null,"abstract":"In this article, the optimal loading of homogeneous marine cargo is considered. A mathematical formulation in terms of a mixed-integer linear program can be given. Still, the level of complexity turns out to be too high to perform full-scale computations. On the one hand, the reasons for this are the multitude of variables and constraints. On the other hand, feasible solutions to such problems may often be economically unacceptable or simply empty. Therefore, a heuristic is presented, according to which the relaxation of the limiting conditions influencing the solution’s feasibility and its economic profitability was parametrized. Under this heuristic, shifting the deadlines of selected orders is allowed. Also, the assignment of orders to vessels is separated from the allocation of vessels to piers in loading and unloading ports. The solution presented can be easily generalized by adding additional restrictions or features like indirect vessels, founding cost, or differentiation between materials.","PeriodicalId":43244,"journal":{"name":"Operations Research and Decisions","volume":"37 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research and Decisions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37190/ord220201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
In this article, the optimal loading of homogeneous marine cargo is considered. A mathematical formulation in terms of a mixed-integer linear program can be given. Still, the level of complexity turns out to be too high to perform full-scale computations. On the one hand, the reasons for this are the multitude of variables and constraints. On the other hand, feasible solutions to such problems may often be economically unacceptable or simply empty. Therefore, a heuristic is presented, according to which the relaxation of the limiting conditions influencing the solution’s feasibility and its economic profitability was parametrized. Under this heuristic, shifting the deadlines of selected orders is allowed. Also, the assignment of orders to vessels is separated from the allocation of vessels to piers in loading and unloading ports. The solution presented can be easily generalized by adding additional restrictions or features like indirect vessels, founding cost, or differentiation between materials.