CN105654202A - Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change - Google Patents

Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change Download PDF

Info

Publication number
CN105654202A
CN105654202A CN201511025356.1A CN201511025356A CN105654202A CN 105654202 A CN105654202 A CN 105654202A CN 201511025356 A CN201511025356 A CN 201511025356A CN 105654202 A CN105654202 A CN 105654202A
Authority
CN
China
Prior art keywords
scanning
paths
sweep
travelling
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201511025356.1A
Other languages
Chinese (zh)
Inventor
汪冬
吴宜灿
胡丽琴
裴曦
王文
曹瑞芬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei Institutes of Physical Science of CAS
Original Assignee
Hefei Institutes of Physical Science of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hefei Institutes of Physical Science of CAS filed Critical Hefei Institutes of Physical Science of CAS
Priority to CN201511025356.1A priority Critical patent/CN105654202A/en
Publication of CN105654202A publication Critical patent/CN105654202A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Biophysics (AREA)
  • General Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Genetics & Genomics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computational Linguistics (AREA)
  • General Engineering & Computer Science (AREA)
  • Biomedical Technology (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Artificial Intelligence (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Biology (AREA)
  • Development Economics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Game Theory and Decision Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Radiation-Therapy Devices (AREA)

Abstract

The invention discloses a method for optimizing a proton radiotherapy path in an active scanning manner by considering a scanning speed change. The method comprises the steps of according to different scanning speeds of a scanning point in different positions, establishing a traveling salesman problem model with variable scanning speed; and solving a scanning path with the shortest scanning time by using a global optimization algorithm and a genetic algorithm. According to the method, a scanning speed concept is introduced, so that a real scene can be accurately simulated, the requirement of practical engineering application is basically met, and the solved scanning path is the scanning path with the shortest scanning time under the condition that the scanning speeds are different.

Description

A kind of active scan mode proton radiotherapy method for optimizing route considering scan speed change
Technical field
The present invention relates to a kind of proton radiation for active scan mode treat in sweep velocity variable solve sweep time the shortest scanning pattern time problem model, belong to medical physics field, will be converted to, from the value models such as the most equidistant, the model that absolute location determines cost between whilst on tour calculating in travelling salesman's model of being applied to of scanning pattern.
Background technology
Along with the development of science and technology and the progress of society, proton radiation methods for the treatment of is widely used and develops, and active scan mode obtains significant progress and application especially. Active scan mode mainly uses accelerator to produce high energy proton bundle, is transported by device controls such as deflecting magnets, forms the sweep beam of continuous or discrete different-energy, tumor target in human body causes energy deposition, thus kill tumour cell. Carry out sweep beam under energy layer continuous or discontinuous go out move in bundle situation time, the path of sweep beam process is referred to as scanning pattern. The length of scanning pattern is through the path summation of each scanning spot, and sweep beam traveling time is through the summation of the traveling time of each scanning spot.
Existing research at present solves scanning pattern problem, but these researchs are directed to when assuming that sweep velocity is identical mostly, namely when scanning spot absolute location is different, the translational speed of scanning pattern is consistent, so just can simplify problem, be travelling salesman's problem that travelling cost is equal to travel distance by question variation. Apply this model solution problem, will inevitably with engineering reality in have certain error.
In engineering reality, sweep beam translational speed is not completely identical. Therefore, in the present invention, for solving the shortest scanning pattern problem, introducing sweep velocity concept, solving sweep time shortest path problem is press close to practical implementation as much as possible, can effectively reduce sweep velocity.
Summary of the invention
The technology of the present invention is dealt with problems: the deficiency overcoming existing model, a kind of active scan mode proton radiotherapy method for optimizing route considering scan speed change is provided, the travelling salesman's problem model solving the shortest scanning pattern problem sweep time in active scan mode speed variable situation, and the scanning pattern adopting global optimization method genetic algorithm for solving sweep time the shortest. Adopt this kind of model method, press close to practical implementation situation as much as possible, reduce scanning traveling time, to minimizing treatment time have certain contribution, especially to can scanning spot numerous scan mode contribution bigger.
The technical scheme of the present invention: a kind of active scan mode proton radiotherapy method for optimizing route considering scan speed change, it is characterised in that comprise following key step:
(1) setting up travelling salesman's problem model that sweep velocity is variable, sweep velocity when providing scanning spot position difference by parameters, calculates cost between whilst on tour.
ValueAB=LAB/VAB(1)
Wherein ValueABIt is path sweep time between AB, also it is exactly cost between whilst on tour between AB, LABIt is the spacing of AB two scanning spots, VABIt is that AB 2 is by mean scan speed;
Between total whilst on tour of one paths, cost is:
F = m a x ( M a x T i m e - Σ i = 0 ( L i / V i ) ) - - - ( 2 )
L i = ( x i - x i + 1 ) 2 + ( y i - y i + 1 ) 2 - - - ( 3 )
Wherein, the difference of cost and maximum value between total whilst on tour in F: one paths all paths, equals maximum value and subtracts cost summation between the whilst on tour on every paths, seek the minimum of time cost total value; MaxTime: one bigger constant, is similar to and equals number of paths * individual paths maximum time, ensures F > 0, it is intended that fitness calculating is converted to and solves max problem; Li: the spacing of i-th paths two scanning spots; Vi: the i-th paths point-to-point transmission mean scan speed calculated by parameter; (xi,yi)��(xi+1,yi+1): rising to endpoint location of the i-th paths;
(2) computation optimization scanning pattern, optimizes question variation for travelling salesman's problem by scanning pattern, and travelling cost equals sweep time, it may also be useful to global optimization approach genetic algorithm, and step is as follows:
A) setting evolution group size as N, be often for there being N number of itinerary, maximum evolutionary generation is gen, and first the N number of itinerary of random generation is as the initialize colony P evolved0, it is the coding required for genetic algorithm by each individual UVR exposure in colony;
B) often kind of path fitness is calculated according to formula 2;
C) according to fitness, the individuality that selection is hereditary is also hereditary;
Mi=Fi/��(Fi/N)(4)
MiIt is the fitness of the i-th paths in colony, FiBeing cost between total whilst on tour of the i-th paths, N is individual in population quantity.
D) according to crossover probability Pc, the individuality that selection needs are intersected and point of crossing, the coding for this individuality carries out interlace operation;
E) according to variation probability Pv, select the gene needing individuality and the variation made a variation, the coding for this individuality makes a variation;
F) repeating step b-e, until largest optimization number of times gen, otherwise return step a and continue iteration optimization;
(3) choose the individuality that in optimizing process, fitness is the highest, it is decoded as scanning pattern, and export final sweep time and scanning pattern;
The present invention's advantage compared with prior art is:
(1) by introducing sweep velocity concept, it is possible to more accurate simulation of real scenes, more press close to practical implementation, compare than original scanning pattern, effectively reduce overall sweep time, reduce the overall therapeutic time;
(2) when solving the shortest scanning pattern problem sweep time for large-scale scanning point during practical application, by adding sweep velocity model in global optimization approach genetic algorithm, so that required scanning pattern is the shortest scanning pattern sweep time when sweep velocity is variable, give security for accurately implementing proton radiotherapy fast;
Accompanying drawing explanation
Fig. 1 is schema in the present invention;
Fig. 2 is proton beam deflection schematic diagram in active scan;
Fig. 3 is scanning spot schematic diagram and scanning pattern schematic diagram; Wherein left figure is scanning position point schematic diagram, and right figure is scanning pattern schematic diagram.
Embodiment
The technology of the present invention overcomes the deficiency of existing model, the travelling salesman's problem model solving the shortest scanning pattern problem sweep time in a kind of active scan mode speed variable situation is proposed, and the scanning pattern adopting global optimization method genetic algorithm for solving sweep time the shortest.Adopt this kind of model method, press close to practical implementation situation as much as possible, reduce scanning traveling time, to minimizing treatment time have certain contribution, especially to can scanning spot numerous scan mode contribution bigger.
As shown in Figure 1, the present invention comprises model and sets up module, optimizes module, output module etc., provides the function and efficacy of each module and mutual connection relation.
(1) module set up by model: set up travelling salesman's problem model that sweep velocity is variable, and sweep velocity when providing scanning spot position difference by parameters, calculates cost between whilst on tour. Such as, ignoring on the bases such as magnetic field switching time, only think that sweep velocity is relevant with angular scanning rate and in the consistent situation of circular frequency, sweep velocity equals circular frequency and is multiplied by distance.
VA=w*dA(1)
VAIt is the sweep velocity of sweep beam at A point, dABeing scan magnet to scanning spot distance, w is angular scanning rate.
ValueAB=LAB/VAB(2)
Wherein ValueABIt is path sweep time between AB, also it is exactly cost between whilst on tour between AB, LABIt is the spacing of AB two scanning spots, VABIt is AB point-to-point transmission mean scan speed;
Between total whilst on tour of one paths, cost is:
F = m a x ( M a x T i m e - Σ i = 0 ( L i / V i ) ) - - - ( 3 )
L i = ( x i - x i + 1 ) 2 + ( y i - y i + 1 ) 2 - - - ( 4 )
Wherein, the difference of cost and maximum value between total whilst on tour in F: one paths all paths, equals maximum value and subtracts cost summation between the whilst on tour on every paths, seek the minimum of time cost total value; MaxTime: one bigger constant, is similar to and equals number of paths * individual paths maximum time, ensures F > 0, it is intended that fitness calculating is converted to and solves max problem; Li: the spacing of i-th paths two scanning spots; Vi: the i-th paths point-to-point transmission mean scan speed calculated by parameter; (xi,yi)��(xi+1,yi+1): rising to endpoint location of the i-th paths;
(2) computation optimization scanning pattern, optimizes question variation for travelling salesman's problem by scanning pattern, and travelling cost equals sweep time, it may also be useful to global optimization approach genetic algorithm, and step is as follows:
A) setting evolution group size as N, be often for there being N number of itinerary, maximum evolutionary generation is gen, and first the N number of itinerary of random generation is as the initialize colony P evolved0, it is the coding required for genetic algorithm by each individual UVR exposure in colony;
B) colony's fitness is calculated according to formula 2;
C) according to fitness, the individuality that selection is hereditary is also hereditary;
Mi=Fi/��(Fi/N)(4)
MiIt is the fitness of the i-th paths in colony, FiBeing cost between total whilst on tour of the i-th paths, N is individual in population quantity.
D) according to crossover probability Pc, the individuality that selection needs are intersected and point of crossing, the coding for this individuality carries out interlace operation;
E) according to variation probability Pv, select the gene needing individuality and the variation made a variation, the coding for this individuality makes a variation;
F) comparative result, if result does not reach largest optimization number of times, returns step a and continues iteration optimization;
G), after reaching maximum iteration time, iteration is stopped.
(3) choose the individuality that in optimizing process, fitness is the highest, it is decoded as scanning pattern, and export final sweep time and scanning pattern.
The travelling salesman's problem model solving the shortest scanning pattern problem sweep time in active scan mode speed variable situation, and the scanning pattern adopting global optimization method genetic algorithm for solving sweep time the shortest. Adopt this kind of model method, press close to practical implementation situation as much as possible, reduce scanning traveling time, to minimizing treatment time have certain contribution, especially to can scanning spot numerous scan mode contribution bigger.
As shown in Figure 2, P is a branch of proton beam, and bias motion direction after deflecting magnet (magnet) moves on the requirement position of target (target).
As shown in Figure 3, left figure is scanning position point schematic diagram, and points all in figure is all the position of a sweep beam; Right figure is scanning pattern schematic diagram, and proton beam will, from zero position, through each scanning position point, complete once to scan, and forms scanning pattern.
In a word, a kind of active scan mode proton radiotherapy method for optimizing route considering scan speed change of the present invention, difference according to sweep velocity under scanning spot different positions, set up travelling salesman's problem model that sweep velocity is variable, it may also be useful to the scanning pattern that global optimization approach genetic algorithm for solving sweep time is the shortest. The method is owing to introducing sweep velocity concept, it is possible to accurate simulation of real scenes, presses close to practical implementation, so that required scanning pattern is the shortest scanning pattern sweep time under sweep velocity different situations.

