Routing Tasks Research Articles

A Column Generation-Based Gossip Algorithm for Home Healthcare Routing and Scheduling Problems

Home healthcare (HHC) is a service that dispatches caregivers to people in need of healthcare who live in the home. The task assignment and route generation for caregivers can be formulated as an extension of the well-known vehicle routing problem with time windows (VRPTW). Currently, the most successful exact algorithms for VRPTW are based on a framework combining column generation (CG) and branching. Although such methods could be successful for HHC routing and scheduling problem (HHCRSP) as well, fast approximate algorithms are appealing, especially for large problems. In an early version of this paper, we employed a heuristic distributed gossip algorithm to solve HHCRSP. In this paper, we integrate the gossip algorithm with a local solver based on CG, which makes it an effective algorithm for larger problem instances. As it will be shown with extensive numerical experiments, for large problem instances, gossip-CG performs better than the pure CG. Note to Practitioners —The task of routing and scheduling caregivers for HHC providers can be formulated as a mathematical problem that is theoretically challenging to solve to optimality for large-scale problems involving many clients and caregivers. Although extensive research and tools for tackling this problem already exist, in practice, even in developed countries, it is still common to rely on schedules generated manually by staff. What we present in this paper is the summary of our theoretical work on tackling such problems. The benefit of the framework that we propose, the CG-based gossip method, is that it can be preempted at any time if the staff requires to obtain a good schedule as soon as possible. If ample time is available, one can let our algorithm to run for a longer period of time to generate even shorter routes.

A METHOD OF FORMING OF ANTI-VIRUS PROTECTION OF DATA IS WITH THE USE OF SAFE ROUTING OF METADATAS

In this article the method of anti-virus protection of data is worked out in TCS due to the safe routing of metadatas in anti-virus nephystems. He is intended for the decision of range of problems, that consists in that with the aim of increase of efficiency of the use of facilities of anti-virus protection of data and minimization of consequences of similar cyberbuck of crimes, a timely exposure and localization of computer viruses are an extremely important and at the same time difficult task. By the basic constituents of method, that is offered in this work, is, : algorithms of forming of great number of TPS of metadatas, method of control of flow of ТCS, model of the system of neural network experts of the safe routing lines. The distinguishing feature of algorithms of forming of great number of TPS of metadatas are indexes of optimization and limitations that is entered, for the safe routing. The novelty of method of control of flow of ТCS lines consists in the account of the compromised bats of these special signatures that is passed in anti-virus nephystems. It will allow to bring down probability of manipulations metadatas that is passed in the knots of programmatic server. The feature of the worked out system of neural network experts is a complexity of the use of neural networks as АRТ and multi-layered to perceptron for the decision of task of the safe routing that will allow to promote exactness of acceptance of correct decision about an unauthorized division to the fiber-optic lines

Certain Investigation on MANET Security with Routing and Blackhole Attacks Detection

Abstract Mobile Ad-hoc Network (MANET) is a self-configuring network depending upon infrastructure, also is a significant technology which supplies virtual hardware and software resources as per requirement of mobile ad hoc network. The Intrusion Detection System (IDS) has been established to protect Cross Interior (routing) at source to goal from different types of attack. Current IDS approaches can be classified as either anomaly or signature-based methods such as Rule-based expert systems, State transition analysis, Bayesian alarm networks aspects are various challenges with respect to the efficiency as well as performance. The major challenge is the compromise of performance because of unavailable resources with respect to the MANET. To increase the MANET environment’s performance, various techniques are employed for routing, security purpose. An efficient security module requires a routing in terms of packet loss. The Integrated Cross Interior (ICI) structure for Intrusion Detection System (IDS) namely ICIs for IDS are proposed for exactness of black hole attacks detection. The ICIs for IDS performs the task of routing of the mobile nodes. The proposed (ICIs for IDS) produces the enhancement of Intrusion Detection System (IDS) with routing algorithm named as Integrated Cross Interior algorithm that performs maps the security with the secure IDS communication and distributes the packets among different destination, based on priority. This paper proposes a novel Integrated Cross Interior structure for Intrusion Detection System (ICIS for IDS) to secure our network from black hole attacks. This algorithm is proposed for node routing and node security by considering maximum throughput 83.5% with minimum routing cost, response time with 6.3ms. The experimental results specify that ICIs for IDS based security policy effectively minimizes the response time as well as the mobile routing cost, response time of an application with respect to other existing approaches such as IDS with AODV. The proposed algorithm is experimented using Network Simulator-2 and the results demonstrated that the performance of the algorithm is better than other conventional algorithms like IDS with AODV.

