Search results for "Electronic Design Automation"
showing 10 items of 118 documents
The directed profitable rural postman problem with incompatibility constraints
2017
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
2017
[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…
A Bio-Inspired Cognitive Agent for Autonomous Urban Vehicles Routing Optimization
2017
Autonomous urban vehicle prototypes are expected to be efficient even in not explicitly planned circumstances and dynamic environments. The development of autonomous vehicles for urban driving needs real-time information from vehicles and road network to optimize traffic flows. In traffic agent-based models, each vehicle is an agent, while the road network is the environment. Cognitive agents are able to reason on the perceived data, to evaluate the information obtained by reasoning, and to learn and respond, preserving their self-sufficiency, independency, self-determination, and self-reliance. In this paper, a bio-inspired cognitive agent for autonomous urban vehicles routing optimization…
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
2021
The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
Analysis and Optimization Technique of Secure Smart Grid Communication Network for Sustainable Development
2019
The smart network includes many sub-frameworks, for example, the Home Area Network (HAN), which are at risk and prone to be attacked remotely. A smart grid communication is meant to design a mutual authentication scheme and a key management protocol. This study is aimed with an efficient arrangement for HAN that analyzes a framework set-up for HAN. In this paper, we have analyzed three cases: First, we show the normal execution then execution along with attackers. Using mutual authentication, we overcome attacks. It has introduced a number of routing schemes for grid networks in recent years, and they provide different level of privacy protection at different cost. First, an unspecified key…
A distributed detection and prevention scheme from malicious nodes in vehicular networks
2016
Summary Vehicular environments still remain vulnerable to various potential attacks because of continuous interactions and information exchange between vehicles despite the deployment of authentication techniques by communication standards. Therefore, an authenticated node with a certificate could initiate an attack while complying with implemented protocols. Some mechanisms were proposed to enhance communication technologies, but none of them was able to anticipate nodes' behavior. They also mismanage oscillating vehicles, because they evict them automatically after misbehaving. In this paper, we propose a preventive mechanism, namely, Intrusion Prevention and Detection System (IPDS), able…
Construction of Disjoint Virtual Backbones for Wireless Sensor Networks
2020
A wireless sensor network is a wireless network of sensors aimed at monitoring physical events. It has ingratiated itself into almost all areas of human endeavors. Data dissemination in these networks is quite challenging and is generally accomplished by flooding. But flooding introduces broadcast storm problem due from implosion and overlap. To overcome this, topology management can prescribe a virtual backbone network to which routing is confined. In this paper we propose an algorithm that constructs multiple disjoint virtual backbone networks, using only nodes' locations. The disjointedness makes routing more robust and the network exploitation energy efficient. Simulations show our algo…
The Network Balance Realized by Routing Organization System
2011
In the presented paper, we propose to exploit routing organization for the purpose of managing network resources. According to our assumptions, we have the same quantity of materials, objects, tokens, tools etc. at our disposal in every node of the network. During network operation we must distribute resources between these nodes. It should be carried out as instantaneously and as economically as possible. Multi-Agent Systems are also used to deal with this kind of tasks and the centralised algorithms presented in this paper are to be used to measure the efficiency of the distributed MAS solution. From the logistical point of view, we have a sequence of stages with different states of token…