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

Fair task allocation in transportation

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2017年 68卷 1-16页

作者： Ye, Qing Chuan Zhang, Yingqian Dekker, Rommert Erasmus Univ POB 1738 NL-3000 DR Rotterdam Netherlands Eindhoven Univ Technol POB 513 NL-5600 MB Eindhoven Netherlands

Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper we study a fair task allocation problem in transportation where an optimal allocation not only has low cost but more importantly, it distributes tasks as even as possible among heterogeneous participants who have different capacities and costs to execute tasks. To tackle this fair minimum cost allocation problem we analyze and solve it in two parts using two novel polynomial-time algorithms. We show that despite the new fairness criterion, the proposed algorithms can solve the fair minimum cost allocation problem optimally in polynomial-time. In addition, we conduct an extensive set of experiments to investigate the trade-off between cost minimization and fairness. Our experimental results demonstrate the benefit of factoring fairness into task allocation. Among the majority of test instances, fairness comes with a very small price in terms of cost. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Task allocation Fairness Cost minimization algorithm design

来源：评论

学校读者我要写书评

暂无评论

Line pool generation

引用

PUBLIC TRANSPORT 2017年第1-2期9卷 7-32页

作者： Gattermann, Philine Harbering, Jonas Schobel, Anita Univ Gottingen Lotzestr 16-18 D-37083 Gottingen Germany

Finding the lines and their frequencies in public transportation is the well-studied line planning problem. In this problem, it is common to assume that a line pool consisting of a set of potential lines is given. The goal is to choose a set of lines from the line pool that is convenient for the passengers and has low costs. The chosen lines then form the line plan to be established by the public transportation company. The line pool hence has a significant impact on the quality of the line plan. The more lines are in the line pool, the more flexible can we choose the resulting line plan and hence increase its quality. It hence would be preferable to allow all possible lines to choose from. However, the resulting instances of the line planning problem become intractable if all lines would be allowed. In this work, we study the effect of line pools for line planning models and propose an algorithm to generate 'good' line pools. To this end, we formally introduce the line pool generation problem and investigate its properties. The line pool generation problem asks for choosing a subset of paths (the line pool) of limited cardinality such that in a next step a good line concept can be constructed based on this subset. We show that this problem is NP-hard. We then discuss how reasonable line pools may be constructed. Our approach allows to construct line pools with different properties and even to engineer the properties of the pools to fit to the objective function of the line planning model to be used later on. Our numerical experiments on close-to real-world data show that the quality of a line plan significantly depends on the underlying line pool, and that it can be influenced by the parameters of our approach.

关键词： Line pool Line planning Public transport algorithm design

来源：评论

学校读者我要写书评

暂无评论

Offset Compensation for Time Synchronization in WSNs with Random Communication Delays

Offset Compensation for Time Synchronization in WSNs with Ra...

引用

Chinese Automation Congress

作者： Gan Chen Yu-Ping Tian Siheng Zong Shao-Heng Chun Bo Wang School of Automation Southeast University Nanjing China

Firstly, we show that in the unified structural model of the consensus-based time synchronization (CBTS) algorithm, the offset estimate is divergent in general while the drift estimate converges in a rate of 1/k, where k is the discrete time. Then, we propose an offset compensation approach to guaranteeing the boundedness of the offset estimate for wireless sensor networks (WSNs) with random bounded communication delays. Two numerical experiments are presented to illustrate the availability of this algorithm and the better synchronization performance.

关键词： Sensor network Time synchronization algorithm design Communication delay

来源：评论

学校读者我要写书评

暂无评论

Stability in Barter Exchange Markets 18

Stability in Barter Exchange Markets

引用

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems

作者： Sushmita Gupta Fahad Panolan Saket Saurabh Meirav Zehavi University of Bergen Bergen Norway The Institute of Mathematical Sciences HBNI Chennai India Ben-Gurion University of the Negev Beersheba Israel