Formulation of multicriteria problem of routing and scheduling of manned and unmanned aircraft in a dynamic environment and approach to its solution using genetic algorithms

The article deals with the multi-criteria task of routing and scheduling of unmanned and manned aircraft using the method of penalty functions. The authors describe the urgency of the problem being solved for the airline management under the conditions of the existing changes in the dynamic situation with a great variety of flight situations. A mathematical statement of the problem is formulated and a universal optimality criterion is proposed in the form of a sum of additive and multiplicative forms, including partial quality indicators. The search for optimal and rational solutions to the problem of optimal flight routing, taking into account the airline fleet resources, airspace users' offers, constant and variable restrictions, associated, for example, with unfavorable weather conditions, can be implemented using a one-criteria and multi-criteria approach, but as a result, it is proposed to use a genetic algorithm that has low computational complexity and offers as solutions ("ancestors"), close to the optimal and rational result. With this approach, an "elite" is formed at the beginning of the algorithm, which allows the crossing operation to be performed at each step of the iteration (evolution). As a result, we get new "descendants", and by rearranging at least one item from one block to the next one, we can get a sufficiently large number of representatives, from which a new "elite" can be selected with the help of the criterion. The practice of using genetic algorithms has shown that along with the achievement of a global extremum with it, the process of substantial improvement of planning results is achieved in several evolution steps, and their number is clearly less than the number of steps when using numerical methods of parametric optimization. The proposed approach will significantly improve the efficiency and quality of flight planning for the airline, taking into account the diversity of aircraft fleet, payload and environmental impact. This task is especially important under the conditions of joint management (CDM), where aeronautical data can be considered as additional criteria.

Reliable and energy-efficient multi-hop LEACH-based clustering protocol for wireless sensor networks

Wireless sensor networks (WSNs) are attracting research attention because of their important applications in critical environmental monitoring and target tracking in both civilian and military fields. The large-scale deployment of energy-constrained WSNs and the need for multi-hop data aggregation requires efficient organization of network topology to simplify the routing task, balance the load, and prolong the network lifetime. Clustering has proven to be an effective approach for organizing the network into a connected hierarchy. In this study, we analyze the effectiveness of low-energy adaptive clustering hierarchy (LEACH) and LEACH-based protocols in extending the lifetime for energy-constrained WSNs. An improved LEACH clustering protocol called enhanced multi-hop LEACH is proposed to reduce and balance energy consumption in order to allow increased packet delivery and network lifetime in WSNs. Additionally, this paper presents the weaknesses of the LEACH protocol. First, we introduce new rules for cluster-head selection and round time computing based on the remaining energy. Second, a multi-hop communication model is integrated in the WSN using two operating processes: leveling and generic multi-hop routing.

DECOMPOSITION OF THE ROUTING PROBLEM BASED ON THE CLARKE-WRIGHT HEURISTIC METHOD

