scholarly journals Optimization Method of Locomotive Working Diagram Layout

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Yajing Zheng ◽  
Wenzhou Jin
Keyword(s):  
Genetic Algorithm ◽  
Optimization Model ◽  
Optimization Method ◽  
The Optimizing Model ◽  
Optimizing Model

Rational scheduling of locomotive paths (the locus of the locomotive point in the train working diagram) is an important step in drawing a locomotive working diagram by a computer. But there are some problems in this process, such as the computer usually drawing a locomotive path that overlaps with another locomotive path (in the circumstances, the actual users of the locomotive working diagrams often misread the locomotive planning). At present, there are many studies about assigning sets of locomotives to each train in a preplanned train schedule; in contrast, the studies of visualizing the locomotive planning are relatively rare. Through investigating the locomotive working diagram users, this paper points out that the layout of locomotive paths should put the distance between lines being as large as possible and should put the number of the intersection between lines being as few as possible as the optimization aim which is based to solve the problem of the lines overlap or the problem of the lines beyond the margins for drawing the locomotive paths. This paper also builds the optimization model of locomotive working diagram layout. Based on determining the position of locomotive paths which can be delineated, a genetic algorithm is used to solve the optimizing model of locomotive working diagram layout in this paper. An example of a train working diagram with 36 trains is given at the end of the paper, which indicates that the optimization model of locomotive working diagram layout can better solve the problem of locomotive planning visualization.

scholarly journals Sizing and shape optimization material use in 10 bar trusses

2021 ◽  
Vol 343 ◽  
pp. 04004
Author(s):  
Nenad Petrović ◽  
Nenad Kostić ◽  
Vesna Marjanović ◽  
Ileana Ioana Cofaru ◽  
Nenad Marjanović
Keyword(s):  
Genetic Algorithm ◽  
Shape Optimization ◽  
Cross Sections ◽  
Optimization Model ◽  
Structural Characteristics ◽  
Optimization Method ◽  
Truss Optimization ◽  
Algorithm Optimization ◽  
Sizing Optimization ◽  
Bill Of Materials

Truss optimization has the goal of achieving savings in costs and material while maintaining structural characteristics. In this research a 10 bar truss was structurally optimized in Rhino 6 using genetic algorithm optimization method. Results from previous research where sizing optimization was limited to using only three different cross-sections were compared to a sizing and shape optimization model which uses only those three cross-sections. Significant savings in mass have been found when using this approach. An analysis was conducted of the necessary bill of materials for these solutions. This research indicates practical effects which optimization can achieve in truss design.

scholarly journals Taxiing Route Scheduling between Taxiway and Runway in Hub Airport

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Yu Jiang ◽  
Xinxing Xu ◽  
Honghai Zhang ◽  
Yuxiao Luo
Keyword(s):  
Genetic Algorithm ◽  
Delay Time ◽  
Optimization Method ◽  
Improved Genetic Algorithm ◽  
Route Length ◽  
Optimizing Model ◽  
The Right ◽  
Hub Airport ◽  
Runway Scheduling ◽  
Route Scheduling

To guarantee the operation safety of airport, improve the efficiency of surface operation, and enhance the fairness of taxiing route scheduling, an optimizing model is established for the airport surface taxiing route scheduling. Reducing the total aircraft taxiing route length and reducing the waiting delay time are the goals of the model by controlling the initial taxiing time of aircraft and choosing the right taxiing route. The model can guarantee the continuous taxiing for all aircraft without conflicts. The runway scheduling is taken into consideration in the model to optimize the surface operation. The improved genetic algorithm is designed for simulation and validation. The simulation results show that compared with the ant colony optimization method, the improved genetic algorithm reduces the total extra taxiing distance by 47.8% and the total waiting delay time decreases by 21.5%. The optimization model and improved genetic algorithm are feasible. The optimization of taxiing route method can provide decision support for hub airports.

Study on a Robust Optimization Model for Project Scheduling Policies

2011 ◽  
Vol 110-116 ◽  
pp. 2866-2871
Author(s):  
Yu Zhang ◽  
Teng Fei Yin
Keyword(s):  
Genetic Algorithm ◽  
Robust Optimization ◽  
Objective Function ◽  
Project Scheduling ◽  
Optimization Model ◽  
Optimal Schedule ◽  
Optimization Method ◽  
Construction Process ◽  
Scheduling Policies ◽  
Project Environment

The genetic algorithm discussed in this paper for project scheduling solution to this problem can be obtained the near optimal schedule programs. This has established the objective function and constraints that have a certain scope; it requires the duration of each process that is determined in advance for enterprises. If the project is more familiar with the history with more experience, and more complete database, the project environment can be controlled well. It can accurately determine the time with the construction plan, construction process and the optimization method with the good trial.

Optimization Method for Robust Continuous Parameter Design in the Target-being-Best Based on Genetic Evolution

2014 ◽  
Vol 1049-1050 ◽  
pp. 1272-1280
Author(s):  
Qiang Zeng ◽  
Ling Shen ◽  
Ze Bin Zhang
Keyword(s):  
Genetic Algorithm ◽  
Theoretical Calculation ◽  
Optimization Model ◽  
Optimization Method ◽  
Parameter Design ◽  
Genetic Evolution ◽  
Quality Loss ◽  
Average Quality ◽  
Continuous Parameter

Aiming at the problem of robust continuous parameter design in the Target-being-best, in which the output value can be obtained by theoretical calculation, an optimization method based on genetic evolution is proposed. Firstly, the researched problem is described mathematically and an optimization model is established with the objective to minimize the average quality loss of a sample. Secondly, the optimization method based on genetic evolution for the researched problem is proposed. Thirdly, the genetic algorithm for robust continuous parameter design in the Target-being-best is presented and designed. Finally, the effectiveness of the proposed method is validated by case study.

scholarly journals Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1452
Author(s):  
Cristian Mateo Castiblanco-Pérez ◽  
David Esteban Toro-Rodríguez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Programming Model ◽  
Distribution Networks ◽  
Optimization Method ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Power Balance ◽  
Continuous Version ◽  
Discrete Part

In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.

scholarly journals Optimization of a 3D-Printed Permanent Magnet Coupling Using Genetic Algorithm and Taguchi Method

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 494
Author(s):  
Ekaterina Andriushchenko ◽  
Ants Kallaste ◽  
Anouar Belahcen ◽  
Toomas Vaimann ◽  
Anton Rassõlkin ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Taguchi Method ◽  
Permanent Magnet ◽  
Optimization Problems ◽  
Optimization Method ◽  
Taguchi Optimization ◽  
Torque Density ◽  
Electromagnetic Devices ◽  
3D Printed ◽  
Manufacturing Techniques

In recent decades, the genetic algorithm (GA) has been extensively used in the design optimization of electromagnetic devices. Despite the great merits possessed by the GA, its processing procedure is highly time-consuming. On the contrary, the widely applied Taguchi optimization method is faster with comparable effectiveness in certain optimization problems. This study explores the abilities of both methods within the optimization of a permanent magnet coupling, where the optimization objectives are the minimization of coupling volume and maximization of transmitted torque. The optimal geometry of the coupling and the obtained characteristics achieved by both methods are nearly identical. The magnetic torque density is enhanced by more than 20%, while the volume is reduced by 17%. Yet, the Taguchi method is found to be more time-efficient and effective within the considered optimization problem. Thanks to the additive manufacturing techniques, the initial design and the sophisticated geometry of the Taguchi optimal designs are precisely fabricated. The performances of the coupling designs are validated using an experimental setup.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

Sign in / Sign up

Export Citation Format

Share Document