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

4PL routing problem using hybrid beetle swarm optimization

SOFT COMPUTING 2023年第22期27卷 17011-17024页

作者： Lu, Fuqiang Chen, Weidong Feng, Wenjing Bi, Hualing Yanshan Univ Sch Econ & Management Qinhuangdao 066004 Peoples R China Northeastern Univ Fac Informat Sci & Engn Shenyang 810819 Peoples R China Northeastern Univ Qinhuangdao 066004 Peoples R China

From the view of comprehensive consideration, this considers the uncertainty of transportation time and cost due to seasonality and human factors, and a multi-objective chance constrained programming model with minimum transportation time and cost was established. Due to the complexity of the problem, traditional algorithms are not enough, and more efficient optimization algorithms are still needed. According to the characteristics of the problem, the beetle antennae search (BAS) with one beetle is changed into multiple beetles, and dijkstra algorithm is embedded, a hybrid beetle swarm optimization algorithm (HBSO) is designed to solve the problem, and the case analysis and algorithm analysis are made for three different examples;the datasets are referenced in literature (Lu et al. in Computer Integrated Manufacturing Systems 5:10-14, 2020). Under the three examples, the influence of the customer on the time and cost is different. The confidence level and weight of cost and time have great influence on the decision results. 4PL provider will not affect the choice of transportation route, but will change the choice of 3PL supplier and transportation mode. HBSO is an effective method to solve this problem. It is proved on efficiency, effectiveness and reliability in experiments by comparing with GA, PSO and BAS.

关键词： Fourth party logistics Routing problem Chance constrained programming Beetle swarm algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A recommender system for train routing: When concatenating two minimum length paths is not the minimum length path

引用

APPLIED MATHEMATICS AND COMPUTATION 2018年 319卷 486-498页

作者： Hernando, Antonio Roanes-Lozano, Eugenio Garcia-Alvarez, Alberto Univ Politecn Madrid Dept Sistemas Inteligentes Aplicados ETSI Sistemas Informat Madrid Spain Univ Complutense Madrid Inst Matemat Interdisciplinar Madrid Spain Univ Complutense Madrid Dept Algebra Madrid Spain Fdn Ferrocarriles Espanoles Madrid Spain

In this paper, we propose a method for finding the optimal route for a specific train from a station to another one in the Spanish railway network (or any railway network involving different incom patible features like gauges, electrification and signaling systems). The complexity of the Spanish railway infrastructure makes it difficult to give an estimation of the fastest route of a train from a given station to another. Indeed, very unintuitive situations may happen. The problem of finding fastest routes is typically modeled by a graph where nodes represent stations and edges represent railway sections. However, this approach is not suitable for the Spanish railway network. In order to solve the problem of calculating the fastest routes, we will propose here a novel approach based on modeling the railway network through a different graph whose nodes represent railway sections. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Railway routing optimization Graph theory dijkstra algorithm Railway network Track gauge Variable gauge train

来源：评论

学校读者我要写书评

暂无评论

A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route

引用

PROGRAMMING AND COMPUTER SOFTWARE 2024年第SUPPL2期50卷 S120-S127页

作者： Gershteyn, A. M. Terekhov, A. N. St Petersburg Univ St Petersburg 199034 Russia

A method of improving road traffic safety that implies constructing a route bypassing obstacles identified on a road map (graph) is considered on the example of Moscow, Russia. The obstacles are the edges of the road graph containing a statistically significant number of road traffic accidents (RTA). To check the routing efficiency, the indicator proposed by the authors earlier-the relative risk ratio-is used that equals the ratio of the number of RTA along the route with the obstacles taken into account to the number of RTA counted along the original route constructed without the obstacles taken into account. Avoiding obstacles is shown to help reduce the relative risk ratio by 9-31% (depending on the length of the original route) by increasing the average length of the route by 6-11% and increasing the average number of traversable vertices of the road graph by 6-28%.

关键词： transport routing relative risk ratio dijkstra algorithm transport statistical test Moscow

来源：评论

学校读者我要写书评

暂无评论

Identification of sub-grains and low angle boundaries beyond the angular resolution of EBSD maps

引用

MATERIALS CHARACTERIZATION 2014年 98卷 66-72页

