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

On bufferless routing of variable length messages in leveled networks

IEEE TRANSACTIONS ON COMPUTERS 1996年第6期45卷 714-729页

作者： Bhatt, SN Bilardi, G Pucci, G Ranade, A Rosenberg, AL Schwabe, EJ RUTGERS STATE UNIV DEPT COMP SCI PISCATAWAY NJ 08855 USA UNIV PADUA DIPARTIMENTO ELETTRON & INFORMAT I-35131 PADUA ITALY UNIV CALIF BERKELEY DIV COMP SCI BERKELEY CA 94720 USA UNIV MASSACHUSETTS DEPT COMP & INFORMAT SCI AMHERST MA 01003 USA NORTHWESTERN UNIV DEPT ELECT ENGN & COMP SCI EVANSTON IL 60208 USA

We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a virtual chatting schedule, and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies far producing efficient virtual chatting schedules on a variety of network topologies.

关键词： processor networks interprocessor communication message scheduling routing algorithms all-to-all communication high-level communication primitives

来源：评论

学校读者我要写书评

暂无评论

The variable neighborhood search for a consistent vehicle routing problem under the shift length constraints

引用

IFAC-PapersOnLine 2019年第13期52卷 2314-2319页

作者： Kulachenko, I.N. Kononova, P.A. Kochetov, Y.A. Kurochkin, A.A. Novosibirsk State University Novosibirsk Russia Sobolev Institute of Mathematics SB RAS Novosibirsk Russia

This paper addresses a new real-world application of vehicle routing planning in a finite time horizon. A company in the small package shipping industry has a limited fleet of identical vehicles in some depots and must serve a set of clients. There is a frequency for each client stating how often this client must be visited. Time intervals between two consecutive visits must be the same but the visiting schedule is flexible. To get some competitive advantage, a company tries to increase the service quality. To this end, each client should be visited by one driver only. The goal is to minimize the total traveling distance for all vehicles over the planning horizon under the frequency constraints and driver shift length constraints. We present an integer linear programming model for this new consistent vehicle routing problem. To find near optimal solutions, we design the Variable Neighborhood Search metaheuristic with nine neighborhood structures. The driver shift length constraints are penalized and included in the objective function. Empirical results for real test instances from Orenburg region in Russia with up to 900 clients and four weeks in the planning horizon are discussed. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Vehicle routing Competition Fleet operations Integer programming Mathematical models Operations research routing algorithms Vehicles Computer experiment Integer linear programming models Neighborhood structure Optimization problems Search method Time scheduling Variable neighborhood search Vehicle routing Problems

来源：评论

学校读者我要写书评

暂无评论

A Improved Subgradient Lagrangian Relaxation Algorithm for Solving the Stochastic Demand Inventory routing Problem

引用

Cyber-Physical Systems 2023年第2期9卷 174-192页

作者： Zhao, Yuan-Yuan Duan, Qian-qian Department of Electric and Electronic Engineering Shanghai University Of Engineering Science Shanghai China

In order to improve the coordination efficiency of vehicle routing problem, a multi-level stochastic demand in ventory routing problem was established in this paper, which minimizes the total cost of the system by determining the relation among inventory of distribution center, fleets, and customer needs. Solving the Lagrangian dual problem by the traditional subgradient Lagrangian relaxation algorithm may easily cause oscillation and then slow down the solving speed. To tackle the problem, an improved subgradient Lagrangian relaxation algorithm was proposed. Compared with the traditional subgradient algorithm, the proposed method is faster and improves the quality of the approximate solution. © 2021 Informa UK Limited, trading as Taylor & Francis Group.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Opta Scholar: An Efficient Software for the Bus routing and Scheduling Problem

引用

IFAC-PapersOnLine 2018年第9期51卷 422-427页

作者： Oesterle, Jonathan Chehade, Hicham Amodeo, Lionel Yalaoui, Farouk Prins, Christian Opta LP Rosières-près-Troyes France ICD UMR CNRS 6281 University of Technology of Troyes 12 rue Marie Curie CS42060 10004 Troyes Cedex France

