Back

D4.2 - Optimization and simulation algorithms for CMLP: specifications, development and validation

Title 

Optimization and simulation algorithms for CMLP: specifications, development and validation

Editor

UPV

Executive Summary

D4.2 is composed of two parts: First part consists in a technical report with a full description of the new optimization/simulation algorithms, partial or completely developed (section II.2 Algorithms Development). Second part consists of the algorithms source code, this second part is located in Annex I. The new optimization/simulation algorithms have been elaborated for solving and giving support to: (i) the planning processes identified and the inputs gathered in T4.1 for each of the Pilots; (ii) the requirements analysis performed in WP1; (iii) the detailed specifications of Pilots provided by the WP7; and (iv) the general relevant Source (S), Make (M) and Deliver (D) processes, identified in Task 4.1 (T4.1).

In order to address and solve the specified manufacturing and logistic processes, a set of algorithms have been proposed. The algorithms have been classified according to the taxonomy proposed in D4.1. This taxonomy has allowed classifying the manufacturing and logistic processes by using the Supply Chain Operations Reference (SCOR) model views, regarding the sourcing, production, and delivery requirements. For its homogenisation the elaborated algorithms have been organised in sections, following this classification: Plan Source (S) Processes, Plan Make (M) Processes, Plan Deliver (D) Processes, Plan Source & Make (SM) Processes, Plan Source & Deliver (SD) Processes, Plan Make & Deliver (MD) Processes, and Plan Source & Make & Deliver (SMD) Processes. Mixed classifications are due to the characteristics of some plans, which deal with the combinations of S, M or D processes (ANNEX I).

The algorithms have been elaborated (see the complete code in ANNEX I), and a detailed analysis has been performed for each of them (see section II.2), considering two perspectives: (i) the algorithm description; and (ii) the algorithm application. For each of the proposed algorithms a summarized information is provided, including the algorithm identification; a description; the modelling approach; the solution approach; the algorithm type; the input data, objectives and output data in C2NET data; and the planning horizon and periods. Moreover, for each algorithm:

  • the application has been outlined, covering the algorithm identification;
  • the plan codification; if the used data is estimated or realistic;
  • the Pilots information (if the data is gathered from the enterprises belonging to the Pilots), such as the name, the enterprises participating, the pilot plan, the pilot plan description;
  • the input data, objectives and output data given in C2NET data;
  • the planning horizon and periods; the solution gap;
  • the hardware/service used, the calculation time in a specific optimisation solver or service; and
  • the collaboration Level.

Most of the elaborated algorithms have been applied in order to solve the industrial plans required from the C2NET Pilots' needs. Moreover, other developed algorithms have not been directly applied in the Pilots, although realistic data has been used for its verification, when solving real CMLP problems. In addition to the analysis carried out in each algorithm, the developed code has been also included, in a second part, an ANNEX I.

Parallel to the algorithms elaboration, and based on the homogenised categories of C2NET data created in T4.1 and presented in D4.1, the STables have been updated. The input data, objectives and output data derived from the algorithms’ elaboration have allowed the completion and refinement of the STables data, according to the needs of the Optimiser module.

As a result of this deliverable, it is expected to elaborate and implement new (or adapted) algorithms, considering the Pilots’ requirements and the preliminary selection of Plans and Algorithms identified in T4.1 and listed in D4.1.

The elaborated algorithms, will be considered to collaboratively and automatically solve Replenishment (Source, S), Production (Make, M), and Delivery (D) Plans, among the enterprises belonging to a network.

In summary, D4.2 offers a data base of algorithms that will serve to solve general and particular Pilots’ planning process from intra-enterprise and inter-enterprise (collaborative) perspectives.

WP/Task

WP4/T4.2