For the English abstract and full text of the article please see the attached PDF-File (English version follows Russian version).ABSTRACT The article is devoted to decomposition of the task of transport routing based on heuristic estimates with the Clarke-Wright method. A procedure is proposed for designing an automobile transport system based on the criterion of minimizing the total mileage by various formalized decomposition methods, in particular, using the «benefit functions» algorithm and formation of zones (clusters, subsets) of vehicle maintenance. The advantages of the proposed method are clearly shown in comparison with the method of «the shortest distance matrix», at the example of delivery of ten cargo units from a supplier to ten consumers. The effect of reducing the total mileage on the designed routes was 9,45 %. Keywords: transport routing, Clarke-Wright method, «benefit function», cluster, decomposition method, heuristic estimation, the shortest distances matrix

Flexible Droplet Routing in Active Matrix–Based Digital Microfluidic Biochips

The active matrix (AM)-based architecture offers many advantages over conventional digital electrowetting-on-dielectric (EWOD) microfluidic biochips, such as the capability of handling variable-size droplets, more flexible droplet movement, and precise control over droplet navigation. However, a major challenge in choosing the routing paths is to decide when the droplets are to be reshaped depending on the congestion of the intended path, or split- and route sub droplets,and merging them at their respective destinations. As the number of microelectrodes in AM-EWOD chips is large, the path selection problem becomes further complicated. In this article, we propose a negotiation-guided flow based on routing of subdroplets that obviates the explicit need for deciding when the droplets are to be manipulated, yet fully utilizing the power of droplet reshaping, splitting, and merging them to facilitate their journey. The proposed algorithm reduces routing cost and provides more freedom in deadlock avoidance in the presence of multiple routing tasks by assigning certain congestion penalty for sibling subdroplets and fluidic penalty for heterogeneous droplets. Compared to existing techniques, it reduces latest arrival time by an average of 29% for several benchmark and random test suites. Furthermore, our method is observed to provide 100% routability of nets for all test cases, whereas existing and baseline routers fail to produce feasible solutions in many instances. We also propose a reliable mode droplet routing strategy where the number of unreliable splitting operations can be reduced by paying a small penalty on latest arrival time.

Ergonomics investigation for orientation of the handles of wood routers

Objectives. Improperly designed hand tools not only expose workers to potential health risks but also hamper their productivity. This study tries to improve the ergonomics of wood routing tasks, suggesting better handle orientations for hand-held wood routers. Methods. Seven different handle combinations were tested over two routing tasks (beading and dado) with regard to perceived discomfort, electromyography (EMG) of biceps brachii and extensor carpi radialis brevis and hand–arm vibrations (HAV). Results. Handles with 30° and 60° inclinations were found more comfortable than previous 90° handle inclinations for routing tasks. Perceived discomfort in the dado task was found to be significantly higher than in the beading task (p < 0.001); EMG activity also supported this observation. However, EMG data showed no significant difference for the different handles used in the study. No worthwhile reduction was obtained in HAV levels for the modified wooden handles compared to initial plastic handles. Relevance to industry. The ergonomic intervention in wood routers described in this article will contribute to the existing knowledge of ergonomics of handle design and will aid the designers/engineers to design such tool handles that may reduce the risk of work-related musculoskeletal disorders/hand–arm vibration syndrome in workers using wood routers.

Варианты задач китайского почтальона и их решения через преобразование в задачи маршрутизации

In this article, the routing problems are described. It is shown, that almost all routing problem can be transformed into each other. An example of the Mixed Chinese Postman problem is discussed. The article gives an overview of various variants of Chinese Postman Problem. For all problems the mathematical formulation is given. Moreover, the useful real-life application is presented, too. Then, the article provides a table of possible Chinese Postman problems and identifies parameters that can be varied for obtaining new problems. Five parameters have been identified, such as: presence of set of edges; presence of set of arcs; presence of edges with cost, depending on traversing; the presence of set of required edges; the presence of set of required arcs. It was shown that by varying these parameters one can obtain tasks that were not described earlier but can be used in real life. Four new tasks were identified. Then it is shown that the Chinese Postman problem can be solved as another routing tasks through graph transformations. The method for transforming Chinese Postman problem into the Generalized Travelling Salesman problem is given. Then the results of solving the above problem are presented by simple algorithms, and their effectiveness is shown. The research is not over yet. The testing of other algorithms is planned.