作者： Germain, L. Kratsch, D. Salib, M. Gey, N. Univ Looraine CNRS Lab Etud Microstruct & Mecan Mat LEM3 UMR 7239 F-57045 Metz France Univ Lorraine Lab Excellence Design Alloy Met Low mAss Struct L F-57045 Metz France Univ Lorraine Lab Informat Theor & Appl EA3079 F-57045 Metz 1 France Univ Lorraine CNRS UMR 7198 Dept SI2M Inst Jean Lamour F-54011 Nancy France

A new method called ALGrId (Anti-Leak GRain IDentification) is proposed for the detection of sub-grains beyond the relative angular resolution of Electron Backscatter Diffraction maps. It does not use any additional information such as Kikuchi Pattern Quality map nor need data filtering. It uses a modified dijkstra algorithm which seeks the continuous set of boundaries having the highest average disorientation angle. (C) 2014 Elsevier Inc. All rights reserved.

关键词： EBSD Sub-grain low-angle boundaries ALGrId Grain Boundary Completion dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

3D spatial information for fire-fighting search and rescue route analysis within buildings

引用

FIRE SAFETY JOURNAL 2012年 48卷 21-29页

作者： Wu, Chia-Hao Chen, Liang-Chien Natl Cent Univ Ctr Space & Remote Sensing Res Jhongli 32001 Taoyuan County Taiwan Natl Cent Univ Dept Civil Engn Jhongli 32001 Taoyuan County Taiwan

This study is motivated by the need for a micro-geographic information system (GIS) to represent and analyze 3D spatial data for the plotting of fire-fighting search and rescue routes within buildings. The GIS uses a 3D geometric network model (GNM) and the dijkstra algorithm to consider smoke movement during different times of a building fire. Therefore, the route calculation algorithm can avoid routes through heavy smoke within buildings. In addition, when firefighters must search an area to find victims, the GNM and Ant Colony Optimization are applied to find the shortest path that passes through each room of the area. Finally, the GNM is implemented to perform a search and rescue route analysis from an actual underground station. The proposed method can not only provide the shortest safe route within a building but can also minimize the time required to search for potential victims. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Emergency response Geometric network model dijkstra algorithm Ant Colony Optimization

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Voltage Control Strategy in Distribution Networks Considering Customized Charging Navigation of Electric Vehicles

引用

IEEE TRANSACTIONS ON SMART GRID 2021年第6期12卷 4752-4764页

作者： Sun, Xianzhuo Qiu, Jing Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia

This paper proposes a three-layer hierarchical voltage control strategy for distribution networks considering the customized charging navigation of electric vehicles (EVs). In the first layer, optimal power flow (OPF) is performed to determine the day-ahead dispatch of on-load tap changer (OLTC) and capacitor banks (CBs). The optimization problem is formulated as a mixed-integer second-order cone programming (MISOCP) which can be effectively solved. In the second layer, a customized charging navigation strategy is proposed to conduct the charging behaviors of EVs based on their own preferences. The novel preference modes are designed for different types of EV users to include not only the charge and time cost, but also the willingness to participate in voltage regulation service (VRS). The navigation problem is formulated as a mixed-integer linear programming (MILP), which is then solved by CPLEX solvers embedded with dijkstra algorithm. In the third layer, charging stations measure local voltage and regulate the charging power of EVs to mitigate voltage violation. The charging selection and power allocation process are performed dynamically considering the mutual effect between the second and third layers. The economic compensation mechanism is also designed for both EV users and charging stations. The proposed approach is tested on the IEEE 33-bus distribution system coupled with a 24-bus transportation system, and simulation results verify the effectiveness both in charging navigation and mitigating voltage violation.

关键词： Voltage control Navigation Voltage measurement Real-time systems Optimization Process control Economics Hierarchical voltage control customized charging navigation preference modes electric vehicles dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Routing and time-slot assignment in optical TDM networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2004年第9期22卷 1648-1657页

作者： Chen, A Wong, AKS Lea, CT Hong Kong Univ Sci & Technol Dept Elect & Elect Engn Kowloon Hong Kong Peoples R China Appl Sci & Technol Res Inst Hong Kong Shatin Hong Kong Peoples R China

Optical time-division multiplexing (O-TDM) networks can provide a finer bandwidth granularity than wavelength-division multiplexing networks, and will play an important role in future all-optical networks. Since optical buffers are expensive, a small buffer size will be the characteristic of O-TDM systems. This paper analyzes the problem of routing and time-slot assignment in O-TDM networks. The results lead to the proposal of a dijkstra-like shortest-path routing scheme that intends to maximize the performance of an optical network with a small number of optical buffers. Performance evaluation of the proposed scheme is also presented.

