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

Aircraft routing and crew pairing: Updated algorithms at Air France

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2020年第0期93卷 102073-000页

作者： Parmentier, Axel Meunier, Frederic Univ Paris Est CERAMICS F-77455 Marne La Vallee France

Aircraft routing and crew pairing problems aim at building the sequences of flight legs operated respectively by airplanes and by crews of an airline. Given their impact on airlines operating costs, both have been extensively studied for decades. Our goal is to provide reliable and easy to maintain frameworks for both problems at Air France. We propose simple approaches to deal with Air France current setting. For routing, we introduce an exact compact IP formulation that can be solved to optimality by current MIP solvers in at most a few minutes even on Air France largest instances. Regarding crew pairing, we provide a methodology to model the column generation pricing subproblem within a new resource constrained shortest path framework recently introduced by the first author. This new framework, which can be used as a black-box, leverages on bounds to discard partial solutions and speed-up the resolution. The resulting approach enables to solve to optimality Air France largest instances. Recent literature has focused on integrating aircraft routing and crew pairing problems. As a side result, we are able to solve to near optimality large industrial instances of the integrated problem by combining the aforementioned algorithms within a simple cut generating method. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Airline management Column generation Cut generation shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Virtual pathway explorer (viPEr) and pathway enrichment analysis tool (PEANuT): creating and analyzing focus networks to identify cross-talk between molecules and pathways

引用

BMC GENOMICS 2015年第1期16卷 1-13页

作者： Garmhausen, Marius Hofmann, Falko Senderov, Viktor Thomas, Maria Kandel, Benjamin A. Habermann, Bianca Hermine CECAD Res Ctr D-50931 Cologne Germany Austrian Acacdemy Sci Gregor Mendel Inst Mol Plant Biol Vienna Bioctr VBC A-1030 Vienna Austria Dr Margarete Fischer Bosch Inst Clin Pharmacol D-70376 Stuttgart Germany Univ Tubingen D-70376 Stuttgart Germany Max Planck Inst Biochem Res Grp Computat Biol D-82152 Martinsried Germany

Background: Interpreting large-scale studies from microarrays or next-generation sequencing for further experimental testing remains one of the major challenges in quantitative biology. Combining expression with physical or genetic interaction data has already been successfully applied to enhance knowledge from all types of high-throughput studies. Yet, toolboxes for navigating and understanding even small gene or protein networks are poorly developed. Results: We introduce two Cytoscape plug-ins, which support the generation and interpretation of experiment-based interaction networks. The virtual pathway explorer viPEr creates so-called focus networks by joining a list of experimentally determined genes with the interactome of a specific organism. viPEr calculates all paths between two or more user-selected nodes, or explores the neighborhood of a single selected node. Numerical values from expression studies assigned to the nodes serve to score identified paths. The pathway enrichment analysis tool PEANuT annotates networks with pathway information from various sources and calculates enriched pathways between a focus and a background network. Using time series expression data of atorvastatin treated primary hepatocytes from six patients, we demonstrate the handling and applicability of viPEr and PEANuT. Based on our investigations using viPEr and PEANuT, we suggest a role of the FoxA1/A2/A3 transcriptional network in the cellular response to atorvastatin treatment. Moreover, we find an enrichment of metabolic and cancer pathways in the Fox transcriptional network and demonstrate a patient-specific reaction to the drug. Conclusions: The Cytoscape plug-in viPEr integrates -omics data with interactome data. It supports the interpretation and navigation of large-scale datasets by creating focus networks, facilitating mechanistic predictions from -omics studies. PEANuT provides an up-front method to identify underlying biological principles by calculating enriched path

关键词： Focus network Disease state shortest path algorithm Node neighborhood pathway enrichment

来源：评论

学校读者我要写书评

暂无评论

A Load-balanced Adaptive Routing and Wavelength Assignment algorithm Based on Cost Updating 16

A Load-balanced Adaptive Routing and Wavelength Assignment A...

引用

16th International Conference on Optical Communications and Networks (ICOCN)

作者： Zhang, Zhengxian Liu, Siming Zhang, Junyue Tian, Huiping Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781538632734

In this paper, an adaptive routing and wavelength assignment algorithm based on cost updating (CU-RWA) has been proposed to optimize route selection in optical networks. The classical shortest path algorithms, such as the Dijkstra algorithm, always cause high blocking probability and unbalanced load when making a routing decision. Consequently, the algorithm which is able to train the network and constantly update the link cost depending on the load status of link is designed to solve the problem in this paper. Simulation results obtained indicate that the proposed algorithm outperforms Dijkstra algorithm in load balancing and blocking probability.

