Design Research on Working Mechanism of Beam Pumping Unit

2010 ◽  
Vol 37-38 ◽  
pp. 340-343 ◽  
Author(s):  
Jun Liu ◽  
Jiang Zhu

Based on the unique geometry and mechanical movement of beam pumping unit, this paper presented a simple swing equation and computed motorial parameter, meanwhile under the conditions of the static load and inertial load of the polished-rod of a conventional pumping unit, it also presented an equivalent dynamic model of the pumping unit system and the type-curves of net torque of the crankshaft with the characteristic of inertial counterbalance having been computed, the model can provide a theoretical base for study on the other transient working parameters of beam pumping unit. Being satisfied with motion accuracy and boundary constraints, the optimization model of beam pumping unit is established. The simulated annealing algorithm with penalty strategy is adopted to solve the optimal model, so that optimization process was simplified and the global optimal solution is ensured reliably.

Author(s):  
Ha Thi Mai Phan

As the construction activity has been growing, the companies that supply fresh concrete expand their production scale to meet their customers’ needs. The more customers, the longer queue tank trucks have to wait to pick up the fresh concrete. The customers are construction companies that have different construction works at the same time while the transportation time is only at night. They have to schedule efficiently the fleet of fresh concrete tank trucks during the night (turning the tank trucks a few turns) with constraints on the time window for the transfer of fresh concrete from the concrete company to the construction site as well as constraints on the waiting time for loading fresh concrete in the company. The scheduling for the fleet of construction company’s tank trucks will be modeled to minimize total transportation costs (fixed, variable) with estimated waiting times and tank truck’s turns several times during the night. The model of logistics problem is NP hard; Therefore, two algorithms are proposed to find the nearly optimal solution: heuristics and simulated annealing algorithm. The results will be compared and analyzed.


2017 ◽  
Vol 9 (7) ◽  
pp. 168781401770579
Author(s):  
Chao Lu ◽  
Leishan Zhou ◽  
Jinjin Tang ◽  
Ran Chen

To meet the increasing demand for improving railway service quality while using the precious mobile resources reasonably and economically, this research proposes a hierarchical approach that integrates the model for constructing an efficient electric motor train unit circulation plan into the model for optimized timetable design without predefining timetable details. A simulated annealing algorithm for solving the timetabling (main) model is designed, in which the neighborhood system is pretreated. A special tree construction–based branch-and-bound algorithm is improved for solving the electric motor train unit circulation planning (sub)model. The results of the numerical experiment verify the effectiveness of the proposed method. Specifically, compared to the randomly generated initial solution, the optimal solution obtained by the proposed methods reduces the total travel time by 686 min and reduces the number of electric motor train units by 5. The number of electric motor train units needed by the proposed method is on average at least two less than the method that handles the problem in a sequential way. Railway operators can implement this approach for balancing the efficiency of timetable and the quality of electric motor train unit circulation plan within a reasonable computation time when scheduling trains in railways.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
He Tian ◽  
Guoqiang Wang ◽  
Kangkang Sun ◽  
Zeren Chen ◽  
Chuliang Yan ◽  
...  

Dynamic unbalance force is an important factor affecting the service life of scrap metal shredders (SMSs) as the product of mass error. Due to the complexity of hammerheads arrangement, it is difficult to take all the parts of the hammerhead into account in the traditional methods. A novel optimization algorithm combining genetic algorithm and simulated annealing algorithm is proposed to improve the dynamic balance of scrap metal shredders. The optimization of hammerheads and fenders on SMS in this paper is considered as a multiple traveling salesman problem (MTSP), which is a kind of NP-hard problem. To solve this problem, an improved genetic algorithm (IGA) combined with the global optimization characteristics of genetic algorithm (GA) and the local optimal solution of simulated annealing algorithm (SA) is proposed in this paper, which adopts SA in the process of selecting subpopulations. The optimization results show that the resultant force of the shredder central shaft by using IGA is less than the traditional metaheuristic algorithm, which greatly improves the dynamic balance of the SMS. Validated via ADAMS simulation, the results are in good agreement with the theoretical optimization analysis.


