检索结果-内蒙古大学图书馆

Multi-Resolution dijkstra Method Based on Multi-Agent Simulation and its Application to Genetic algorithm for Classroom Optimization

引用

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2014年第2期18卷 113-120页

作者： Maekawa, Kotaro Sawase, Kazuhito Nobuhara, Hajime Univ Tsukuba Dept Intelligent Interact Technol 1-1-1 Tennodai Tsukuba Ibaraki 3050033 Japan

The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose consists of global and local multiagent planning. Conventional global planning requires setting subgoals manually, which became a bottleneck in optimization. To solve this problem, a multi-resolution dijkstra method for selected autonomously, assuming eight classrooms as a real University of Tsukuba building and 250 agents, we confirmed the effectiveness of the proposed multi-resolution dijkstra's algorithm as for both global and local route selections, compared to the uniform dijkstra's method.

关键词： genetic algorithm multi-agent dijkstra algorithm optimization problem university courses problem

来源：评论

学校读者我要写书评

暂无评论

Link Failure Emulation with dijkstra and Bellman-Ford algorithm in Software Defined Network Architecture (Case Study: Telkom University Topology) 6

Link Failure Emulation with Dijkstra and Bellman-Ford Algori...

引用

6th International Conference on Information and Communication Technology (ICoICT)

作者： Nastiti, Anggie Rakhmatsyah, Andrian Nugroho, Muhammad Arief Telkom Univ Sch Informat Engn Informat Engn Bandung Indonesia

ISBN: (纸本)9781538645727

In Telkom University, the topology used does not have backup link for campus internal network in case of link failure because the topology is still based on interVLAN where each switch only has one path to switch core. Data packets cannot be delivered from source to destination if there is a link failure on the path. Based on the problem, it is proposed a new architecture which is Software Defined Network (SDN) that can overcome the link failure by configuring the controller in order to move to alternative links that have been provided with OpenFlow. This architecture separates the control plane and data plane, so it is centralized and programmable. To look for alternative links when a link failure occurs, the shortest path algorithm is dijkstra and Bellman-Ford algorithms. The test parameters performed in this research are functionality to determine whether the two algorithms can determine the path or not, and convergence time to find out how long it takes to form the path from source to destination. Scenario of the test is done before and after the link failure occurs by using Ryu as controller and Mininet as emulator. Based on the results of the tests conducted, it was found that dijkstra and Bellman-Ford algorithm can be applied well on link failure emulation in accordance with the scenario and topology used in the test. In addition to convergence time parameters obtained that dijkstra algorithm is superior compared to Bellman-Ford algorithm. The difference gained in both scenarios has a value that is not so great the difference.

关键词： Software Defined Network dijkstra algorithm Bellman-Ford algorithm Link Failure

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Discrete Evidence Fusion Based on dijkstra Shortest Path algorithm 32

A Novel Method for Discrete Evidence Fusion Based on Dijkstr...

引用

32nd Chinese Control And Decision Conference (CCDC)

作者： Liu, Bo Yang, Yang Deng, Xinyang Sci & Technol Avion Integrat Lab Shanghai 200233 Peoples R China Northwestern Polytech Univ Sch Elect & Informat Xian 710072 Peoples R China

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.

关键词： Discrete evidence dijkstra algorithm Jousselme distance Dempster combination

来源：评论

学校读者我要写书评

暂无评论

Towards more granular choice set building in location choice models: A graph-structured meta-topology as an alternative to matrices in agent-based travel demand models 16

Towards more granular choice set building in location choice...

引用

16th International Conference on Ambient Systems, Networks and Technologies Networks, ANT 2025 / 8th International Conference on Emerging Data and Industry 4.0, EDI40 2025

作者： Schengen, Alain Institute of Transport Research German Aerospace Center Rudower Chaussee 7 Berlin 12489 Germany

