scholarly journals A Hybrid Multi-Objective Evolutionary Algorithm-Based Semantic Foundation for Sustainable Distributed Manufacturing Systems

2021 ◽  
Vol 11 (14) ◽  
pp. 6314
Author(s):  
Veera Babu Ramakurthi ◽  
V. K. Manupati ◽  
José Machado ◽  
Leonilde Varela

Rising energy prices, increasing maintenance costs, and strict environmental regimes have augmented the already existing pressure on the contemporary manufacturing environment. Although the decentralization of supply chain has led to rapid advancements in manufacturing systems, finding an efficient supplier simultaneously from the pool of available ones as per customer requirement and enhancing the process planning and scheduling functions are the predominant approaches still needed to be addressed. Therefore, this paper aims to address this issue by considering a set of gear manufacturing industries located across India as a case study. An integrated classifier-assisted evolutionary multi-objective evolutionary approach is proposed for solving the objectives of makespan, energy consumption, and increased service utilization rate, interoperability, and reliability. To execute the approach initially, text-mining-based supervised machine-learning models, namely Decision Tree, Naïve Bayes, Random Forest, and Support Vector Machines (SVM) were adopted for the classification of suppliers into task-specific suppliers. Following this, with the identified suppliers as input, the problem was formulated as a multi-objective Mixed-Integer Linear Programming (MILP) model. We then proposed a Hybrid Multi-Objective Moth Flame Optimization algorithm (HMFO) to optimize process planning and scheduling functions. Numerical experiments have been carried out with the formulated problem for 10 different instances, along with a comparison of the results with a Non-Dominated Sorting Genetic Algorithm (NSGA-II) to illustrate the feasibility of the approach.

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Li Ba ◽  
Mingshun Yang ◽  
Xinqin Gao ◽  
Yong Liu ◽  
Zhoupeng Han ◽  
...  

Process planning and scheduling are two important components of manufacturing systems. This paper deals with a multiobjective just-in-time integrated process planning and scheduling (MOJIT-IPPS) problem. Delivery time and machine workload are considered to make IPPS problem more suitable for manufacturing environments. The earliness/tardiness penalty, maximum machine workload, and total machine workload are objectives that are minimized. The decoding method is a crucial part that significantly influences the scheduling results. We develop a self-adaptive decoding method to obtain better results. A nondominated sorting genetic algorithm with self-adaptive decoding (SD-NSGA-II) is proposed for solving MOJIT-IPPS. Finally, the model and algorithm are proven through an example. Furthermore, different scale examples are tested to prove the good performance of the proposed method.


2020 ◽  
Vol 19 (01) ◽  
pp. 31-64
Author(s):  
S. Ghanei ◽  
T. AlGeddawy

In a dynamic production environment, not only the customer’s needs change with time, but the economic aspects of that environment, such as energy pricing, also change. Reconfigurable Manufacturing Systems (RMSs) are designed to respond to such changes by reconfiguring system components efficiently. This paper presents a novel mathematical model to maximize energy sustainability of RMS. The novelty aspect of the model is the consideration of energy sustainability concurrently with system configuration and scheduling decisions in each period of the planning horizon. The objective of this mixed integer linear model is to minimize the total cost of energy consumption, system reconfiguration, and part transportation between machines, depending on fluctuations of energy pricing and demand during different periods. Several case studies are solved by GAMS Software to illustrate the performance of the presented model and analyze its sensitivity to the volatility of energy pricing and demand to show their effect on system changeability. An efficient genetic algorithm (GA) has been developed to solve the model in larger scale due to its NP-hardness and compared to GAMS for validation. Results show that the presented GA finds near-optimal solutions in 70% shorter time than GAMS on average.


Sign in / Sign up

Export Citation Format

Share Document