• Journal of the Korean Professional Engineers Association
• /
• v.28 no.4
• /
• pp.54-75
• /
• 1995

This synthesis has been prepared from a review of literature on Truck Escape Ramps technology and a survey of current practice by state department of transportation. Their locations have been determined usually from a combination of accident experience and en-gineering judgement, but new tools are emerging that can identify needs and sites without waiting for catastrophic accidents to happen. The Grade Severity Rating Systems holds promise in this regard. Design Procedures for truck excape ramps continue to evolve. Gravel arrester beds are clearly the preferred choice across the country Rounded aggregate, uniformly graded in the approximate size range of 13 to 18mm. Tech-nical publications typically have dassified TER types as paved gravity, sandpile, and ar-rester bed ramps. The design speed for vehicle entry into the ramp in critical to the deter-mination of ramp length. An escape ramp should be designed for a minimum entry speed of 130km/hr, a 145km/hr design being preferred. The ramps should be straight and their angle to the roadway align-ment should be as possible. The grade of truck escape ramps show the adjustment of ramp design to local topography, such as the tradeoff of ramp length against earthwork requirements. A width of 9 to 12m would more safety acommodate two or more outof con-trol vehicles. Reguarding comments on the most effective material, most respondents cited their own specification or referred to single graded, rounded pea gravel. The consensus essentially Is that single graded, well -rounded gravel is the most desirable material for use in arrester beds. The arrester beds should be constructed with a minimum aggregate depth of 30cm. Successful ramps have used depths between 30 and 90cm.

• Journal of radiological science and technology
• /
• v.34 no.1
• /
• pp.51-58
• /
• 2011

The aim of the study is to analyze the dose delivery error depending on the depth variation according to target positions and arc trajectories by comparing the simulated treatment planning with the actual dose delivery in conformal arc therapy. We simulated the conformal arc treatment planning with the three target positions (center, 2.5 cm, and 5 cm in the phantom). For the experiments, IMRT body phantom (I’mRT Phantom, Wellhofer Dosimetry, Germany) was used for treatment planning with CT (Computed Tomography, Light speed 16, GE, USA). The simulated treatment plans were established by three different target positions using treatment planning system (Eclipse, ver. 6.5, VMS, Palo Alto, USA). The radiochromic film (Gafchromic EBT2, ISP, Wayne, USA) and dose analysis software (OmniPro-IMRT, ver. 1.4, Wellhofer Dosimetry, Germany) were used for the measurement of the planned arc delivery using 6 MV photon beam from linear accelerator (CL21EX, VMS, Palo Alto, USA). Gamma index (DD: 3%, DTA: 2 mm) histogram and dose profile were evaluated for a quantitative analysis. The dose distributions surrounded by targets were also compared with each plans and measurements by conformity index (CI), and homogeneity index (HI). The area covered by 100% isodose line was compared to the whole target area. The results for the 5 cm-shifted target plan show that 23.8%, 35.6%, and 37% for multiple conformal arc therapy (MCAT), single conformal arc therapy (SCAT), and multiple static beam therapy, respectively. In the 2.5 cm-shifted target plan, it was shown that 61%, 21.5%, and 14.2%, while in case of center-located target, 70.5%, 14.1%, and 36.3% for MCAT, SCAT, and multiple static beam therapy, respectively. The values were resulted by most superior in the MCAT, except the case of the 5 cm-shifted target. In the analysis of gamma index histogram, it was resulted of 37.1, 27.3, 29.2 in the SCAT, while 9.2, 8.4, 10.3 in the MCAT, for the target positions of center, shifted 2.5 cm and 5 cm, respectively. The fail proportions of the SCAT were 2.8 to 4 times as compared to those of the MCAT. In conclusion, dose delivery error could be occurred depending on the target positions and arc trajectories. Hence, if the target were located in the biased position, the accurate dose delivery could be performed through the optimization of depth according to arc trajectory.

• The Journal of Korean Society for Radiation Therapy
• /
• v.35
• /
• pp.41-51
• /
• 2023

Purpose: This study compares and analyzes the image quality of 3D-CBCT(Cone Beam Computed-Tomography) and Gated CBCT according to baseline changes during SBRT(Stereotactic Body RadioTherapy) in lung cancer patients to find a useful CBCT method for correcting movement due to breathing Materials and methods : Insert a solid tumor material with a diameter of 3 cm into the QUASAR^TM phantom. 4-Dimentional Computed-Tomography(4DCT) images were taken with a speed of the phantom at period 3 sec and a maximum amplitude of 20 mm. Using the contouring menu of the computerized treatment planning system Eclipse^TM Gross Tumor Volume was outlined on solid tumor material. Set-up the same as when acquiring a 4DCT image using Truebeam STx^TM, breathing patterns with baseline changes of 1 mm, 3 mm, and 5 mm were input into the phantom to obtain 3D-CBCT (Spotlight, Full) and Gated-CBCT (Spotlight, Full) images five times repeatedly. The acquired images were compared with the Signal-to-Noise Ratio(SNR), Contrast-to-Noise Ratio(CNR), Tumor Volume Length, and Motion Blurring Ratio(MBR) based on the 4DCT image. Results: The average Signal-to-Noise Ratio, Contrast-to-Noise Ratio, Tumor Volume Length and Motion Blurring Ratio of Spotlight Gated CBCT images were 13.30±0.10%, 7.78±0.16%, 3.55±0.17%, 1.18±0.06%. As a result, Spotlight Gated-CBCT images according to baseline change showed better values than Spotligtht 3D-CBCT images. Also, the average Signal-to-Noise Ratio, Contrast-to-Noise Ratio, Tumor Volume Length and Motion Blurring Ratio of Full Gated CBCT images were 12.80±0.11%, 7.60±0.11%, 3.54±0.16%, 1.18±0.05%. As a result Full GatedCBCT images according to baseline change showed better values than Full 3D-CBCT images. Conclusion : Compared to 3D-CBCT images, Gated-CBCT images had better image quality according to the baseline change, and the effect of Motion Blurring Artifacts caused by breathing was small. Therefore, it is considered useful to image guided using Gated-CBCT when a baseline change occurs due to difficulty in regular breathing during SBRT that exposes high doses in a short period of time

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.