The notion of stability is the foundation of several classic problems in economics and computer science that arise in a wide-variety of real-world situations, including Stable Marriage,Stable Roommate, Hospital Resident and Group Activity Selection. We study this notion in the context of barter exchange markets. The input of our problem of interest consists of a set of people offering goods/services, with each person subjectively assigning values to a subset of goods/services offered by other people. The goal is to find a stable transaction, a set of cycles that is stable in the following sense: there does not exist a cycle such that every person participating in that cycle prefers to his current "status." For example, consider a market where families are seeking vacation rentals and offering their own homes for the same. Each family wishes to acquire a vacation home in exchange of its own home without any monetary exchange. We study such a market by analyzing a stable transaction of houses involving cycles of fixed length. The underlying rationale is that an entire trade/exchange fails if any of the participating agents cancels the agreement; as a result, shorter (trading) cycles are desirable. We show that given a transaction, it can be verified whether or not it is stable in polynomial time, and that the problem of finding a stable transaction is NP-hard even if each person desires only a small number of other goods/services. Having established these results, we study the problem of finding a stable transaction in the framework of parameterized algorithms.

关键词： barter exchange fpt algorithm design stability

来源：评论

学校读者我要写书评

暂无评论

Smart Intersection Control algorithms for Automated Vehicles 10

Smart Intersection Control Algorithms for Automated Vehicles

引用

10th International Conference on Contemporary Computing (IC3)

作者： Pourmehrab, Mahmoud Elefteriadou, Lily Ranka, Sanjay Univ Florida Dept Civil & Coastal Engn Gainesville FL 32611 USA Univ Florida Dept Comp Informat Sci & Engn Gainesville FL 32611 USA

ISBN: (纸本)9781538630778

The pace at which autonomous vehicle technology is reaching consumers is accelerating. Furthermore, the future driverless cars are intended to be talkative with regard to exchanging information with other vehicles, infrastructure, or even cloud. More recent attention has focused on the provision of frameworks to take advantage of automated and connected vehicle technology. This study proposes a system design to allow safe and efficient traffic of both automated/connected and conventional vehicles approaching an isolated intersection. The benefit mainly comes from the ability of automated/connected vehicles to maintain shorter and more stable headways to the vehicle in ahead compared to conventional vehicles. Simulation experiments are conducted to gain insight into the influence of flow and automated vehicle ratio over the performance of intersection.

关键词： Vehicle-to-infrastructure Communication algorithm design Automated Vehicle Connected Vehicles

来源：评论

学校读者我要写书评

暂无评论

Gas outburst prediction based on the intelligent Dempster-Shafer evidence theory 9th

Gas outburst prediction based on the intelligent Dempster-Sh...

引用

9th International Conference on Modelling, Identification and Control (ICMIC)

作者： Gao, Caixia Wang, Fuzhong Xu, Dan Henan Polytech Univ Sch Elect Engn & Automat CO-454000 Jiaozuo Peoples R China

ISBN: (纸本)9781509065738

Predicting gas outburst in coalmine extraction face accurately is an effective method to prevent gas outburst disaster. Because there are the features of suddenness, unevenness, uncertainty and dynamic in gas outburst, the existing prevention method should be improved in accuracy and effectiveness. Thus in the paper the predicted model of gas outburst is built combining fuzzy neural network and Dempster-Shafer(D-S) evidence theory, and the model specifically introduces the overall structure design of gas outburst predicted model, the selection of gas outburst evaluation indicators, the design of fuzzy neural network unit and the design of D-S evidence theory unit. The eight key factors including the thickness of coal layer, the geological structure types of coal and the gas pressure of coal layer are selected as the evaluation indicators of gas outburst, and the preliminary judgment of gas outburst state in local point of mining working face, is made by fuzzy neural network, and then global judgment of gas outburst state in mining working face is made based on D-S evidence theory. The simulated result shows that this method can make accurate judgments of gas outburst state grade, and regarding with the judgments of the three kinds of gas outburst state, the accuracy error is less than 0.0048% and the uncertainty value approximates to 0.

关键词： gas outburst prediction fuzzy neural network Dempster-Shafer evidence theory algorithm design

来源：评论

学校读者我要写书评

暂无评论

Insulation Failures Flashover Rate Estimation for Metal Constructions in Overhead Transmission Lines 58

Insulation Failures Flashover Rate Estimation for Metal Cons...

引用

58th IEEE International Scientific Conference on Power and Electrical Engineering of Riga-Technical-University (RTUCON)

作者： Sliskis, Olegs Vitolina, Sandra Ketners, Karlis Zimackis, Viesturs Riga Tech Univ Dept Elect Machines & Devices Riga Latvia

ISBN: (纸本)9781538638460

