共查询到20条相似文献,搜索用时 28 毫秒
1.
P. Carrasqueira M. J. Alves J. M. Dias H. Rocha T. Ventura B. C. Ferreira M. C. Lopes 《International Transactions in Operational Research》2023,30(1):224-238
Intensity-modulated radiation therapy is used worldwide to treat cancer patients. The objective of this treatment is to deliver a prescribed radiation dose to the tumor while sparing, as much as possible, all the healthy tissues, especially organs at risk (OAR). This means that the planning of a radiotherapy treatment should take into consideration conflicting objectives: to be able to spare as much as possible the OAR guaranteeing, at the same time, that the desired radiation is delivered to the volumes to treat. While the volumes to treat can be adequately irradiated from almost any set of directions, the radiation directions that are chosen have a determinant impact on the OAR. This means that those directions that provide an improved OAR sparing should be selected. The choice of radiation directions (beam angles) can thus be interpreted as being fundamentally determined by the OAR, with the radiation intensities associated with each of these directions being determined by the needed radiation to be delivered to the volumes to treat. In this work, we interpret the radiotherapy treatment planning problem as a bi-level optimization problem. At the upper level, OAR control the choice of the beam angles, which are selected aiming at OAR sparing. At the lower level, the optimal radiation intensities are decided by the volumes to treat, considering the beam angle ensemble obtained at the upper level. The proposed bi-level approach was tested using 10 clinical head-and-neck cancer cases already treated at the Portuguese Institute of Oncology in Coimbra. 相似文献
2.
《Optimization methods & software》2012,27(2):276-299
We consider the approximation of a given m×n non-negative real matrix A by a weighted non-negative sum of binary matrices. Such approximation problems arise in intensity modulated arc therapy (IMAT), an advanced form of radiotherapy for cancer. In that context, the binary matrices S i represent the ‘open’ positions for the radiation beamlets in a so-called aperture, and the corresponding weights denote the radiation intensity associated with the aperture. The weighted sum of apertures thus represents an approximation (typically based on a small number of apertures) to the ideal radiation distribution at a given angle given by the matrix A. The determination of an optimal approximation of this type for a limited number of S i ’s is termed a segmentation problem. The approximation problem considered here (IMAT) is a set of coupled segmentation problems with delivery constraints. The delivery constraints are mechanical and limit both the types of apertures that may be employed as well as the changes that may be made to apertures between successive angles as the radiation delivery equipment moves in sweeps along an arc around the patient. We present an effective heuristic algorithm using network optimization models to solve this IMAT optimization problem. 相似文献
3.
AbstractRPA is used to complete repetitive tasks usually completed by humans. A robot is a software programed to mimic the operations of humans on computer systems. Robots are configured to accomplish these tasks using algorithms from the machine learning and artificial intelligence field. Using RPA leads to reduced errors in the processing of tasks and reduced completions times to carry out the tasks. This paper calculates the number of software licenses required to carry out thousands of transactions for financial services and proposes an assignment of the transactions to the robots. A two-phase linear integer optimization process is proposed. The first phase calculates the number of robots required to complete all of the tasks and the second phase assigns the tasks to the robots. Many different transaction types for financial services are to be completed, and each type has precise market operating hours, maximal delays in their treatment, different processing times and different volumes. The objective function minimizes the total number of robots, but also limits the number of robot startups and reconfigurations, since these operations take time to complete. The key behind the fast computing times to solve the problem is the formulation, where periods are defined at intersections of market operating hours. Preliminary tests are conducted on a real case provided by a bank in North America and a synthetic test case and show that the problem is solved quickly. 相似文献
4.
本文提出了一个新的布局整体优化算法,它的基本思想是:对布局区域按一定规则进行层次划分,然后将能最大改善目标函数的同层划分块中的氖器件进行交换。 相似文献
5.
本文介绍了电站自动化系统TCS2000的软件体系结构,详细说明了电力监控数据库的设计以及其中所用到的动态表结构、面向主题的数据管理、多线程等查询优化措施. 相似文献
6.
7.
随着飞机多电全电技术的迅猛发展,电力系统在飞机中的重要程度不断提升,而电弧故障是航空电力系统多发的一类电气故障,会引起飞机火灾,轻则烧毁线路,重则引起飞机坠毁。因此,航空交流故障电弧的研究对保障飞机电力系统的安全十分重要。针对传统航空交流故障电弧模型种类单一、难以准确模拟真实故障电弧的特点,基于航空交流故障电弧试验标准下点接触电极、点接触截断和松动接线柱试验中得到的故障电弧电压、电流特性进行分析后,提出模型改进方法,形成航空交流电弧仿真优化策略,从而涵盖所提航空交流电弧试验标准下的故障电弧特性。通过MATLAB/Simulink完成了电弧模型的搭建,对电弧数据及模型仿真结果进行特征量提取及比较,验证了航空交流故障电弧模型仿真策略和方法的有效性。 相似文献
8.
In this research, a novel near optimum automated rigid aircraft engine parts assembly path planning algorithm based on particle swarm optimization approach is proposed to solve the obstacle free assembly path planning process in a 3d haptic assisted environment. 3d path planning using valid assembly sequence information was optimized by combining particle swarm optimization algorithm enhanced by the potential field path planning concepts. Furthermore, the presented approach was compared with traditional particle swarm optimization algorithm (PSO), ant colony optimization algorithm (ACO) and genetic algorithm (CGA). Simulation results showed that the proposed algorithm has faster convergence rate towards the optimal solution and less computation time when compared with existing algorithms based on genetics and ant colony approach. To confirm the optimality of the proposed algorithm, it was further experimented in a haptic guided environment, where the users were assisted with haptic active guidance feature to perform the process opting the optimized assembly path. It was observed that the haptic guidance feature further reduced the overall task completion time. 相似文献
9.
针对电力自动化智能装置通信板件中光电转换模块及芯片等功率元件分布集中、热流密度大、可靠性要求高等特点,采用热分析软件FLOTHERM建立了某型智能变电站测控装置通信板件精细热分析模型,模拟了板件在特定温度下元件的温升并对散热器、热流通道进行了优化,最后在高低温试验箱对板件进行温升测试,验证了仿真模型的正确性和优化结果的合理性. 相似文献
10.
Networks-on-chip (NoC) is a promising communication architecture for next generation SoC. The size of buffer used in on-chip
routers impacts the silicon area and power consumption of NoC dominantly. It is important to plan the total buffer-size and
each router buffer-allocation carefully for an efficient NoC design. In this paper, we propose two buffer planning algorithms
for application-specific NoC design. More precisely, given the traffic parameters and performance constraints of target application,
the proposed algorithms automatically determine minimal buffer budget and assign the buffer depth for each input channel in
different routers. The experimental results show that the proposed algorithms can significantly reduce total buffer usage
and guarantee the performance requirements.
Supported by the National Natural Science Foundation of China (Grant No. 60803018) 相似文献
11.
12.
不共面P4P问题多解的判定方法 总被引:1,自引:0,他引:1
PnP问题源于照相机检测,即根据给定空间n个点的相互位置关系,确定摄象机在空间的方位。以前的研究成果表明,对于给定的空间三点,最多可以出现四个解。本文针对不共面的四点透射(P4P)问题,利用Wu-Ritt零点分解方法对问题进行分组分解,并经分析后得到了问题存在多解时的若干充分条件,从而在实际应用中很容易避开那些可能存在
在多解的观察点。 相似文献
在多解的观察点。 相似文献
13.
14.
In this paper we study several rectilinear terrain construction
problems, which model the leaf sequencing problems in
intensity-modulated radiation therapy (IMRT).
We present a novel unified approach
based on geometric techniques for solving these terrain
construction problems. Our ideas include formulating the terrain
construction problems as computing shortest paths in a weighted directed
graph and building the graph by computing optimal bipartite matchings on various geometric objects
subject to specific constraints of each of the problems. Further,
since we need to compute optimal bipartite matchings on many sets
of geometric objects, we use techniques for computing such
matchings in a batch fashion to speed up these matching
computations. Our approach leads to the first algorithms for several leaf
sequencing problems in IMRT that are practically fast and guarantee
an output which is optimal for a large sub-class of solutions. The previously known leaf
sequencing algorithms which are currently used in radiation therapy practice
are all heuristics that do not guarantee any good
quality of the output solutions and may run in a long time.
Our implementation
results show that our terrain construction algorithms run very
fast on real medical data (all under few seconds). 相似文献
15.
为了应对芯片设计复杂度的提升,电子设计自动化工具和方法也在不断进步。然而,EDA需要协调达到最佳的功率、性能和面积,通常其不能保证最优的解决方案。EDA工具在电路设计阶段包括逻辑综合、布局布线及验证等均属于多目标、多约束的非线性规划求解过程,且为了更好解决求解中的不确定性和易于出现局域极值等难题,基于神经网络的优化算法已被集成到EDA工具的设计流程中。首先对EDA中的优化问题、多目标优化计算及基于神经网络的优化算法进行了简要概述,继而详细梳理了基于神经网络的优化算法在逻辑综合、布局布线及验证等不同设计阶段中的优化求解方法,并阐述了当前研究所面临的挑战与机遇,希望为集成电路自动化设计及相关领域研究提供参考。 相似文献
16.
Gabriela García‐Ayala José Luis González‐Velarde Roger Z. Ríos‐Mercado Elena Fernández 《International Transactions in Operational Research》2016,23(3):433-458
The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts. 相似文献
17.
This work proposes an object-oriented unified optimization framework (UOF) for general problem optimization. Based on biological inspired techniques, numerical deterministic methods, and C++ objective design, the UOF itself has significant potential to perform optimization operations on various problems. The UOF provides basic interfaces to define a general problem and generic solver, enabling these two different research fields to be bridged. The components of the UOF can be separated into problem and solver components. These two parts work independently allowing high-level code to be reused, and rapidly adapted to new problems and solvers. The UOF is customized to deal with several optimization problems. The first experiment involves a well-known discrete combinational problem, wihle the second one studies the robustness for the reverse modeling problem, which is in high demanded by device manufacturing companies. Additionally, experiments are undertaken to determine the capability of the proposed methods in both analog and digital circuit design automation. The final experiment designs antenna for rapidly growing wireless communication. Most experiments are categorized as simulation-based optimization tasks in the microelectronics industry. The results confirm that UOF has excellent flexibility and extensibility to solve these problems successfully. The developed open-source project is publicly available. 相似文献
18.
19.
Matlab神经网络工具箱编程和Delphi对其调用 总被引:9,自引:0,他引:9
针对电弧炉炼钢氧化期是一个复杂的物理化学反应过程,难以建立机理模型,利用Matlab神经网工具箱建立BP神经网预测模型,并详细讨论该模型的编程设计问题,利用OLE自动化,用Delphi编写人机交互界面来指导冶炼生产。 相似文献
20.
Raul Mihali Mher Grigorian Tarek Sobh 《Journal of Intelligent and Robotic Systems》2000,29(3):277-294
Robotics experiences tremendous evolutions every year. Once a topic is mainly approached at research centers, read through highly specialized books and viewed distantly on scientific channels, nowadays it is a common and very approachable subject among undergraduate students of many universities. More and more robots are being designed every day, demanding technological implementation and production. This progress does not come without its glitches, however. A common and increasing problem that appears is the insufficient testing, simulation and optimization steps that a robotic construction needs to pass in order to achieve an efficient design. These steps prove to be difficult and sometimes discouraging, resulting in laborious work, due to lack of tools. This paper presents an example of a robotic optimization and testing, using a generic software package, applied on a custom manipulator, a tire-changing robot. Although the manipulator is designed with its own simulation and control package, it may lack optimality or validity. We implemented a different software package, focused on optimization and control of simple generic robots (XXX.RRR types) and apply the package on the tire-changer manipulator. The results provide improvements for the primary controlling software and confirm its correctness. 相似文献