Microscopic and agent-based travel demand models frequently rely on precomputed matrices describing travel times, distances, costs, or interchange counts between traffic analysis zones (TAZ). While these matrices simplify computational efforts, their reliance on spatial aggregation means that finer-grained, more behaviorally realistic insights are sacrificed. To achieve a more accurate microscopic view, one would need to divide large TAZs into smaller ones. However, this solution quickly becomes problematic, as it leads to a growth in matrix size, increasing both the memory footprint and the amount of precomputation necessary to maintain these matrices. To address these limitations, we present a method that employs a precomputed meta topology, a graph structure where each node can be annotated with additional information. As a case study, we implement a constrained dijkstra-based graph traversal algorithm on this meta topology to generate location choice sets for agent-based models. This approach significantly reduces memory requirements while introducing additional computational overhead, as it involves constructing multiple subgraphs. Although it enhances granularity and offers a more behaviorally nuanced perspective than matrix-based methods, certain trade-offs and performance considerations must be acknowledged. In the final section, we discuss how the meta topology can be further leveraged, as well as strategies for improving the efficiency and robustness of the proposed solution. © 2025 Elsevier B.V.. All rights reserved.

关键词： agent-based model dijkstra algorithm location choice modeling open data travel demand

来源：评论

学校读者我要写书评

暂无评论

Multicast routing in BMSNs through Greedy, Weighted Greedy and dijkstra algorithms: a comparative analysis

Multicast routing in BMSNs through Greedy, Weighted Greedy a...

引用

EUROPTO Symposium on Broadband European Networks (SYBEN 98)

作者： Borella, A Chiaraluce, F Univ Ancona Dipartimento Elettron & Automat I-60131 Ancona Italy

ISBN: (纸本)0819428604

The performances of some popular routing algorithms used for multicast communications are extensively simulated and analyzed in comparative terms, assuming the Bidirectional Manhattan Street Network as a valued test-bed. Multicast traffic is inserted over a substrate of point-to-point communications, contributing to increase the value of some cost parameters, suitably defined to express the routing efficiency. Both the cases of uncorrelated and bursty traffic are considered. The analysis confirms that the superiority of an algorithm over the others cannot be claimed since it depends on the input variables and on the criterion used for performance evaluation. Anyway conclusions can be drawn under specific assumptions, and they are usable in the framework of the network design.

关键词： routing multicasting Greedy algorithm dijkstra algorithm Manhattan street networks

来源：评论

学校读者我要写书评

暂无评论

Towards more granular choice set building in location choice models: A graph-structured meta-topology as an alternative to matrices in agent-based travel demand models

引用

Procedia Computer Science 2025年 257卷 1002-1007页

作者： Alain Schengen Institute of Transport Research German Aerospace Center Rudower Chaussee 7 12489 Berlin Germany

关键词： agent-based model travel demand open data dijkstra algorithm location choice modeling

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimization and Simulation of the Shortest Path Based on algorithm of dijkstra

引用

Journal of Measurement Science and Instrumentation 2010年第S1期1卷 199-201,37页

作者： Chuan-xiang REN,Xin-gang HAO,Ying-rui WANG, Guang-hui PAN (College of Information and Electrical Engineering,Shandong University of Science and Technology,Qingdao 266510,China) College of Information and Electrical Engineering Shandong University of Science and Technology

dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved dijkstra algorithm is *** apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

关键词： route optimization dijkstra algorithm fast sorting algorithm adjacency list and circular linked list

来源：评论

学校读者我要写书评

暂无评论

Optimal path planning in a real-world radioactive environment: A comparative study of A-star and dijkstra algorithms

引用

NUCLEAR ENGINEERING AND DESIGN 2024年 420卷