Claims (2)

1. considering an active scan mode proton radiotherapy method for optimizing route for scan speed change, its feature is as follows at performing step:
(1) travelling salesman's problem model that sweep velocity is variable is set up: the scanning pattern problem solving the shortest sweep time under sweep velocity is variable is converted into travelling salesman's problem model, solves the scanning pattern that has the shortest sweep time; Wherein, obtain the sweep velocity under different scanning position according to accelerator hardware, calculate the mean scan speed in the path between two scanning position points, calculate sweep time according to path length between mean scan speed and scanning position point; Travelling cost in travelling salesman's problem model equals sweep time, calculates travelling total time cost, sets up travelling salesman's problem model;
(2) scanning pattern calculates: use global optimization approach genetic Optimization Algorithm, based on travelling salesman's problem model that step (1) produces, travelling total time cost is used to calculate the fitness in path, initialize colony also goes through heredity selection, variation, interleaved mode, solves the shortest scanning pattern sweep time;
(3) result exports: global optimization computation genetic algorithm is chosen the shortest itinerary sweep time, calculated and export sweep time and scanning pattern after terminating to calculate.
2. a kind of active scan mode proton radiotherapy method for optimizing route considering scan speed change according to claim 1, it is characterized in that: described step (1) sets up the variable travelling salesman's problem model of sweep velocity, total travelling cost travelling total time cost in its path is:
F = m a x ( M a x T i m e - Σ i = 0 ( L i / V i ) ) - - - ( 1 )
L i = ( x i - x i + 1 ) 2 + ( y i - y i + 1 ) 2 - - - ( 2 )
Wherein, F be all paths of paths total whilst on tour between the difference of cost and maximum value, equal maximum value and subtract cost summation between the whilst on tour on every paths, seek the minimum of time cost total value; MaxTime: one bigger constant, is similar to and equals number of paths * individual paths maximum time, ensures F > 0, it is intended that fitness calculating is converted to and solves max problem; Li: the spacing of i-th paths two scanning spots; Vi: the i-th paths point-to-point transmission mean scan speed calculated by parameter; (xi,yi)��(xi+1,yi+1): the start-stop endpoint location of the i-th paths.
CN201511025356.1A 2015-12-30 2015-12-30 Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change Pending CN105654202A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201511025356.1A CN105654202A (en) 2015-12-30 2015-12-30 Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201511025356.1A CN105654202A (en) 2015-12-30 2015-12-30 Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change