Numerical route reservation method in the geoinformatic task of autonomous vehicle routing

Autonomous vehicle development is one of many trends that will affect future transport demands and planning needs. Autonomous vehicles management as a part of an intelligent transportation system could significantly reduce traffic jams and decrease the overall travel time. In this work, we investigate a route reservation architecture to manage road traffic within an urban area. The routing architecture decomposes road segments into time and spatial slots for every vehicle, it makes the reservation of appropriate slots on the road segments in the selected route. This approach allows one to predict the traffic in the road network and find the shortest path more precisely. We propose that a rerouting procedure should be utilized to improve the quality of the routing approach. We consider several speed-density relations to estimate the vehicle speed based on a road segment reservation state. The experimental study of the routing architecture is conducted using microscopic traffic simulation in SUMO package.

Comprehensive approach for optimization traffic routing and using network resources in a virtual data center

Today, telecommunication networks are the basis for deploying different types of cloud applications and services in data centers. The growing use of the cloud computing concept to provide access to applications and services every year increases the amount of converged network traffic. Existing approaches for traffic routing which using in the software defined-network don’t provide enough flexible solutions, able to adapt to changes in traffic flows in real time. At peak load, this leads to an overabundance of traffic to specific physical network nodes which are not prepared to handle a large data flow. One of the approaches that make it possible to solve this problem is the organization of adaptive traffic routing. In this paper are describes the developed approaches for effective control of traffic flow in the virtual data center. Our approaches are using the methods of the data mining and machine learning to more accurately classify and identify traffic flows of cloud applications and network services. This information helps for optimization traffic routes in real time. Another element of the proposed complex solution is solving the task of identifying routes in the virtual network of a data center. Within the framework of the research, the problem of route identification has been decomposed into two consecutive subproblems. The first part is aimed at the classification of communication channels in a virtual data center for a number of features that are characteristic of all superimposed networks. At the second part, based on the received data, the routes are clustered in accordance with the QoS requirements imposed by the current traffic flows. The received data are combined with information about the current flows of the circulating network and are fed to the input of the neural network to decide on the choice of a suitable route. Thus, the solution of the task of adaptive routing allows determining the priorities when creating the bandwidth of traffic flows, as well as establishing rules for managing the network of the data center.

The Development of E-Bike Navigation Technology Based on an OpenStreetMap

Currently, most E-Bike services rely on networks to complete the real time and turn-by-turn navigation. However, some users or situations without network may experience trouble in relation to navigation. Hence, our aim is to develop a low cost navigation system with offline and turn-by-turn navigation services. OpenStreetMap (OSM) is a collaborative project whose goal is to create a free editable map of the world. This means that the combined maps need to be more detailed than Google Maps. While Google Map is free to download and use, its offline functionality is restricted. Users cannot perform any searching or routing tasks without an internet connection, which means that when they are abroad or in low signal areas they either have to pay expensive roaming costs or spend a significant amount of time without map coverage, limiting its usability while traveling. For many developers, OSM has become a clear alternative to Google Maps. We used OSM-based Skobbler software to develop our navigation system. Google Maps Place APIs were also included in the system to help users search for nearby well-known places or stores.

SSAAR: Enhanced Spatial Reusability for Optimal Path Selection in Wireless Sensor Networks

The advancements made in the wireless sensor networks have enabled the research communities to delve into the study of spatial reusability concepts. Due to the restricted capacity in wireless links, it is a significant to select the optimal route for packet transmission. The achievement of optimal route selection is verified by the high end-to-end throughput rate. Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networks or cellular networks. In this paper, we have proposed an improved spatial reusability process using Single Path and Anypath Routing Protocols (SSAAR). The task of single path routing is to minimize the cost of the nodes in wireless links, whereas the task of any path routing is to assists the intermediate node who overhears the packet to participate in packet forwarding. Experimental results have shown the efficacy of our proposed work in terms of cost minimization functionalities. Keywords: Cost Minimization, Packet Forwarding, Single Path and Anypath Routing Protocols, Wireless Sensor Networks, Wireless Links