关键词： buffer-efficient routing dijkstra algorithm optical time-division multiplexing (O-TDM) routing and time-slot assignment shortest-path routing

来源：评论

学校读者我要写书评

暂无评论

Research on tool axis vector optimization when face milling complex surfaces

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2023年第11-12期128卷 5081-5099页

作者： Zhao, Pengrui Liu, Zhifeng Li, Zhixiong Cao, Zirui Beijing Univ Technol Inst Adv Mfg & Intelligent Technol Beijing 100124 Peoples R China Beijing Univ Technol Beijing Key Lab Adv Mfg Technol Beijing 100124 Peoples R China Beijing Univ Technol Mech Ind Key Lab Heavy Machine Tool Digital Desig Beijing 100124 Peoples R China Jilin Univ Sch Mech & Aerosp Engn Minist Educ Key Lab CNC Equipment Reliabil Changchun 130015 Peoples R China

In 5-axis machining, the existing tool's axis vector optimization methods are limited since they only consider the global collision between the tool and the workpiece while aiming at the ball-nosed cutter. A multi-factor vector optimization method for the face milling cutter shaft is proposed to solve this problem. This method comprehensively considers machining global collision, cutting force, the angular displacement of a rotating shaft, and angular speed. An improved global collision detection method of cutter axis vector based on the NURBS surface principle is developed, and a global collision detection algorithm is employed to determine the cutter machining global collision. The relationship model between the end-milling cutter axis vector and cutting force variation is established to optimize the cutting force. In addition, an optimization model of angular displacement and velocity of the machine tool's rotating axis is proposed based on dijkstra optimal path algorithm. The CAM software simulation and experimental validation are conducted using a large propeller with a complex surface. The tool's axis vector optimization algorithm is applied to the propeller results. Comparing the tool's axis vector optimization results to those obtained without optimization, it is discovered that the surface workpiece's machining quality has significantly increased.

关键词： Tool axis vector optimization Cutting force modeling Spatial global collision detection algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Applying the locality principle to improve the shortest path algorithm

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2017年第1期20卷 301-309页

作者： Wang Xinghui Li Jianyi Li Xinrong Wang Huijuan North China Inst Aerosp Engn Sch Comp & Remote Sensing Informat Technol Langfang 065000 Hebei Peoples R China

When shortest path algorithm be used in real time road network monitoring system, the time complexity of the algorithm is becoming the bottleneck of the system. the paper proposes a solution to improve the shortest path algorithm. By making use of the k-ary-reverse tree and locality principle, this improved algorithm keeps the data operation, in priority queue, be localized in a small range. So the time complexity of this improved shortest path algorithm is optimized from O(nlog2n) to O(k x n);the parameter k denotes the average count of adjacency edges to each vertex, and n denotes the total count of vertexes in the network. Note that, the parameter k mainly depends on the edges density in the network. Generally speaking, the mean value of parameter k is not more than 4 in the road network, i.e. the time complexity of the improved algorithm is optimized from O( nlog2n) to O( n) in the road network. So the paper makes a conclusion that there is a linear correlation between the time complexity and the vertexes count n in the improved algorithm.

关键词： Road networks Shortest path Locality principle dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast optical layer mesh protection using pre-cross-connected trails

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2004年第3期12卷 539-548页

作者： Chow, TY Chudak, F Ffrench, AM Tellabs Res Ctr Cambridge MA 02139 USA

Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant bandwidth savings. Unfortunately, most shared mesh protection schemes cannot guarantee that failed traffic will be restored within the 50-ms timeframe that SONET standards specify. A notable exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however, that p-cycles have certain limitations, e.g., there is no easy way to adapt p-cycles to a path-based protection scheme, and p-cycles seem more suited to static traffic than to dynamic traffic. In this paper we show that the key to fast restoration times is not a ring-like topology per se, but rather the ability to pre-cross-connect protection paths. This leads to the concept of a pre-cross-connected trail or PXT, which is a structure that is more flexible than rings and that adapts readily to both path-based and link-based schemes and to both static and dynamic traffic. The PXT protection scheme achieves fast restoration speeds, and our simulations, which have been carefully chosen using ideas from experimental design theory, show that the bandwidth efficiency of the PXT protection scheme is comparable to that of conventional shared mesh protection schemes.

关键词： bandwidth sharing cage graph dijkstra algorithm experimental design mesh protection mesh restoration online algorithm p-cycle self-healing networks SONET survivable optical networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：