Search results for "routing"
showing 10 items of 587 documents
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.
Arc routing problems: A review of the past, present, and future
2020
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emergin…
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.
Solving the length constrained K-drones rural postman problem
2021
[EN] In this paper we address the Length Constrained K-Drones Rural Postman Problem (LC K-DRPP). This is a continuous optimization problem where a fleet of homogeneous drones have to jointly service (traverse) a set of (curved or straight) lines of a network. Unlike the vehicles in classical arc routing problems, a drone can enter a line through any of its points, service a portion of that line, exit through another of its points, then travel directly to any point on another line, and so on. Moreover, since the range of the drones is restricted, the length of each route is limited by a maximum distance. Some applications for drone arc routing problems include inspection of pipelines, railwa…
A neural network-based approach to determine FDTD eigenfunctions in quantum devices
2009
This article combines a Neural Network (NN) algorithm with the Finite Difference Time Domain (FDTD) technique to estimate the eigenfunctions in quantum devices. A NN based on the Least Mean Squares (LMS) algorithm is combined with the FDTD technique to provide a first approach to the confined states in quantum wires. The proposed technique is in good agreement with analytical results and is more efficient than FDTD combined with the Fourier Transform. This technique is used to cal- culate a numerical approximation to the eigenfunctions associated to quan- tum wire potentials. The performance and convergence of the proposed technique are also presented in this article. © 2009 Wiley Periodica…
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…
In vitro response of two Sicilian genotypes of Morus (L.) through axillary bud culture.
2007
A protocol for the in vitro establishment of two Sicilian genotypes of mulberry has been set up. Multiple shoots were initiated and plantlets were produced from buds collected from mature trees of Morus alba L. and Morus nigra L., grown in the field. The influence of two explanting times (September and December) of buds on the in vitro response has been observed. The percentage of sprouting after four weeks of culture was greatly higher with material explanted from the field in September compared with the one collected in December. Morus nigra L. produced more vigorous shoots than Morus alba L.. After the second subculture the number of shoots produced decreased, in both genotypes. No diffe…