2014 ◽  
Vol 494-495 ◽  
pp. 1286-1289
Author(s):  
Shi Gang Cui ◽  
Guang Ming Zeng ◽  
Fan Liang ◽  
Jiang Lei Dong

This paper presents a search strategy for single mobile robots to realize the active olfaction (also called odor/gas source localization or plume tracing). The odor source localization is regarded as a kind of dynamic function optimization problem in this article, using the simulated annealing algorithm to calculate the optimal solution of density distribution function, namely the odor source location. The simulation experiments results in indoor ventilated environment show that the robot can track in plume and locate the odor source under the area of the 10m*10m, and it can effectively jump out of local maximum values in the process of search.


2011 ◽  
Vol 58-60 ◽  
pp. 1031-1036
Author(s):  
Dong Mei Yan ◽  
Cheng Hua Lu

This paper analyzed the principle and insufficient of traditional simulated annealing algorithm, and on the basis of the traditional simulated annealing algorithm, this paper used improved simulated annealing algorithm to solve vehicle routing problems. The new algorithm increases memory function, and keeps the current best state to avoid losing current optimal solution while reducing the computation times and accelerating the algorithm speed. The experimental results show that, the algorithm can significantly improve the optimization efficiency, and has faster convergence speed than traditional simulated annealing algorithm.


2010 ◽  
Vol 34-35 ◽  
pp. 317-321
Author(s):  
Feng Chen ◽  
Jiang Zhu

The main function of turning linkage of automobile is to realize the ideal relations of turn angle of the internal and external wheels when vehicles steering. At present the main methods on design computing and verifying turning linkage have still been the planar graphing and analysis method, therefore it is very important to adopt optimization methods to design the steering linkage. Being satisfied with the Ackerman theory steering characteristics and boundary constraints, considering the ideal relationship of steering angles between external and internal wheels in steering linkage to ensure motion accuracy of automobile, optimization model of turning linkage is established. Then the objective function with penalty terms is built by penalty strategy with addition type, so the constrained optimization is transformed into the unconstrained optimization. The simulated annealing algorithm is adopted to optimize turning linkage of automobile, so that optimization process was simplified and the global optimal solution is ensured reliably.


2009 ◽  
Vol 407-408 ◽  
pp. 268-272 ◽  
Author(s):  
Li Hong Qiao ◽  
Yi Xin Zhu ◽  
Jian Jun Yang ◽  
Yang Li

The production organized in flexible manufacturing cells (FMC) can be a complicated issue when they are constrained by machines, robots, equipment and some other resources. Since machines and robots are the main bottleneck to the efficiency of FMC, this paper focused on the modeling and scheduling problem constrained by machines and robots. A common model representation, colored timed Petri net (CTPN) was utilized to build a FMC model constrained by robots and machines, which was then transformed to the simulation model. The scheduling problem was studied to establish a mathematical model of the FMC constrained by machines and robots. According to the model, a genetic algorithm was proposed to search an optimal solution by using an indirect coding of scheme. The effectiveness of the proposed algorithm was validated via an instance and the comparison with the result from the solution of simulated annealing algorithm.


Transport ◽  
2011 ◽  
Vol 26 (2) ◽  
pp. 133-140 ◽  
Author(s):  
Arash Jahangiri ◽  
Shahriar Afandizadeh ◽  
Navid Kalantari