While many children walk or cycle to and from school, buses and minibuses are major modes of travel for children. A typical journey of these pupils involves walking to and from the bus stop, waiting at bus stops, and boarding. The school bus routing problem, which consists of a set of students spread in a region who must be brought to and from their schools every school day, is considered in this paper. This paper describes the application of an efficient optimization software, Opta Scholar, to solve the school bus routing and scheduling problem. The application of this software showed major improvements in terms of the number of buses used and travelling costs. Furthermore, the embedded algorithm outperforms existing benchmark results on relaxed forms of the problem. © 2018

关键词： Buses Application programs Artificial intelligence Bus terminals Bus transportation Decision support systems Education routing algorithms Scheduling Bus routing Embedded algorithms Modes of travels Optimization problems Optimization software School bus routing School bus routing problems Transport

来源：评论

学校读者我要写书评

暂无评论

Weight Adjustments in a routing Algorithm for Wireless Sensor and Actuator Networks Using Q-Learning

引用

IFAC-PapersOnLine 2018年第10期51卷 58-63页

作者： Künzel, Gustavo Cainelli, Gustavo Pedroso Müller, Ivan Pereira, Carlos Eduardo Federal Institute of Education Science and Tecnology of Rio Grande do Sul FarroupilhaRS Brazil Federal University of Rio Grande do Sul Porto AlegreRS Brazil

Wireless Sensor and Actuator Networks like ISA SP100.11a and WirelessHART have a special device known as network manager, which has tasks such as admission control of devices, definition of routes and allocation of communication resources. The routing algorithms used in those protocols need to build routes that keep path redundancy, network reliability and balance energy consumption, resource use and latency. Some of the routing algorithms used for those protocols have weights that allow adjusting some route preferences. The dynamicity of wireless networks can be challenging for adjusting the routing algorithms, and Reinforcement Learning models can be useful to select and adapt weights and optimize routes according to application requirements and current operating conditions. In this work, a global routing agent with Q-Learning is proposed for weight adjustments of a state-of-the-art routing algorithm, aiming the balance of overall latency and lifetime of the network. States are modeled as a set of weights and actions change the current state. The rewards are positive when a state-action pair increases the expected network lifetime and decreases the average network latency. Experiments were conducted using a WirelessHART simulator, and the results showed that the approach can balance the latency and network lifetime when compared with other state-of-the-art routing algorithms with fixed weights. © 2016

关键词： Wireless sensor networks Actuators Energy utilization Learning algorithms Power management (telecommunication) Redundancy Reinforcement learning routing algorithms Actuator networks Q learning routing Wireless sensor WirelessHART

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient mobile routing algorithm in wireless sensor network

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第4期8卷 137-146页

作者： Zhigui, Lin Min, Li Yingping, Liu Ziyuan, Yang Huiqi, Zhang School of Electronics and Information Engineering Tianjin Polytechnic University Tianjin China School of Mechanical Engineering Tianjin Polytechnic University Tianjin China Laboratory of Marine Environment Observation and Monitoring Technology of Offshore National Ocean Technology Center Tianjin China

In order to extend the lifetime of wireless sensor network and avoid network premature invalidation caused by local emergency, this paper proposes an energy-efficient mobile routing algorithm (MREEMRP). The network based on the MREEMRP is divided into several square virtual grids to reduce energy consumption, and the cluster head is selected according to the residual energy of nodes and the weighted sum of coordinate distance between a node and the cluster barycenter. The sink node receives data from the cluster head by controllable moving scheduling strategy, and relay nodes with unlimited energy are introduces to extend the network lifetime, and serve as information transmitting large area. On this basis, the simulation is carried out and the results are compared with the MSEERP algorithm without relay nodes. The analysis shows that the proposed algorithm is superior to the MSEERP algorithm from the aspects of total energy consumption of the network, active nodes number and data amount that the gathering node receives. © 2015 SERSC.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

CONFLICT-FREE routing FOR BPC-PERMUTATIONS ON SYNCHRONOUS HYPERCUBES

引用

PARALLEL COMPUTING 1993年第3期19卷 323-342页

