.png){kind=icon}
.png){kind=icon}
Return
A mixed-integer linear programming model for bulk grain blending and shipping
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2006.11.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses a blending and shipping problem faced by a company that manages a wheat supply chain. The problem involves the delivery of bulk products from loading ports to destination ports, which may be served by different vessel types. Since the products demanded by customers are mainly exported in bulk to overseas customers, the shipment planning is of great economic importance. The problem is formulated as a mixed-integer linear programming model. The objective function seeks to minimize the total cost including the blending, loading, transportation and inventory costs. Constraints on the system include blending and demand requirements, availability of original and blended products; as well as blending, loading, draft and vessel capacity restrictions. When solved, the model produces: (1) the quantity of each original product to be used to make blended products, (2) the quantity of each product to be loaded at each port and to be transported from each port to each customer, and (3) the number of vessels of each type to be hired in each time period. Numerical results are presented to demonstrate the feasibility of the real world bulk grain blending and shipping model. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
distribution planning
blending
maritime transportation
supply chain management
mixed integer linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W
Organization
No organization information available