Geographic routing and hole bypass using long range sinks for wireless sensor networks

Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks by bringing additional advantages such scalability, dynamism, and high delivery rates. However, in the presence of a hole (or voids), greedy forward techniques tend to fail. Thus, a hole bypass solution needs to be used in order to route packets to a node where greedy forwarding process can be resumed. In this work, we propose a new geographic routing algorithm called REACT that can bypass routing holes and create routing paths toward the sink node. Our solution takes advantage of the higher communication range of the sink node and the Received Signal Strength Indicator (RSSI) to enable the construction of routing paths by self-electing the next hop at each step while also performing data aggregation. No extra packets are required to configure the routing task. Our results clearly show an efficient data delivery achieved by the proposed algorithm in scenarios with routing holes with all the benefits of a greedy forwarding technique.

Researching the Impact of Parameters of the Developed Routing Models on Network Performance

Nowadays, it is hard to imagine work without applying the principle of computer networks, and every day the requirement for high-quality network maintenance is increasing. In order to have a high-quality network; always optimize QoS through the optimization of routing protocols is required. In this paper, the scientific task of optimizing routing processes in hybrid telecommunication networks with guaranteed quality of service is solved by developing models and methods of adaptive routing. To develop methods, a system of Telecommunications network (TN) mathematical models was constructed at the levels of its morphological and functional descriptions. We used a weighted oriented graph as a structural model. Formalization of the main indicators of the network operation efficiency is carried out, which are the network performance (or its derivatives – relative and normalized performances) and indicators of the degree of use of network resources – buffer memory capacities of nodes and bandwidth of the transmission paths. In this paper, an experimental study of the developed models and routing methods was carried out in order to verify their adequacy, evaluate the effectiveness, and develop practical recommendations. The scheme of experiment, focusing on the investigation of processes occurring in the network while solving routing tasks (data gathering, RT processing, distribution, and implementation), is proposed.

The home health care problem with working regulations

Due to the geographically dispersed locations of their clients, home health care providers have to perform a complex routing and scheduling task. Besides the well-researched routing problem, the adherence to legal and organizational working regulations is a basis for application in practice. These requirements are already widely incorporated in the nurse rostering problem for stationary institutions, but also have to be considered while generating routes for home care providers. We introduce new and adapted working regulations to the home health care problem. The mixed-integer formulation is adaptable to the requirements of different providers. Our numerical results show that an exact solution approach is noncompetitive with respect to computing time in most cases. We therefore propose a heuristic approach based on an adaptive large neighborhood search to cope with the complexity of the problem. The numerical results are computed on generated but realistic instances as well as on data sets provided in previous publications. The results show that the heuristic achieves good results in comparison to the mixed-integer program in only a portion of the computation time. Additional to a numerical analysis, we investigate the influence of the working regulations on the solutions which indicates the importance of modeling working regulations. If the regulations are neglected, a high number of violations are caused.

Design and implementation of BGP novel control mechanism (BGP-NCM) based on network performance parameters