作者： LIU, ZY YOU, JH UNIV ALBERTA DEPT COMP SCIEDMONTON T6G 2H1ABCANADA

Bit-Permute-Complement permutations (BPC-permutations) are frequently used in various parallel computation tasks. Existing routing algorithms for BPC-permutations on hypercube suffer from two drawbacks: network conflict and the inability to use hypercube dimensions in a way independent of the given permutation. While the former requires not only buffer space in each node to store messages in the routing process but also extra time for message selection at each routing step, the latter makes it impossible to pass multiple independent permutations simultaneously without causing contention on links. This paper presents an efficient routing algorithm to realize BPC-permutations on hypercube systems. The proposed algorithm is totally conflict-free, and uses the n dimensions, in a hypercube of N = 2n processors, in a fixed order independent of the given permutation. The routing process is completely distributed and the time to forward a message in each routing step is only an exclusive-or gate's delay. While the algorithm can be easily implemented on existing synchronous hypercube systems, we present a new implementation scheme of hypercube, called syncube, on which n independent BPC-permutations can be realized simultaneously.

关键词： HYPERCUBE PERMUTATIONS routing algorithms COMMUNICATION BANDWIDTH LOCALIZED COMMUNICATION

来源：评论

学校读者我要写书评

暂无评论

The routing Algorithm Based on Fuzzy Logic Applied to the Individual Physiological Monitoring Wearable Wireless Sensor Network

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2015年第1期2015卷 1-7页

作者： Jiang, Jie Liu, Yun Song, Fuxing Du, Ronghao Huang, Mengsen Beijing Jiaotong Univ Dept Elect & Informat Engn Beijing 100044 Peoples R China

In recent years, the research of individual wearable physiological monitoring wireless sensor network is in the primary stage. The monitor of physiology and geographical position used in wearable wireless sensor network requires performances such as real time, reliability, and energy balance. According to these requirements, this paper introduces a design of individual wearable wireless sensor network monitoring system;what is more important, based on this background, this paper improves the classical Collection Tree Protocol and puts forward the improved routing protocol F-CTP based on the fuzzy logic routing algorithm. Simulation results illustrate that, with the F-CTP protocol, the sensor node can transmit data to the sink node in real time with higher reliability and the energy of the nodes consumes balance. The sensor node can make full use of network resources reasonably and prolong the network life.

关键词： routing algorithms FUZZY logic PATIENT monitoring WIRELESS sensor networks WIRELESS sensor nodes DATA transmission systems

来源：评论

学校读者我要写书评

暂无评论

routing algorithm based on swarm intelligence and hopfield neural network applied to communication networks

引用

ELECTRONICS LETTERS 2008年第16期44卷 995-997页

作者： Bastos-Filho, C. J. A. Schuler, W. H. Oliveira, A. L. I. Vitorino, L. N. Univ Fed Pernambuco Polytech Sch BR-50750410 Recife PE Brazil

A search method based on Particle Swarm Optimisation to search simutaneously the energy function coefficients and the parameters of the Hopfield Neural Network (HNN) algorithm is proposed. Experiments using three differents communication networks are presented. The results show that the proposed approach achieves better results than existing algorithms that employ the HNN for routing. Some results show that the algorithm tends to be quicker than Dijkstra for larger communication networks.

关键词： Hopfield neural nets particle swarm optimisation telecommunication computing telecommunication network routing Hopfield neural network communication networks routing algorithm swarm intelligence Search methods Hopfield neural networks telecommunication network routing Particle swarm optimization routing algorithms telecommunication computing networks(communications)

来源：评论

学校读者我要写书评

暂无评论

PCA-Guided routing Algorithm for Wireless Sensor Networks

引用

JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS 2012年第Pt.2期2012卷 427246.1-427246.10页

作者： Chen, Gong Tan, Liansheng Gong, Yanlin Zhang, Wei Cent China Normal Univ Dept Comp Sci Wuhan 430079 Hubei Peoples R China

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimal K-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

关键词： total energy Ganglia routing algorithms algorithms principal components analysis Wireless sensor networks Network energy consumption

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：