In recent years, natural and man-made disasters have increased and consequently put people's lives in danger more than before. Some of the crises are predictable. In these cases, there is a limited time for effective respond minimizing fatalities when people should be evacuated in a short time. Therefore, a transportation network plays a key role in evacuation. Hence, the outbound paths of urban networks are not sufficient from the viewpoint of number and capacity to encounter a huge amount of people; furthermore, it is costly to construct new routes or increase the capacity of the existing ones. Thus, a better utilization of the existing infrastructure should be considered. The article presents a model that determines optimum signal timing and increases the outbound capacity of the network. Moreover, in regard for the magnitude of the problem, an optimal solution could not be reached employing ordinary methods; therefore, the simulated annealing algorithm which is a meta-heuristic technique is used. The results of this study demonstrated that the objective function of the problem was greatly improved. Santrauka Pastaruoju metu gamtos ir žmonijos sukeltų nelaimių padaugėjo, todėl susiduriama su daugiau pavojų nei anksčiau. Kai kurių krizių ir nelaimių negalima numatyti. Tokiais atvejais veiksmingas reagavimo laikas yra ribotas, bet padeda sumažinti mirties atvejų, greitai evakuojant žmones. Šiuo atveju ypač svarbus yra transporto tinklas ir transportavimas. Iš miesto į užmiestį vedančios gatvės nėra pakankamai efektyvios, norint pervežti didelį žmonių skaičių. Be to, brangu pradėti rengti naujus maršrutus arba didinti jau esančių gatvių pralaidumą. Todėl turėtų būti apsvarstytas geresnis esančios transporto infrastruktūros panaudojimas. Straipsnyje nagrinėjamas modelis, nulemiantis optimalų šviesoforo signalo laiko nustatymą ir padidinantis išvykstančiųjų skaičių. Atsižvelgiant į problemos svarbą, optimalus sprendimas negali būti priimtas, naudojant įprastus metodus. Todėl naudojamas metaeuristinis metodas – modeliuojamasis atkaitinimo algoritmas (simulated annealing algorithm). Šio darbo rezultatai rodo, kad problemos tikslo funkcija labai pagerėjo. Резюме В настоящее время в мире увеличилось число стихийных бедствий и бедствий, связанных с неосторожной деятельностью людей. Значительную часть бедствий предсказать невозможно. В таких случаях эффективное время реагирования ограничено, что в свою очередь помогает уменьшить количество смертельных исходов и несчастных случаев при эвакуации населения. В этом случае транспортная сеть и сам процесс транспортирования играют решающую роль. Улицы, ведущие из города, становятся неэффективными из-за огромного количества людей. Кроме того, подготовка новых маршрутов или увеличение пропускной способности имеющихся улиц являются дорогостоящими мероприятиями. Поэтому следует проанализировать возможности более эффективного использования уже имеющейся транспортной инфраструктуры. В статье представлена модель, позволяющая определить выбор и установить оптимальное время сигнала светофора во время аварийной эвакуации с целью увеличить число эвакуируемых. Учитывая важность проблемы, оптимальное решение не может быть принято с использованием обычных методов. Поэтому используется метаэвристический метод – алгоритм имитации отжига (simulated annealing algorithm). Результаты, представленные в исследовании, показали, что целевая функция исследуемой проблемы значительно улучшилась


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xibin Zhao ◽  
Hehua Zhang ◽  
Yu Jiang ◽  
Songzheng Song ◽  
Xun Jiao ◽  
...  

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.


2011 ◽  
Vol 321 ◽  
pp. 204-207
Author(s):  
Ping Yuan Xi ◽  
Fu Zhou Zhao

Pressure vessel is not only the equipment used in the process industrial production, but also a more vulnerable to accidents special equipment. Under normal circumstances, in addition to bear the majority of media pressure, pressure vessels usually accompanied by the joint role of the high temperature, high pressure or media corrosion. Therefore, the design on the pressure vessels in anomaly conditions and the dynamic response not only helps to the research and development of warning surveillance and prevention technology about pressure vessels in anomaly conditions, but also contribute to the correct evaluation of the feasibility and reliability.So the simulated annealing algorithm based on penalty strategy is adopted to solver the optimization model of pressure vessels.


Sign in / Sign up

Export Citation Format

Share Document