Computer-aided operation planning and 3-dimensional osteotomy guidance for alveolar distraction

Objectives: In alveolar distraction, in cases of severe atrophy in particular, it is often difficult to perform osteotomies in order to make a transport segment in optimal size and shape. Moreover care must be taken, not to damage the closely locating anato- mical structures such as the maxillary sinus, the inferior alveolar nerve, and the roots of the neighboring teeth. For setting ideal osteotomy lines exactly, we have developed a CT-based preoperative planning tool. Methods: 3-dimensional visual reconstruction of the jaw is created from the preoperative CT scans (1.0-mm slice thick- ness). Using the image-processing software Mimics (Materialise, Yokohama, Japan), various procedures of virtual cutting are simulated first to determine optimal osteotomy lines and to design an ideal transport segment. After the computer planning, data from the virtual solid model are transferred to a rapid prototype model, and a guiding splint is made to transfer the planned surgical simulation to the actual surgery. Results: The method was used in a case of severe atrophy of the anterior maxilla. The patient had a large maxillary sinus requir- ing a precise osteotomy in this critical area. Using the splint allowing a 3-dimensional guidance, alveolar osteotomies were easily done to achieve a transport segment in sufficient dimen- sion as planned, and any perforation of the maxillary sinus could be avoided. Finally the alveolar distraction of 10mm has suc- cessfully been performed. Conclusion: The preoperative planning method and the guiding splint described here are useful in problematic cases requiring an extremely precise osteotomy due to lack of bony space.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Hatékonyság növelése tervezéssel - avagy: aggregált tervezés alkalmazása egy magyar vállalatnál = Improving efficiency with production planning - Applying aggregate planning at a Hungarian company

A cikk alapvető kérdése, hogy miképpen használható a tervezés a termelési folyamatok, s ezzel a vállalati m}uködés egészének hatékonyságnövelése érdekében. A termeléstervezés szintjei és eszközei közül a középtávú aggregált tervezésre koncentrálunk. Ennek oka elsősorban az, hogy tapasztalatunk szerinte tervezési szint gyakorlati alkalmazása még nem tekinthető elterjedtnek, s ebből következően az eszköz alaposabb ismerete és alkalmazásának elterjedése jelentős tartalékokat tárhat fel a m}uködési hatékonyság növelése terén. A dolgozat a termeléstervezés klasszikusnak tekinthető modelljét alkalmazza egy hazai vállalat esetében. Az elemzés során vizsgáljuk a modell alkalmazhatóságát és a különböző tervezési alternatívák hatását a hatékonyság növelésére. A modell számítógépes megoldását a Microsoft Excel Solver programjával végeztük. _______ The article demonstrates how production planning, especially aggregate production planning can positively influence the competitiveness of production firms. First the structure of production planning, different, but interconnected levels of it are introduced than the aggregate planning is elaborated in more details. Reason for focusing on aggregate planning lies in the fact that according to our experience aggregate planning is an operation planning method applied least of all production planning methods in Hungary. Due to this we are convinced that demonstrating a real case study in this area can help managers to realize that adopting it can significantly influence e±ciency in operation and represent important source of development. We applied a classic aggregate planning model for a Hungarian producing company. We have tested the adaptability of the model and also the effect of different concrete planning scenarios on efficiency. Solution of the mathematical model is calculated using the program of Microsoft Excel Solver.

Development of Planning And Evaluation Models For Superstreets

Despite the extensive implementation of Superstreets on congested arterials, reliable methodologies for such designs remain unavailable. The purpose of this research is to fill the information gap by offering reliable tools to assist traffic professionals in the design of Superstreets with and without signal control. The entire tool developed in this thesis consists of three models. The first model is used to determine the minimum U-turn offset length for an Un-signalized Superstreet, given the arterial headway distribution of the traffic flows and the distribution of critical gaps among drivers. The second model is designed to estimate the queue size and its variation on each critical link in a signalized Superstreet, based on the given signal plan and the range of observed volumes. Recognizing that the operational performance of a Superstreet cannot be achieved without an effective signal plan, the third model is developed to produce a signal optimization method that can generate progression offsets for heavy arterial flows moving into and out of such an intersection design.

Optimization of container process at seaport terminals