Abstract Border Gateway Protocol (BGP) is the defecto standard routing protocol of the internet and has served as backbone technology for logical routing tasks to provide global connectivity in the world. Unfortunately, there are limitations on network performance factors such as latency or link utilization which are not used in BGP routing decisions. These limitations have a great effect on internet services, especially bandwidth sensitive application, where BGP does not automatically redistribute the traffic over different Multihomed links based on link utilization or latency. In this paper, a novel control mechanism for BGP (BGP-NCM) is proposed. BGP-NCM is a software controller which has been developed and injected in the Enterprise or internet service provider BGP multihomed network to force the traffic redistribution over the available links based on the link utilization or latency. The BGP-NCM has been developed using Python programming language and it consists of three modules which are Monitoring, Traffic Calculation and Configuration modules. BGP-NCM will keep an eye on link utilization by checking the monitoring tool log and when the link utilization reaches a predefined value, the BGP-NCM traffic calculation module will be triggered to determine the amount of traffic and corresponding IP prefix as well as the target link with available bandwidth to accommodate the redistributed traffic. Our results show that BGP-NCM solves the traffic redistribution problem without any change in both BGP protocol and running internet infrastructure.

Bee‐Inspired Algorithms Applied to Vehicle Routing Problems: A Survey and a Proposal

Vehicle routing problems constitute a class of combinatorial optimization tasks that search for optimal routes (e.g., minimal cost routes) for one or more vehicles to attend a set of nodes (e.g., cities or customers). Finding the optimal solution to vehicle routing tasks is an NP‐hard problem, meaning that the size of problems that can be solved by exhaustive search is limited. From a practical perspective, this class of problems has a wide and important set of applications, from the distribution of goods to the integrated chip design. Rooted on the use of collective intelligence, swarm‐inspired algorithms, more specifically bee‐inspired approaches, have been used with good performance to solve such problems. In this context, the present paper provides a broad review on the use of bee‐inspired methods for solving vehicle routing problems, introduces a new approach to solve one of the main tasks in this area (the travelling salesman problem), and describes open problems in the field.

ARCHITECTURE AND FORWARDING MECH-ANISM FOR GEO-FENCING APPLICATIONS WITH MULTIPLE INFORMATION PROVIDERS

Geo-fencing application is a class of location-based service that provide mobile users with services, i.e. information or functionality, when the users are within certain geographical areas. In this paper, we present an architecture for geo-fencing applications that allow information provisioning from multiple providers based on users’ locations. The architecture includes a central component called service router whose main task is to forward information requests from the users’ mobile applications to targeted information providers. The architecture assumes that information is stored in specific content management systems (CMSs). We also present a location-based request forwarding mechanism for the service router. Every request from the applications must include the users’ location coordinates. These coordinates are used to determine to which information provider the request should be forwarded. In addition, the forwarding mechanism includes a caching mechanism to make efficient the forwarding process. The architecture and forwarding mechanism are implemented in RESTful Web Services. This architecture offers three main benefits, i.e.: (i) natural fit to real-world situation, in which each area is administered by an authority, (ii) scalability by delegating the routing tasks to a composition of service routers in a hierarchical architecture, and (iii) consistent presentation by allowing the mobile applications to restructure and reformat information from the providers.

Modification of the Integer Branch and Bound Method for Solving of a Two-Dimensional Routing Task of an Aircraft Group's Coordinated Flight

Below is a solution for a direct-sales representative in case of a two-dimensional routing of a flight, which differs by formation of two initial matrixes of the distances between the points of two unlinked routes, which are analyzed in turn with a coordinated selection of the element of the minimal length in each of them. In comparison with the known branch and bound method, there is no need in an additional choice for an alternative, which is essentially new in the solved task - to which of the two routes the element should belong to. For this purpose it is necessary to know, to what route it is closer to, and for evaluation of this proximity two criteria are used: - at the first stage of calculation on each step it is the calculation of the minimal distance from an element to the center of gravity of each of the routes by using the triangular model of approximation of the flight trajectory. This allows us to part gradually step by step the centers of gravity at a certain distance, sufficient to continue the calculations; - at the second stage of calculation, the minimal distances from the element to the approximated trajectories of each route are calculated, which allows us to refuse in case of their equality in general accession of the element to any route and by that to avoid an unnecessary inclusion of the crossing points between them. Examples of the calculations proving the efficiency of the offered approach and indicating reduction of the performance of the flight of points more than twice are presented.