In a stage of development of the project and during the exploitation of transmission line (TL), the specialists have to solve one of the most complicated problems insulation failures flashover rate (IFFR). The main indicator of the IFFR of TL is the minimization of the probability of outages, which is irreversible destructions of the isolating TL designs. When using valid normative documents, for an assessment of IFFR, it is necessary to use the data of the designs of a standard type with typical geometrical parameters of lines. For atypical constructions of TL towers, this method is not appropriate. The methodology of establishment of IFFR of TL metal construction offered in this research makes the procedure of designing metal constructions easier, including also atypical TL tower constructions due to the synthesis of computer modelling included in the methodology.

关键词： Lightning protection insulation failures metal constructions algorithm design computer simulation

来源：评论

学校读者我要写书评

暂无评论

Multiple Levels of Abstraction in algorithmic Problem Solving 17

Multiple Levels of Abstraction in Algorithmic Problem Solvin...

引用

ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Ginat, David Blau, Yoav Tel Aviv Univ CS Grp Sci Educ Dept Tel Aviv Israel Tel Aviv Univ Elect Engn Dept Tel Aviv Israel

ISBN: (纸本)9781450346986

The notion of abstraction repeatedly appears, in various ways, at all levels of computer science. It involves the aspects of leaving out details and comprehending concepts and mechanisms. It also involves the aspect of recognizing relationships between task elements. The latter aspect was not yet studied with respect to abstraction levels and algorithm design. We study it here. We analyze senior students' algorithmic solutions according to accepted interpretations of multiple abstraction levels, and offer guidelines for enhancing abstraction in students' algorithmics.

关键词： algorithm design Abstraction

来源：评论

学校读者我要写书评

暂无评论

On-line String Matching in Highly Similar DNA Sequences

引用

MATHEMATICS IN COMPUTER SCIENCE 2017年第2期11卷 113-126页

作者： Ben Nsira, Nadia Elloumi, Mourad Lecroq, Thierry Univ Tunis El Manar LaTICE Tunis Tunisia Normandie Univ Univ Rouen LITIS EA 4108 Normast FR3638IRIB Rouen France

We consider the problem of on-line exact string matching of a pattern in a set of highly similar sequences. This can be useful in cases where indexing the sequences is not feasible. We present a preliminary study by restricting the problem for a specific case where we adapt the classical Morris-Pratt and Knuth-Morris-Pratt algorithms to consider borders with errors. We give an original algorithm for computing borders at Hamming distance 1. We exhibit experimental results showing that our algorithms are much faster than searching for the pattern in each sequences with a very fast on-line exact string matching algorithm.

关键词： algorithm design algorithms on strings Pattern matching String matching String Border

来源：评论

学校读者我要写书评

暂无评论

A Train Positioning algorithm Based on Inflexion Analysis by Using Sets of Distance Measurement Data Collected from On-Board Laser Ranging Equipments 3

A Train Positioning Algorithm Based on Inflexion Analysis by...

引用

3rd IEEE International Conference on Computer and Communications (ICCC)

作者： Nai, Wei Chen, Yijun Zhang, Xiaoqing Lei, Xinxian Dong, Decun Tongji Zhejiang Coll Dept Elect & Informat Engn Jiaxing 314051 Peoples R China Tongji Univ Shanghai Cooperat Ctr Maglev & Rail Transit Shanghai 201804 Peoples R China Tongji Univ Minist Educ Key Lab Rd & Traff Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9781509063529

Train positioning system is the most important part in the operation and control system (OCS) in rail transit system of all kinds, for it can help the OCS system to get the real-time train positioning information and to realize fail-safe principle if any incident which may lead to hazard happens. Nowadays, different rail transit system have different ways in realizing train positioning, for the environment of each rail transit lines are different, and there is not a certain method which could be applied to all. Consider that each rail transit line has its own civil construction characteristics, and there is a distance measurement method with the accuracy up to millimeter level based on laser ranging, train positioning can be realized by setting up several sets of laser ranging equipments on-board, collecting ranging data between the train and different civil construction surfaces along the line, and counting the real-time train position out employing these sets of data collected and certain data matching algorithms. In this paper, a train positioning algorithm has been proposed based on inflexion analysis, such algorithm utilizes sets of distance measurement data collected from on-board laser ranging equipments. By setting up an experiment system for train positioning with the aid of laser ranging equipment, the effectiveness of proposed algorithm has been verified.

关键词： train positioning algorithm design laser ranging inflexion analysis data matching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：