关键词： Optical networks Routing and Wavelength Assignment Cost updating shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: Design and implementation of badminton robot perception and control system (Retracted article. See vol. 18, 2021)

引用

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2020年第2期17卷

作者： Liu, Liou Wang, Liping Xu, Zhenwen Guangdong Univ Finance & Econ Dept Phys Educ Guangzhou 510320 Peoples R China Nanjing Univ Aeronaut & Astronaut State Key Lab Mech & Control Mech Struct Nanjing Peoples R China Pingxiang Univ Sch Informat & Comp Engn Pingxiang Peoples R China Huashang Coll Guangdong Univ Finance & Econ Guangzhou Peoples R China

With the rapid development of computer technology, target tracking has become an indispensable technology in the field of image processing. Outline-based matching algorithms are one of the most representative methods in the field of computer vision. The idea is to extract several characteristic vectors from the image and compares them with the characteristic vectors in the corresponding image template. The difference between the image and the template characteristic vector is calculated, and the category is determined by the minimum distance method. The badminton robot collects the depth image of the scene through the depth camera and then uses the machine vision theory to process the acquired depth image. To combine the image depth information to obtain the position of the badminton camera coordinate system in the three-dimensional space, the position of the site coordinate system is achieved. Finally, the position information of the badminton in the multi-frame images is used to predict the falling point of the badminton. The badminton positioning and the analysis of the falling point are completed. The badminton robot quickly runs to the predicted position of the badminton and completes a hitting task. To realize the high-speed continuous and smooth badminton action of the badminton robot manipulator, a new multi-objective manipulator trajectory optimization model is proposed. The experimental results show that the new trajectory optimization model can effectively reduce the energy consumption of the motor and improve the rotational efficiency, thus ensuring the response speed of the arm.

关键词： Badminton robot trajectory planning shortest path algorithm cubic spline interpolation

来源：评论

学校读者我要写书评

暂无评论

Desktop-CAVE for First Person Shooter Games

Desktop-CAVE for First Person Shooter Games

引用

Brazilian Symposium on Games and Digital Entertainment

作者： Fernando Roman Anderson Maciel Luciana Nedel Instituto de Informatica (INF) Universidade Federal do Rio Grande do Sul (UFRGS)

ISBN: (纸本)9781612843919

Games are everywhere and, with the sharp improvement of graphics in the later years, a new challenge is to create better interfaces to amplify the sensorial experience of game players. In this context, the present work proposes a desktop based CAVE system using three video monitors with dynamic angles between them. Our hypothesis is that such a system provide an improvement in the players' peripheral vision for 3D first person shooter games. This would even benefit the player performance. In our implementation we used augmented reality and computer vision techniques to calibrate the monitors. Graphics libraries (ARToolkit e OpenGL) have been used to detect and calibrate monitors within the same 3D space and calculate the angles between them. The open source game AssaultCube has been modified to support three monitors and different camera angles. The game have shown to be entertaining and has been used as a use case for user tests. Tests have shown that the desktop CAVE system allows for performance improvement as the players make significatively less look- around movements with the mouse while keeping the average number of kills and deaths favorable in relation to a conventional one monitor setup.

关键词： Real-time Strategy Relief Mapping shortest path algorithm First Person Shooter

来源：评论

学校读者我要写书评

暂无评论

Power Supply Meshes based Line Routing for Urban MV Distribution Network Planning

Power Supply Meshes based Line Routing for Urban MV Distribu...

引用

作者： Ning Luo Hua Gao Zhuding Wang Molin He Power grid planning research centre of Guizhou Power Grid Co. Ltd State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing University

Considering that it is difficult to determine the load points or the locations of user access facilities in urban areas for the planning years, an optimization method for the routing planning of urban medium-voltage(MV) trunk lines is proposed based on power supply meshes. Firstly, based on the results of load forecasting and high voltage substation planning, power supply meshes are generated in the entire planning area according to the principle of selecting standby substations close to loads. Then, based on the thinking line of "trunk firstly, branch then", a shortest path based two-step algorithm is proposed to find the shortest trunk lines for the load centres of power supply meshes and the shortest trunk tie-line be-tween the load centres of each mesh. A numerical example shows that the method is practical and feasible, which can provide a reference for the reasonable routing scheme of medium voltage trunk lines.

