Application of Improved Differential Evolution Algorithm in solving Container-packing problems




НазваниеApplication of Improved Differential Evolution Algorithm in solving Container-packing problems
страница1/48
Дата конвертации16.02.2013
Размер1.34 Mb.
ТипДокументы
  1   2   3   4   5   6   7   8   9   ...   48
Application of Improved Differential Evolution Algorithm in solving Container-packing problems


Chuan He1,2 Yuan-Biao Zhang1,2,* Jian-Wen Wu1,2 Cheng Chang1,2

1Mathematical Modeling Innovative Practice Base, Zhuhai College Jinan University, Zhuhai, China 519070; 2Department of Computer Science and Technology, Jinan University, Zhuhai, China 519070;

hechuan1215@gmail.com 1Mathematical Modeling Innovative Practice Base, Zhuhai College Jinan University, Zhuhai, China 519070; 2Packaging Engineering Institute, Jinan University, Zhuhai, China 519070;

abiaoa@163.com 1Mathematical Modeling Innovative Practice Base, Zhuhai College Jinan University, Zhuhai, China 519070; 2Packaging Engineering Institute, Jinan University, Zhuhai, China 519070; gglddu@126.com 1Mathematical Modeling Innovative Practice Base, Zhuhai College Jinan University, Zhuhai, China 519070; 2Business Administration Department, Jinan University, Zhuhai, China 519070;

731946105@qq.com


Abstract—In this paper, aim at the characteristics of multi- objective multi-constrained and difficult to solve of the three- dimensional container-packing problem, we propose to solve the problem with improved differential evolution (IDE) algorithm. By overloading the evolutionary operation of differential evolution algorithm that we can deal with discrete optimization problems effectively. Define the adaptive crossover-factor and stagnation variation mechanism to prevent premature stagnation of the algorithm, and improve the population diversity. Simulation results show that the IDE algorithm can excellently solve the three-dimensional container-packing problem.

Keywords-Three-dimensional container-packing; Spatial segmentation; Symbol overloading; Stagnation variation; Improved differential evolution;


Application of CCCT in the BPR of Container Terminal


Zhong weizhu, YinYilin

Management School, Tianjin University of Technology, China

Email: wzhong86@gmail.com

Abstract: To develop the production capability and decrease the cost of container terminal is the goal of port enterprises Business Processing Rebuilding (BPR). It is even the important project of studying to every port in the world. This paper shows the innovation approach, which integrated IT technology such as Computing, Communication and Controlling (CCCT), in the BPR of container terminal production. The key content of BPR is to equip the mobile computer linked with the MIS of terminal production system on the RTG or Bridge Crane. The data communication technology, Wireless Local Area Net (WLAN), and Global Position System (GPS) technology are playing the important rule in this rebuilding program. The throughout of container in the terminal is up 4% and the operating cost is down 14.78, which is compare to last year, after to accomplish this BPR of container terminal production system.

Keyword: Computing, Communicating, Controlling, Container Terminal, BPR


Research on Genetic Algorithm Based on Oriented Weighted Crossover Operator


Zhou Yu-heng

Institute of Railway and Urban Rail Transit

Tongji University

Shanghai, China

yuhengzhou@qq.com

Xie Wei-da

Institute of Railway and Urban Rail Transit

Tongji University

Shanghai, China

tjxwd@163.com


Abstract—Crossover is the most important step in genetic algorithm, which passes on good genes of the parents to the next generation. However, the crossover operator can’t ensure the offspring finding the globally optimum because of its blind search. A weighted crossover operator is proposed to overcome the disadvantages. Weighted values are calculated according to the adaptive values of the parents. One offspring is generated through the weighted crossover operator. On this basis, an oriented weighted crossover operator is proposed to increase the probability of finding excellent solution genes. The convergence of the genetic algorithm based on this crossover operator is proved. Experiments show that the genetic algorithm based on this operator has a good performance in searching optimum.

Keywords-Genetic Algorithm; Weighted Crossover Operator; Orientation; Adaptive Value


Robust Control of Sensorless Permanent Magnet Synchronous Motor Drive using Fuzzy Logic

J L Febin Daya

Department of Electrical and Electronics Engineering

Sri Krishna College of Engineering and Technology

Coimbatore, India

febindaya@yahoo.co.in

V Subbiah

Department of Electrical and Electronics Engineering Sri Krishna College of Engineering and Technology

Coimbatore, India

subbiah42@yahoo.com

Abstract— A robust fuzzy logic based control system, combined with Kalman filter is proposed to control the speed of sensorless permanent magnet synchronous motor (PMSM) drive system in this paper. A novel speed controller is designed using the concept of fuzzy logic, which ensures robust speed control against parameter variations. Sensorless control of PMSM servo drive is implemented using the Kalman filter and the non linear model of the motor has been linearized on the basis of field orientation principle. Simulations have been carried out to validate the effectiveness of the proposed controller in enhancing robustness and adequate performance in the face of uncertainties.

