Discrete evidence generally exists in the fields of expert systems, pattern recognition, and decision processing. How to solve the fusion of discrete evidence is an open question. In order to solve the problem that th...
详细信息
ISBN:
(纸本)9781728158556
Discrete evidence generally exists in the fields of expert systems, pattern recognition, and decision processing. How to solve the fusion of discrete evidence is an open question. In order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences, a method for calculating the shortest path based on dijkstra is proposed. First, the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible, and then the Jousselme distance between the two pairs of evidence between the evidence groups is calculated. The Jousselme distance is designed to measure the conflict between the evidence. Then the dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme distance. The path here indicates the discrete evidence group with the largest fusion distance and smallest fusion distance. Then use Dempster combination to fuse the evidence after weighted average and give the interval value of BPA. Finally, two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.
The balancing of the disassembly line directly affects the productivity of the disassembly process. The disassembly line balancing (DLB) problem can be determined as assigning the tasks to serial workstations to optim...
详细信息
The balancing of the disassembly line directly affects the productivity of the disassembly process. The disassembly line balancing (DLB) problem can be determined as assigning the tasks to serial workstations to optimize some performance measures like number of workstations, cycle time, removing hazardous parts earlier, etc. The aim of the paper is to develop an efficient heuristic algorithm to minimize the number of workstations under a pre-known cycle time. In this paper, a genetic algorithm (GA) and a constructive heuristic based on the dijkstra algorithm is proposed to solve the DLB problem with stochastic task times that is caused by the nature of disassembly operation. The proposed algorithms are tested on benchmark problems and compared with the results of the piecewise-linear model (PLM) and simulated annealing (SA). The average relative percentage deviation is applied to transfer the obtained number of workstations. The results obtained by GA are clearly superior in all tests problem according to average relative percentage deviation. Moreover, the proposed constructive heuristic based on the dijkstra algorithm is also superior to PLM and SA algorithm with respect to number of workstations and the computational times. The proposed approaches can be a very competitive and promising tool for further research in DLB literature and real cases in industries according to test results. Disassembly lines which need less time or number of workstations for balancing may be simply designed by the proposed techniques.
The aim of this study is to analyse dynamic programming in large scale, complex networks is more important in the fields of scientific and engineering. Recent applications needs the analysis of scale-free networks wit...
详细信息
The shipping industry is currently the sixth largest source of global emissions, generating one billion tons of greenhouse gases annually. Physical Internet is a leading solution to enhance the efficiency of shipping ...
详细信息
The shipping industry is currently the sixth largest source of global emissions, generating one billion tons of greenhouse gases annually. Physical Internet is a leading solution to enhance the efficiency of shipping operations and reduce CO2 emissions. In a physical internet framework, this research compares and simulates two sequencing strategies, based on the dijkstra algorithm, designed to optimize the routing of terminal vehicles in managing modular containers at terminals. Our results indicate that the proposed method could save the total travel time of Automated Guided Vehicles by 1.2% and lead to a 0.5% reduction in global CO2 emissions if implemented in the top 100 container ports in the world. We show that the physical internet contributes positively to mitigating climate change in maritime transport, towards eventually achieving cargo neutrality. Furthermore, our proposed mathematical model provides decision aid for handling modular containers in terminals.
Due to the poor representation of NEDC emission test, the European Commission put into the force a new procedure, which contains both a laboratory test and a real word driving test. In this new test procedure, even th...
详细信息
Due to the poor representation of NEDC emission test, the European Commission put into the force a new procedure, which contains both a laboratory test and a real word driving test. In this new test procedure, even though WLTC replaces NEDC, it is required to test the vehicle under real traffic conditions, which contains urban, rural and highway segments. Due to the new emission regulation, considerable number of academic work focus on the creation of RDE (Real Driving Emission) routes and RDE tests. In this study, it is introduced a new methodology for creating potential RDE routes. The routes, created in MATLAB code by using Istanbul road data containing a half an hour average trip records were used to predict a probable RDE test road. This model creates a number of RDE routes starting from defined coordinates and then analyses all alternative routes with respect to traffic flow rate and RDE boundary conditions identified by the European Commission. The routes obtained using the methodology developed are tested in real life conditions and evaluated according to actual existing traffic conditions. The agreement between the results of the method and the results of the actual driving test is limited in urban road section. However, for rural and highway road sections, there is a significant agreement between the predictions and actual test results.
Background and purpose: This study developed a trajectory search method for biaxially rotational dynamic- radiation therapy (BROAD-RT) using a new O-ring-shaped linac, aimed at identifying a patient-specific trajector...
详细信息
Background and purpose: This study developed a trajectory search method for biaxially rotational dynamic- radiation therapy (BROAD-RT) using a new O-ring-shaped linac, aimed at identifying a patient-specific trajectory in a commercial treatment planning system. Subsequently, its efficacy in the treatment of pancreatic cancer was assessed. Materials and methods: BROAD-RT is a beam delivery technique in which the gantry and O-ring are simultaneously rotated around two axes. A beam's eye view-based structure map was generated, and the dijkstra algorithm was then applied to explore the BROAD-RT for minimizing radiation doses to critical organs in RayStation. This procedure was evaluated in 10 patients with pancreatic cancer. For each patient, two different plans were created: volumetric modulated arc therapy (VMAT) plan with coplanar and BROAD-RT trajectory. The effects of different trajectories on the plan and dosimetric indices were assessed for each delivery technique. Results: The mean modulation complexity score for VMAT (MCSv) and aperture area (AA) (x103 cm2) were 0.3 f 0.0 and 24.8 f 3.9 for the coplanar trajectory and 0.4 f 0.1 and 35.2 f 7.1 for the BROAD-RT trajectory, respectively, with both MCSv (p = 5 x 10- 5) and AA (p = 0.0002) values significantly higher for the BROAD-RT trajectory. Dose difference between the coplanar and BROAD-RT trajectories reduced the dose to the stomach and duodenum. Conclusions: Our study conducted an automated search for patient-specific BROAD-RT trajectory using a new Oring-shaped linac and implemented these trajectories in RayStation. Dose distributions were reduced in the intermediate-dose regions with BROAD-RT trajectory.
Multimodal transportation systems play a pivotal role in enabling the flow of goods across different regions. Traditional models used in the prediction of route selection often overlook cost factors, leading to elevat...
详细信息
In a context where autonomous navigation aims to enhance safety and comfort, this work introduces an adaptive weather routing algorithm for autonomous ships. Unlike traditional ships, where the final decision on the r...
详细信息
ISBN:
(纸本)9798350379013;9798350379006
In a context where autonomous navigation aims to enhance safety and comfort, this work introduces an adaptive weather routing algorithm for autonomous ships. Unlike traditional ships, where the final decision on the route is always entrusted to the captain, despite possible support from weather routing algorithms, on autonomous ships, it is necessary to automate the trajectory choice to protect cargo, structure, and, if present, crew engaged in activities, for example, research. The core of the study is the development of an efficient adaptive weather routing model that optimizes the ship's response in adverse marine conditions, implementing two approaches: the dijkstra algorithm and the genetic algorithm. The comparison between these methods aims to determine which is more effective in adapting to such challenges, with the final goal of ensuring safer, more comfortable journeys with lower risks for cargo and ship.
Due to the continuous growth of air traffic demand, Free Route Airspace (FRA) will be promoted and applied full-time in the future. The reasonable configuration of sector entry and exit points is very important for th...
详细信息
ISBN:
(纸本)9798350333626
Due to the continuous growth of air traffic demand, Free Route Airspace (FRA) will be promoted and applied full-time in the future. The reasonable configuration of sector entry and exit points is very important for the improvement of flight efficiency, safety, and situation awareness for air traffic controllers. This paper proposed a dynamic cooperative configuration method of entry and exit points for multiple sectors in FRA considering wind forecasts from the perspective of airspace traffic flow orderliness and flight performance based on real-time traffic demand for FRA. Firstly, an airspace wind network model is established based on the wind forecast data, and the dijkstra algorithm is used to generate the wind optimal trajectories for flights. Then, we developed a dynamic co-configuration model of entry and exit points for multiple sectors and solved it using the NSGA-II algorithm. Finally, we take western China airspace as an example and select a typical day to conduct a dynamic cooperative configuration experiment of entry and exit points to verify the feasibility of the proposed method.
An evacuation navigation model incorporating a fire's detrimental effect on evacuees' escape capability is presented. Fire is one of the most common hazards in buildings that severely impacts evacuees' esc...
详细信息
暂无评论