Publications (1)

Publication Number Publication Date
CN105654202A true CN105654202A (en) 2016-06-08

Family

ID=56490916

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201511025356.1A Pending CN105654202A (en) 2015-12-30 2015-12-30 Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change

Country Status (1)

Country Link
CN (1) CN105654202A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106730407A (en) * 2016-11-18 2017-05-31 上海艾普强粒子设备有限公司 A kind of scanning illuminating method for particle therapy, device and treatment head
CN107185117A (en) * 2017-07-28 2017-09-22 哈尔滨理工大学 Towards the sigmatron zone routing optimization method of multiple tumor radiotherapy
CN107281657A (en) * 2017-07-28 2017-10-24 哈尔滨理工大学 A kind of radiotherapy apparatus high-energy light beam guiding method for optimizing route for multiple tumor

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106730407A (en) * 2016-11-18 2017-05-31 上海艾普强粒子设备有限公司 A kind of scanning illuminating method for particle therapy, device and treatment head
CN107185117A (en) * 2017-07-28 2017-09-22 哈尔滨理工大学 Towards the sigmatron zone routing optimization method of multiple tumor radiotherapy
CN107281657A (en) * 2017-07-28 2017-10-24 哈尔滨理工大学 A kind of radiotherapy apparatus high-energy light beam guiding method for optimizing route for multiple tumor
CN107185117B (en) * 2017-07-28 2019-05-28 哈尔滨理工大学 Sigmatron zone routing optimization method towards multiple tumor radiotherapy
CN107281657B (en) * 2017-07-28 2019-06-07 哈尔滨理工大学 A kind of radiotherapy apparatus high-energy light beam guiding method for optimizing route for multiple tumor

