A Bi-Objective Order Allocation Optimization Model for Horizontal Manufacturing Collaborative Alliance

2010 ◽  
Vol 102-104 ◽  
pp. 836-840 ◽  
Author(s):  
Fang Qi Cheng
Keyword(s):  
Genetic Algorithm ◽  
Optimization Model ◽  
Optimal Solution ◽  
Order Allocation ◽  
Nsga Ii ◽  
Manufacturing Enterprises ◽  
Proposed Model ◽  
Optimal Solution Set ◽  
Simulation Results ◽  
Enterprise Community

Horizontal manufacturing collaborative alliance is a dispersed enterprise community consisting of several enterprises which produce the same kind of products. To correctly assign order among member companies of horizontal manufacturing collaborative alliance is one of the most important ways to improve the agility and competitiveness of manufacturing enterprises. For the order allocation problem, a bi-objective optimization model is developed to minimize the comprehensive cost and balance the production loads among the selected manufacturing enterprises. Non-dominated sorting genetic algorithm (NSGA-II) is applied to solve the optimization functions. The optimal solution set of Pareto is obtained. The simulation results indicate that the proposed model and algorithm is able to obtain satisfactory solutions.

A One to Multiple Order Allocation Optimization Model of Horizontal Manufacturing Collaborative Alliance

2012 ◽  
Vol 201-202 ◽  
pp. 996-999
Author(s):  
Jin Gao
Keyword(s):  
Optimization Model ◽  
Optimal Solution ◽  
Multi Objective Optimization ◽  
Order Allocation ◽  
Nsga Ii ◽  
Manufacturing Enterprises ◽  
Proposed Model ◽  
Optimal Solution Set ◽  
Simulation Results ◽  
Enterprise Community

Horizontal manufacturing collaborative alliance is a dispersed enterprise community consisting of several enterprises which produce the same kind of products. To correctly assign order among member companies of horizontal manufacturing collaborative alliance is one of the most important ways to improve the agility and competitiveness of manufacturing enterprises. For the order allocation problem, a multi-objective optimization model is developed to minimize the comprehensive cost and balance the production loads among the selected manufacturing enterprises. Non-dominated sorting genetic algorithm (NSGA-II) is applied to solve the optimization functions. The optimal solution set of Pareto is obtained. The simulation results indicate that the proposed model and algorithm is able to obtain satisfactory solutions.

scholarly journals Coordinated Control of PV Generation and EVs Charging Based on Improved DECell Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Guo Zhao ◽  
Xueliang Huang ◽  
Hao Qiang
Keyword(s):  
Genetic Algorithm ◽  
Differential Evolution ◽  
Control Strategy ◽  
Optimization Model ◽  
Pareto Front ◽  
Optimal Solution ◽  
Coordinated Control ◽  
Nsga Ii ◽  
Nondominated Solutions ◽  
Pv Generation

Recently, the coordination of EVs’ charging and renewable energy has become a hot research all around the globe. Considering the requirements of EV owner and the influence of the PV output fluctuation on the power grid, a three-objective optimization model was established by controlling the EVs charging power during charging process. By integrating the meshing method into differential evolution cellular (DECell) genetic algorithm, an improved differential evolution cellular (IDECell) genetic algorithm was presented to solve the multiobjective optimization model. Compared to the NSGA-II and DECell, the IDECell algorithm showed better performance in the convergence and uniform distribution. Furthermore, the IDECell algorithm was applied to obtain the Pareto front of nondominated solutions. Followed by the normalized sorting of the nondominated solutions, the optimal solution was chosen to arrive at the optimized coordinated control strategy of PV generation and EVs charging. Compared to typical charging pattern, the optimized charging pattern could reduce the fluctuations of PV generation output power, satisfy the demand of EVs charging quantity, and save the total charging cost.

Fuzzy Parallel Machines Scheduling Problem Based on Genetic Algorithm

2011 ◽  
Vol 204-210 ◽  
pp. 856-861
Author(s):  
Yuan Xie
Keyword(s):  
Genetic Algorithm ◽  
Parallel Machines ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Due Dates ◽  
Nsga Ii ◽  
Optimal Solution Set ◽  
Parallel Machines Scheduling ◽  
Nondominated Sorting ◽  
Completion Times