Keywords-Fuzzy logic; permanent magnet synchronous moto; Kalman filter


Complex multi-products dynamic scheduling algorithm

with sequence-dependent setup times

Zhiqiang Xie1, 2, Lan Lan1, Lei Zhao1 and Jing Yang2

1. College of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China

2. College of Computer Science and Technology, Harbin Engineering University, Harbin, China

xzq0111@tom.com

Abstract—The problem of considering the setup times in scheduling with non-sequence constraint between operations has been researched, but there are no researches on the problem of considering the setup times in processing and assembly integrated scheduling of complex multi-product dynamic scheduling with sequence constraint between operations. So, a complex multi-product dynamic scheduling algorithm is proposed, considering sequence-dependent setup times. The algorithm constructs the virtual manufacturing tree in the way of root alignment and converts the complex multi-product dynamic scheduling problem to the complex single product scheduling problem. After the scheduling sequence of operations is determined, the starting time of each operation is determined by dynamically inserting setup time once. As the proposed algorithm avoids several movements of the scheduled operation when the setup time is inserted, the time complexity is sharply reduced. Theoretical analysis and examples show that the proposed algorithm not only can solve the complex multi-product dynamic scheduling problem with sequence-dependent setup times, but also is simple and practical.

Keywords-complex multi-products; setup times; integrated scheduling; algorithm; manufacturing tree


Study on integrated algorithm of complex multi-product flexible scheduling

Zhiqiang Xie1,2, Shuzhen Hao1, Lei Zhang1 and Jing Yang2

1. College of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China

2. College of Computer Science and Technology, Harbin Engineering University, Harbin, China

xzq0111@tom.com

Abstract—In order to optimize the processing of complex multi-product flexible scheduling, a simplified method which converts complex multi-product into a virtual single-product is adopted. The complex multi-product flexible scheduling problem is transformed into the virtual single-product flexible scheduling problem. Aiming at the virtual single-product flexible scheduling problem, an integrated algorithm is proposed. This algorithm firstly adopts the allied critical method to confirm the scheduling sequence of operations. Then each operation is simulation processed by the sequencing algorithm on a set of capable machines. Calculate the virtual completion time of this operation and choose the machine which has the minimum virtual completion time. The routing sub-problem and sequencing sub-problem are solved at the same time by the proposed algorithm. Experiment shows that the proposed algorithm can solve complex multi-product flexible scheduling problem with constraint between jobs, it also can solve simple multi-product flexible job-shop scheduling problem with non-restraint between jobs and obtain satisfying result.

Keywords- flexible scheduling, complex product flexible scheduling, integrated algorithm, simulation process


Neighborhood Description and Flocking Behavior Analysis of Swarm Robots Based on Fuzzy Logic

Zongchun Liu and Yantao Tian

School of Communication Engineering

Jilin University

Changchun, China

lufeng7891@163.com, tianyt@jlu.edu.cn

Mao Yang

School of Communication Engineering

Jilin University

Changchun, China

Yangmao820@yahoo.com.cn

Abstract—The control algorithm on coordination behavior of a flocking system consists of three components; they are collision avoidance, cohesion and alignment. The three components are realized by application of interactions between the agents in the system as well as guidance of the environment. To achieve better coordination through interactions between agents, the concept of fuzzy neighborhood is introduced in this paper. And the fuzzy grading is utilized to describe it. For agent , the intensities of neighborhood, characterized by numbers in the range of 0-1, vary with the distances between the other agents and agent . The smaller the distance, the larger the intensity and its value tends closer to 1; the larger the distance, the weaker the intensity and its value tends closer to 0. By this method, interactions and coordination between agents have been built to obtain the ultimate coordination of the flocking system.

Keywords-flocking behavior; neighborhood; fuzzy logic; coordination control


A Novel Scheme Of Vertical Handover For IP Multimedia Subsystem


Guan-nan Kou

Dept. of Computer Science

Xiamen University

Xiamen, Fujian, China

e-mail: kgn28@163.com

Yu-liang Tang*

Dept. of Communication Engineering

Xiamen University

Xiamen, Fujian, China

e-mail: tyl@xmu.edu.cn*

Yi Jiang

Dept. of Computer Science

Xiamen University

Xiamen, Fujian, China

e-mail: jiangyi@xmu.edu.cn


Abstract—In order to achieve seamless handover for real-time applications in the IP Multimedia Subsystem (IMS) of the next-generation network, a multi-protocol combined handover mechanism is proposed. In this work, we combine SIP (Session Initiation Protocol), FMIP (Fast Mobile IPv6 Protocol) and MIH (Media Independent Handover) protocols by cross-layer design and optimize these protocols’ signaling flows to improve vertical handover performance. Theoretical analysis and simulation result illustrate that our proposed mechanism is better than the original SIP and MIH combination handover mechanism in service interrupt time and packets loss aspects.

Keywords-Vertical handover; MIH; IMS; FMIP; NS2


Research on Neural Networks based Modelling and Control of Electrohydraulic System