Similar Documents

Publication Publication Date Title
Yifei et al. Research on intelligent welding robot path optimization based on GA and PSO algorithms
JP5879446B2 (en) Treatment planning apparatus, particle beam treatment apparatus, and charged particle beam scanning path determination method
AU2022203362B2 (en) Fermionic simulation gates
JP2007531556A5 (en)
CN105654202A (en) Method for optimizing proton radiotherapy path in active scanning manner by considering scanning speed change
Wu et al. Explicit symplectic integrator for s-dependent static magnetic field
CN104020772A (en) Complex-shaped objective genetic path planning method based on kinematics
RU2013144928A (en) PROTON RADIATION USING SPOT SCANNING
Friedman et al. Toward a physics design for NDCX-II, an ion accelerator for warm dense matter and HIF target physics studies
CN105992230A (en) Wireless network planning method and device
CN109858798A (en) It is associated with the electric grid investment decision-making modeling method and device of modification measures and voltage indexes
Contreras et al. An improved variant of the conventional harmony search algorithm
Yaman et al. Impacts of genetic algorithm parameters on the solution performance for the uniform circular antenna array pattern synthesis problem
CN103426127A (en) Urban power network planning method based on pseudo-crossover taboo hybrid genetic algorithm
Andriyash et al. A spectral unaveraged algorithm for free electron laser simulations
CN102136041A (en) Method for reversely planning treatment plan and treatment plan system
Salcedo-Sanz et al. Hybrid L-systems–diffusion limited aggregation schemes
CN105787256B (en) A method of the particle beams fluence based on optimization algorithm is decomposed into pencil beam
Günther et al. Structure optimisation by thermal cycling for the hydrophobic-polar lattice model of protein folding
Jadoun et al. Enhanced particle swarm optimization for short-term non-convex economic scheduling of hydrothermal energy systems
EP4346338A1 (en) Particle accelerator system with fractal magnetic field geometry
Lu et al. Development of high intensity linear accelerator for heavy ion inertial fusion driver
Qin et al. Main magnet and central region design for a 10 MeV PET cyclotron CYCHU-10
Tsai Investigation of microbunching instabilities in modern recirculating accelerators
Guo et al. Node Localization Technology of Wireless Sensor Network (WSN) Based on Harmony Search (HS) Algorithm

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20160608