A kind of unrelated parallel machines scheduling problem is discussed. The memberships of fuzzy due dates denote the grades of satisfaction with respect to completion times with jobs. Objectives of scheduling are to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Two kind of genetic algorithms are employed to search optimal solution set of the problem. Both Niched Pareto Genetic Algorithm (NPGA) and Nondominated Sorting Genetic Algorithm (NSGA-II) can find the Pareto optimal solutions. Numerical simulation illustrates that NSGA-II has better results than NPGA.

An Interval Optimization Model of Multi-Criteria Parameters in the Process of Selecting Manufacturing Suppliers

2012 ◽  
Vol 601 ◽  
pp. 570-575
Author(s):  
Hong Fei Wang
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Optimization Model ◽  
Euclidean Distance ◽  
Optimal Solution ◽  
Adaptive Genetic Algorithm ◽  
Final Decision ◽  
Interval Optimization ◽  
Proposed Model ◽  
Decision Making Problem

In the process of selecting manufacturing suppliers, most research works focus on the final decision making problem. However, the process is a dynamic and rapidly changing evolving one and it is necessary to gradually adjust and optimize multi-criteria parameters such as price, time and quality and so on. The objective of this paper is to propose an interval optimization model of multi-criteria parameters and introduce the distance metric of Euclidean distance and vector theories to construct the model. An adaptive genetic algorithm based on real encoding is applied to obtain the optimal solution. Finally, a practical example is implemented to verify the validity of the proposed model and approach.

Multi-Objective Optimization Calibration of Spark Advanced Angle Based on NSGA-II Algorithm

2014 ◽  
Vol 543-547 ◽  
pp. 1959-1962
Author(s):  
Hao Ba ◽  
Bao Mei Qiu ◽  
Pei Pei Chen
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Gasoline Engine ◽  
Optimal Solution ◽  
Local Optimum ◽  
Multi Objective Optimization ◽  
Improved Genetic Algorithm ◽  
Nsga Ii ◽  
Multi Objective ◽  
Optimal Solution Set

Modern gasoline engine spark advanced angle calibration is a multi-objective optimization problem, commonly used genetic algorithm to solve this problem. However, the traditional genetic algorithm tends to local optimum probability of a larger, easy to fall into premature, this defect is likely to cause the solution is not the optimal solution set. To address this issue, the non-dominated sorting genetic algorithm II for the spark advanced angle optimization, through crowding distance maintain the diversity, overcome super individuals overgrowth, improved genetic algorithm post search results. Experimental results show the effectiveness of this method.

scholarly journals Carbon Emission Reduction of Apparel Material Distribution Based on Multi-Objective Genetic Algorithm (NSGA-II)

2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Optimal Solution ◽  
Material Distribution ◽  
Low Carbon ◽  
Nsga Ii ◽  
Management Objectives ◽  
Multi Objective Genetic Algorithm ◽  
Distribution Process ◽  
The Cost

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.

HIERARCHICAL GENETIC ALGORITHM FOR NEAR-OPTIMAL FEEDFORWARD NEURAL NETWORK DESIGN

2002 ◽  
Vol 12 (01) ◽  
pp. 31-43 ◽  
Author(s):  
GARY YEN ◽  
HAIMING LU
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Neural Networks ◽  
Cost Function ◽  
Design Procedure ◽  
Optimal Solution ◽  
Traditional Learning ◽  
Feed Forward Neural Network ◽  
Optimal Solution Set ◽  
Hierarchical Genetic Algorithm

In this paper, we propose a genetic algorithm based design procedure for a multi-layer feed-forward neural network. A hierarchical genetic algorithm is used to evolve both the neural network's topology and weighting parameters. Compared with traditional genetic algorithm based designs for neural networks, the hierarchical approach addresses several deficiencies, including a feasibility check highlighted in literature. A multi-objective cost function is used herein to optimize the performance and topology of the evolved neural network simultaneously. In the prediction of Mackey–Glass chaotic time series, the networks designed by the proposed approach prove to be competitive, or even superior, to traditional learning algorithms for the multi-layer Perceptron networks and radial-basis function networks. Based upon the chosen cost function, a linear weight combination decision-making approach has been applied to derive an approximated Pareto-optimal solution set. Therefore, designing a set of neural networks can be considered as solving a two-objective optimization problem.

