No abstract

In this paper, we propose a multi-period mixed-integer linear programming model for optimal enterpriselevel planning of industrial gas operations. The objective is to minimize the total cost of production and distribution of liquid products by coordinating production decisions at multiple plants and distribution decisions at multiple depots. Production decisions include production modes and rates that determine power consumption. Distribution decisions involve source, destination, quantity, route, and time of each truck delivery. The selection of routes is a critical factor of the distribution cost. The main goal of this contribution is to assess the benefits of optimal coordination of production and distribution. The proposed methodology has been tested on small, medium, and large size examples. The results show that significant benefits can be obtained with higher coordination among plants/depots in order to fulfill a common set of shared customer demands. The application to real industrial size test cases is also discussed.

This work considers the problem of the optimal design of an hydrogen transmission network. This design problem includes the topology determination and the pipelines dimensioning problem. We define a local search method that simultaneously looks for the least cost topology of the network and for the optimal diameter of each pipe. These two problems were generally solved separately these last years. The application to the case of development of future hydrogen pipeline networks in France has been conducted at the local, regional and national levels. We compare the proposed approach with another using Tabu search heuristic.

This paper addresses industrial gases supply chains involving multiple products at multiple plants that must be coordinated with multiple depot-truck-routes in order to satisfy customer demands. The full-space optimization problem corresponds to a large-scale mixed-integer linear programming model (MILP). To solve large-scale industrial problems, this paper proposes a rolling horizon approach with two aggregation strategies for solving the smaller subproblems. The first one relies on the linear programming (LP) relaxation for which the binary variables (complicating variables) of the distribution problem are treated as continuous, while the second one uses a novel tailored model for the distribution side constraints that leads to improved solutions. A real case study of an industrial gases supply chain has been addressed obtaining good results in both objective value and with lower computational effort compared with the full-space solution. The extension to longer time horizons through a receding horizon is also considered.

No abstract