关键词： MV line routing planning power supply mesh shortest path algorithm two-step algorithm trunk line

来源：评论

学校读者我要写书评

暂无评论

An ImprovedDijkstra algorithm Based on Pairing Heap

An ImprovedDijkstra Algorithm Based on Pairing Heap

引用

2012 Fifth International Symposium on Computational Intelligence and Design [第五届计算智能与设计国际会议 ISCID 2012]

作者： Wei Zhang Chong Jiang Yunxiang Ma Beijing Institute of Petrochemical Technology College of information Engineering Beijing China 102617

In this paper, we presented a method for shortest path computation process using Dijkstra algorithm based on Pairing heap. We compared the methods by the Pairing heap method and Fibonacci heap method. With experim... 详细信息

关键词： shortest path algorithm Dykstra algorithm GIS Network Analysis

来源：评论

学校读者我要写书评

暂无评论

OPERATIONAL RATE-DISTORTION SHAPE CODING WITH DUAL ERROR REGULARIZATION

OPERATIONAL RATE-DISTORTION SHAPE CODING WITH DUAL ERROR REG...

引用

IEEE International Conference on Image Processing

作者： Zhongyuan Lai Fan Zhang Weisi Lin Institute for Interdisciplinary Research Jianghan University Image and Visual Computing Lab Lenovo Group Ltd. School of Computer Engineering Nanyang Technological University

ISBN: (纸本)9781479957521

Existing operational rate-distortion shape coding aims at finding a polygon which can be encoded with the lowest bit rate under a given upper bound on the edge error. However, this upper bound may cause noticeable errors. Therefore, we add an l_2-norm error regularization term to the objective function, and seek the globally optimal solution using a shortest path algorithm for a weighted directed acyclic graph. Experiments confirm the accuracy and robustness of our method.

关键词： Shape coding Operational rate-distortion theory Dual error regularization shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of An Optimized Constellation Inter-Satellite Links Computation Model

Analysis and Design of An Optimized Constellation Inter-Sate...

引用

2014中国制导、导航与控制学术会议

作者： Zhaoqiang Yang Rong Ji Zhongpei Lu Ying Shen Shuai Shao State Key Laboratory of Astronautic Dynamics Xi''an710043China Xi''an Satellite Control CenterXi''an710043 China

ISBN: (纸本)9781479946983

The visibility model for establishing inter-satellite links is presented by analyzing the conditions of the shadow of the Earth,inter-satellite antenna visibility and restriction of distance *** into account of the inter-satellite relationship and the connectivity criterion in the constellation,the judgment model for establishing constellation inter-satellite links is *** of static link and dynamic link are designed according to the process of establishing inter-satellite links for *** on the shortest path algorithm and K-short path algorithm,a novel optimized algorithm model is ***,the simulation results show the stability and efficiency of the optimized algorithm model.

关键词： Earth distance measurement optimisation satellite antennas satellite links K-short path algorithm computation model constellation inter-satellite links distance measurement restriction dynamic link model inter-satellite antenna visibility optimized algorithm model shortest path algorithm static link model visibility model Analytical models Computational modeling Delays Orbits Satellites Stability analysis Computational modeling topsoil Earth Satellite links shortest path algorithms satellite antennas inter-satellite distance measurement ANALYSIS MODELS satellites Eye Sockets Orbits CONSTELLATIONS Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Research on the non-strict uncapacitated multiple allocation p-hub median problem based on tuba search

Research on the non-strict uncapacitated multiple allocation...

引用

2009中国控制与决策会议

作者： BAI Ming-guo School of Management,Anhui University of Technology,Ma'anshan 243002,China

The problem of locating hub facilities arises in the design of transportation and telecommunications *** this paper we consider the non-strict uncapacitated multiple allocation p-hub median problem which belongs to a class of discrete location-allocation problems.A mixed integer linear programming model of the non-strict uncapacitated multiple allocation p-hub median problem is proposed and a new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the non-strict uncapacitated multiple allocation p-hub median *** algorithm is benchmarked on a Chinese *** results demonstrate that the algorithm can find the best solution of all the problems within 0.14 seconds,so the heuristic algorithm has strong ability and quick efficiency in finding Optimal Solutions.

关键词： Hub Non-hub shortest path algorithm Tabu search Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：