scholarly journals Economic Environmental Dispatch of Wind Integrated Thermal Power System

2020 ◽  
Vol 8 (6) ◽  
pp. 5186-5192
Keyword(s):  
Genetic Algorithm ◽  
Power Plant ◽  
Thermal Power ◽  
Nsga Ii ◽  
Strength Pareto Evolutionary Algorithm ◽  
Experimental Constraint ◽  
Thermal Power System ◽  
Power Plant Operation ◽  
Simulation Results ◽  
The Given

In electric power plant operation, Economic Environmental Dispatch (EED) of a thermal-wind is a significant chore to involve allocation of production amongst the running units so the price, NOx extraction status and SO2 extraction status are enhanced concurrently whilst gratifying each and every experimental constraint. This is an exceedingly controlled multiobjective optimizing issue concerning contradictory objectives having Primary and Secondary constraints. For the given work, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is recommended for taking care of EED issue. In simulation results that are obtained by applying the two test systems on the proposed scheme have been evaluated against Strength Pareto Evolutionary Algorithm 2 (SPEA 2).

scholarly journals Dynamic Scheduling Model of Bike-Sharing considering Invalid Demand

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Liu He ◽  
Tangyi Guo ◽  
Kun Tang
Keyword(s):  
Optimization Model ◽  
Dynamic Scheduling ◽  
Demand Forecasting ◽  
Optimal Solution ◽  
Coupling Model ◽  
Service Level ◽  
Demand Prediction ◽  
Dynamic Relationship ◽  
Proposed Model ◽  
Bike Sharing

System resources allocation optimization through dynamic scheduling is key to improving the service level of bike-sharing. This study innovatively introduces three types of invalid demand with negative effect including waiting, transfer, and abandoning, which consists of the total demand of bike-sharing system. Through exploring the dynamic relationship among users’ travel demands, the quantity and capacity of bikes at the rental points, the records of bicycles borrowed and returned, and the vehicle scheduling schemes, a demand forecasting model for bike-sharing is established. According to the predicted bikes and the maximum capacity limit at each rental point, an optimization model of scheduling scheme is proposed to reduce the invalid demand and the total scheduling time. A two-layer dynamic coupling model with iterative feedback is obtained by combining the demand prediction model and scheduling optimization model and is then solved by Nicked Pareto Genetic Algorithm (NPGA). The proposed model is applied to a case study and the optimal solution set and corresponding Pareto front are obtained. The invalid demand is greatly reduced from 1094 to 26 by an effective scheduling of 3 rounds and 96 minutes. Empirical results show that the proposed model is able to optimize the resource allocation of bike-sharing, significantly reduce the invalid demand caused by the absence of bikes at the rental point such as waiting in a place, walking to other rental points, and giving up for other travel modes, and effectively improve the system service level.

Hydrograph-based storm sewer design optimization by genetic algorithm

2006 ◽  
Vol 33 (3) ◽  
pp. 319-325 ◽  
Author(s):  
M H Afshar ◽  
A Afshar ◽  
M A Mariño ◽  
A A.S Darbandi
Keyword(s):  
Genetic Algorithm ◽  
Optimal Design ◽  
Environmental Protection Agency ◽  
Optimal Solution ◽  
Storm Water ◽  
Storm Water Management Model ◽  
Decision Variables ◽  
Proposed Model ◽  
The Us ◽  
Hydraulic Simulator

A model is developed for the optimal design of storm water networks. The model uses a genetic algorithm (GA) as the search engine and the TRANSPORT module of the US Environmental Protection Agency storm water management model version 4.4H (SWMM4.4H) as the hydraulic simulator. Two different schemes are used to formulate the problem with varying degrees of success in reaching a near-optimal solution. In the first scheme, the nodal elevations and pipe diameters are selected as the decision variables of the problem which were determined by the GA to produce the trial solutions. In the second scheme, only nodal elevations are optimized by the GA, and determination of pipe diameters is left to the TRANSPORT SWMM module. Simulation of the trial solutions in both methods is carried out by the TRANSPORT module of SWMM4.4H. The proposed model is applied to some benchmark examples, and the results are presented and compared with the existing results in the literature.Key words: genetic algorithm, optimal design, sewer network, SWMM.

Sign in / Sign up

Export Citation Format

Share Document