Seaport container terminals are an important part of the logistics systems in international trades. This paper investigates the relationship between quay cranes, yard machines and container storage locations in a multi-berth and multi-ship environment. The aims are to develop a model for improving the operation efficiency of the seaports and to develop an analytical tool for yard operation planning. Due to the fact that the container transfer times are sequence-dependent and with the large number of variables involve, the proposed model cannot be solved in a reasonable time interval for realistically sized problems. For this reason, List Scheduling and Tabu Search algorithms have been developed to solve this formidable and NP-hard scheduling problem. Numerical implementations have been analysed and promising results have been achieved.

Flexible implementation of power system corrective topology control

This paper proposes a novel decision making framework for optimal transmission switching satisfying the AC feasibility, stability and circuit breaker (CB) reliability requirements needed for practical implementation. The proposed framework can be employed as a corrective tool in day to day operation planning scenarios in response to potential contingencies. The switching options are determined using an efficient heuristic algorithm based on DC optimal power flow, and are presented in a multi-branch tree structure. Then, the AC feasibility and stability checks are conducted and the CB condition monitoring data are employed to perform a CB reliability and line availability assessment. Ultimately, the operator will be offered multiple AC feasible and stable switching options with associated benefits. The operator can use this information, other operating conditions not explicitly considered in the optimization, and his/her own experience to implement the best and most reliable switching action(s). The effectiveness of the proposed approach is validated on the IEEE-118 bus test system. (C) 2015 Elsevier B.V. All rights reserved.

冷轧MES机组作业计划过程中的任务分配法

基于鞍钢新轧集团股份有限公司冷轧薄板厂MES工程的实际情况,介绍了机组排产作业计划过程中的任务分配方法。该方法以机组与生产任务的最佳匹配、机组的负荷平衡为性能指标,采用了实时最小负荷分配规则,科学地解决了冷轧生产线CIMS环境下机组排产作业计划的在线生成问题,实现了生产线上的生产路径优化控制,从而提高了生产质量和设备利用率。

Reconfiguracao de sistemas de distribuicao radiais utilizando o criterio de queda de tensao

Network reconfiguration in distribution systems can be carried out by changing the status of sectionalizing switches and it is usually done for loss minimization and load balancing. In this paper it is presented an heuristic algorithm that accomplishes network reconfiguration for operation planning in order to obtain a configuration set whose configurations have the smallest active losses on its feeders. To obtain the configurations, it is used an approached radial load flow method and an heuristic proceeding based on maximum limit of voltage drop on feeders. Results are presented for three hypothetical systems largely known whose data are available in literature and a real system with 135 busses. In addition, it is used a fast and robust load flow which decreases the computational effort.

Otimização da distância de extração de madeira com forwarder

The activities and management operations of wood harvesting do not have good computational tools available to help the forest technicians with the task of cost reduction. In many cases, machines of high investment are used in wood harvesting without adequate operation planning; consequently, the cost per hour of these machines, which is high, could be reduced. Using technological resources such as the Geographic Information Systems (GIS) integrated with the Global Positioning System (GPS), which are the basis of precision harvesting. In this research, a technological tool capable of calculating and optimizing the average skidding distance of the forwarder was developed. It was used in stands of different sizes and formats through mathematical techniques and available functionalities in the Geographic Information System GRASS. The developed tool, called optimized model, divides the stand in small parts in relation to shorter skidding distances. The main variable considered was the alignment of plantation. The model was tested in eucalypt stands located in the State of São Paulo. Sixteen stands were randomly selected: eight with a rectangular polygon form, and eight with irregular polygon form. The main variables were collected in these stands. Results showed that the optimized model developed, is efficient and flexible. It was possible to divide the stands in small parts resulting in smaller skidding medium distances. The stands with irregular form had shorter skidding medium distances than the rectangular stands.

Reconfiguração de sistemas de distribuição de energia elétrica utilizando a metaheurística busca em vizinhança variável

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Modelos de programação linear inteira mista para resolver problemas de otimização de sistemas de distribuição de energia elétrica radiais

Pós-graduação em Engenharia Elétrica - FEIS

Análise e desenvolvimento de algoritmos eficientes de programação linear para o problema de planejamento de sistemas de transmissão a longo prazo

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Otimização da distância de extração de madeira com forwarder

Pós-graduação em Agronomia (Energia na Agricultura) - FCA