Modeling the Bulk Port Belt-Conveyor Routing Problem Considering Interactions With Storage Spaces and Loading Operations

Abstract

In bulk port supply chains, products move from several source points (storage sheds) to various destination points (other storage sheds or vessels and trucks’ loading stations). The concern in such ports is increasing the value of delivering customer-specific products on time by choosing the best transportation routes among a complex real-world belt-conveyor routes network. This routing problem plays a crucial role in reducing charges related to waiting and tardiness in loading and stocking operations. In this paper, we propose a mixed integer linear program that considers jointly: routing constraints and interactions with stocking and loading operations. We propose a second model with pre-processing and reduction techniques to enhance computational performance. The two models are tested on 126 generated instances with up to 1590 routes (the real matrix of routes of a real industrial application). The results reveal a striking difference between the first and the second models in terms of $(i)$ the number of instances that could be handled (6 versus 111 out of 126); $(ii)$ the number of instances solved to optimality (5% versus 71%). The models are promising and respond to the needs regarding integration between the routing, which is the main operation in the fertilizer and phosphate port supply chain, and other operations, such as stocking and loading. The integration of the proposed models toward a real-time planning/control integrated system is discussed.

Keywords

• Complex transportation routes' matrix
• destination points
• problems’ interaction constraints
• routing constraints
• routing problem
• source points