Research On Optimal Operation Of Transport Car In Refractory Production Line

Refractory materials are very important materials used in many fields such as high temperature industry,chemical industry and so on.With the development of economy and society in china,requirements on quantity and quality of the refractory are improved by customers in fields year after year.At the same time,enterprises have to improve the degree of automation under the intense competitive pressure to achieve the purpose of reducing costs and energy consumption.With the development of automatics,transport car can finish tasks automatically as an important part in the production line of refractory materials.When a transport car on a rail receives more than one task at the same time,how to sort tasks reasonably,and to get a shortest dispatching distance or reduce the energy consumption in advance of completing tasks in time is one of the core problems in this thesis.Similarly,when two transport cars on a rail receive more than one task,how to allocate tasks and sort the assigned tasks reasonably to complete the tasks in time with the lowest energy consumption is the another core problem in this thesis.Firstly,whole process of the refractory production line is proposed in detail;Structure of transport car which acts as the key equipment in the transport system is proposed meanwhile,and running strategy of the transporter is designed according to the actual situation;Then mathematical models of Single Rail-Single Car and Single Rail-Double Cars are created respectively.In order to better comply with the actual situation,during the process of modeling,the time factor is taken into consideration and time-limited penalty functions are added into the models.Besides,avoidance strategy is put forward when the mode of Single Rail-Double Cars is created in order to avoid collision between two transport cars.Secondly,the ant colony algorithm and its improving methods are introduced.In view of the similarity of the two models,the ant colony algorithm is chosen.Relative to basic ant colony algorithm,the max-min ant colony algorithm which is a kind of improved ant colony algorithms has good performance.Meanwhile,the GSP-ANT algorithm which is put forward in the thesis is based on it.Finally,according to the data collected in the field,simulations are done by combining the models and optimization methods in front.The results of experiments show that GSP-ANT algorithm is more efficient compared with fixed priority algorithm and Max-min ant colony algorithm in finding the optimal solution.