Pang Xue-miao, Zhang Yuan, Xing Zong-yi

School of Mechanical Engineering

Nanjing University of Science and Technology

Nanjing, China

Qin Yong, Jia Li-min

State Key Laboratory of Rail Traffic Control and Safety

Beijing Jiaotong University

Beijing, China


Abstract—The electrohydraulic servo system of a certain type of mines weeping plough is a complex and nonlinear system. It is difficult to construct its accurate model by first principle method and to achieve satisfactory control performance by traditional PID controller. In this paper, the radial basis function neural network with orthogonal least square learning algorithm is used to model the electrohydraulic system and the neural network based direct inverse is adopted to control the system. The experimental results and comparisons with other techniques clearly show the validity of the proposed methods.

Keywords-electrohydraulic system; neural network; modelling; direct inverse control


Research on Rotary Screen Printing Machine Multi-axis Motion Control System Based on CAN Bus


Li Pengfei,Nie Luhua

College of Electronics and Information

Xi ' an Polytechnic University

Xi ' an, China

li6208@163.com

Wang Bo, Li Jiakun

College of Electronics and Information

Xi ' an Polytechnic University

Xi ' an, China

nieluhua@yahoo.cn


Abstract—In view of the degree of the information is not high, the formation of the various parts as a system of "information islands" and other issues in printing and dyeing industry, this paper studied a control system for rotary screen printing machine multi-axis coordinated motion control as the core based on CAN bus, to enhance the multi-axis synergistic motion accuracy as the goal. A study from the following aspects, the inspect method of real time synchronization control, the position synchronization arithmetic of rotary screens, to improve motion control accuracy of the synchronization between network nodes, as well as, Multi-axis coordinated motion control algorithm ,and realized absolute position synchronization between the rotary screen, as compared with other similar systems with a high accuracy, high reliability and low failure rate and long service life and so on. In practical applications, and to effectively improve the accuracy of the printing and production, the whole operation smooth and reliable, has received satisfactory control effect.

Keywords- CAN bus; rotary screen printing machine; multi-axis synchronization; accuracy; motion control


PID Controller Design for a Class of Networked Cascade Control Systems


Congzhi Huang, Yan Bai, Yaochun Zhu

School of Control and Computer Engineering

North China Electric Power University

Beijing, P.R.China

hcz190@ncepu.edu.cn


Abstract—The issue of PID controllers designing for a typical class of networked cascade control systems with constant network-induced delays is addressed. Cascade control system, wherein the control loops are closed via a real-time network, is called a networked cascade control system(NCCS for short). The system configuration for a typical class of NCCSs is analyzed, and the locations of the network-induced delays are pointed out. With the primary and secondary processes given as first order plus time delay (FOPTD), as well as the desired closed-loop responses, the PID tuning parameters of the primary and secondary controllers are proposed in form of expressions by approximating pure delays with first order Páde expression. Based on MATLAB/Simulink and TrueTime toolbox, both of simulation results and computational results of control performance indices for the NCCS explicitly indicate the superiority of the proposed approach to improve the system performance.

Keywords- networked cascade control system, network-induced delay, PID, performance index, TrueTime


Fault diagnosis of induction motor based on information entropy fusion


A HAN li, Shi Li-ping

  1   2   3   4   5   6   7   8   9   ...   48

Добавить в свой блог или на сайт

Похожие:

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconBu, L., Yinc, C., Wiegmans B. W., Luod, Z., (2011) Optimization of the (un)packing of containers at railway container service centres in Chinese ports (submitted to European Journal of Operations Research)

Application of Improved Differential Evolution Algorithm in solving Container-packing problems icon『問題解決之「研究方法」( Research Methods for Problems-Solving )』、『問題解決之多評準決策』整學年課程

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconExtensions of a Multistart Clustering Algorithm for Constrained Global Optimization Problems

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconElementary differential equations with boundary value problems / C. Henry

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconUnit IV initial value problems for ordinary differential equations 9

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconIn short: when it comes to problems solving in practice sessions, nothing beats above mentioned materials. But for strategies (read shortcuts ) you need to look for some extra materials

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconSynthesis of zeolites from geological materials and industrial wastes for potential application in environmental problems

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconYaremko N. N. Operator transform method of solving the inverse heat conductivity problems
Яремко Н. Н. Метод операторов преобразования для решения обратных задач теплопроводности. // Проблемы информатики в образовании,...

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconAccording to modern theories of stellar evolution, white dwarves are the last stage of evolution for all stars with less than 4 times the mass of the sun. These

Application of Improved Differential Evolution Algorithm in solving Container-packing problems iconGeneral Tendencies of Scientific Thought—Matter and Force— The Theory of Energy—Psychology—Biology and Materialism —Science and Sociology—Evolution and Religion—Evolution and Philosophy


Разместите кнопку на своём сайте:
lib.convdocs.org


База данных защищена авторским правом ©lib.convdocs.org 2012
обратиться к администрации
lib.convdocs.org
Главная страница