作者： Miyombo, Miyombo Ernest Liu, Yong-kuo Mulenga, Chishinga Milton Siamulonga, Anthony Kabanda, Martin Chihango Shaba, Phillimon Xi, Chunli Ayodeji, Abiodun Harbin Engn Univ Fundamental Sci Nucl Safety & Simulat Technol Lab Harbin 150001 Peoples R China Radiat Protect Author Explorat HousePOB 50002 Lusaka Zambia Natl Inst Sci & Ind Res PO BOX 310158 Int Airport Rd Lusaka Zambia Northeast Forestry Univ Transportat Coll Harbin 150040 Peoples R China Brunel Univ London Brunel Innovat Ctr Uxbridge UB8 3PH England

Navigating complex radioactive environments while minimizing radiation exposure to workers is a critical challenge faced by the nuclear industry. Although various shortest-path algorithms and radiation dose calculation techniques have been employed for optimal path finding, most existing models are based on simulations that do not accurately represent real-world environments. To address this limitation, this study presents a pathplanning experiment conducted on a naturally radioactive slag dump, Slag Dump No. 48, also known as Black Mountain, in Zambia. The experiment utilizes the Radiation Detection Backpack System (RDBS) and Geolocation Application for Radiation Monitoring (GARM) in conjunction with the dijkstra and A -star algorithms to search for an optimal walking path on the slag dump. The distances between neighboring nodes and heuristic values, derived from gamma dose rates, are experimentally obtained from the GARM software. This research contributes to the field by: (1) performing a real-world path planning experiment on a radioactive slag dump, (2) applying RDBS for measuring gamma radiation from a naturally radioactive slag, (3) investigating the combined use of RDBS, GARM, dijkstra, and A -star algorithms for optimal pathfinding, (4) generating heuristic values and node distances experimentally for path planning in an actual radioactive environment, and (5) comparing the performance of state-of-the-art minimum dose walking path algorithms on dose rate-based and node distance-based weighted graphs. The results of this study and the proposed future work provide valuable insights for enhancing radiation protection and optimizing path planning in radioactive environments.

关键词： Optimal path planning Radiation dose assessment Gamma radiation A-star algorithm dijkstra algorithm Nuclear decommissioning

来源：评论

学校读者我要写书评

暂无评论

Determination of patient-specific trajectory for biaxially rotational dynamic-radiation therapy using a new O-ring-shaped image guided radiotherapy system

引用

PHYSICS & IMAGING IN RADIATION ONCOLOGY 2025年 33卷 100698-100698页

作者： Hirashima, Hideaki Adachi, Hiroki Ono, Tomohiro Nakamura, Mitsuhiro Ono, Yuka Iwai, Takahiro Yoshimura, Michio Mizowaki, Takashi Kyoto Univ Grad Sch Med Dept Radiat Oncol & Image Appl Therapy 54 Kawahara choSakyo ku Kyoto 6068507 Japan Hitachi High Tech Corp X ray Therapy Div Healthcare Business Grp Therapy Syst Business Tokyo Japan Shiga Gen Hosp Dept Radiat Oncol Shiga Japan Kyoto Univ Grad Sch Med Dept Adv Med Phys 53 Kawahara choSakyo ku Kyoto 6068507 Japan

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.

关键词： Patient-specific trajectory search dijkstra algorithm Pancreatic cancer BROAT-RT

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Discrete Evidence Fusion Based on dijkstra Shortest Path algorithm

A Novel Method for Discrete Evidence Fusion Based on Dijkstr...

引用

第32届中国控制与决策会议

作者： Bo Liu Yang Yang Xinyang Deng Science and Technology on Avionics Integration Laboratory School of Electronics and Information Northwestern Polytechnical University

Discrete evidence generally exists in the fields of expert systems,pattern recognition,and decision *** to solve the fusion of discrete evidence is an open *** 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 ***,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 *** Jousselme distance is designed to measure the conflict between the *** the dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme *** path here indicates the discrete evidence group with the largest fusion distance and smallest fusion *** use Dempster combination to fuse the evidence after weighted average and give the interval value of ***,two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.

关键词： Discrete evidence dijkstra algorithm Jousselme distance Dempster combination

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：