Search results for "routing"

Brief communication: Vehicle routing problem and UAV application in the post-earthquake scenario

2017

Abstract. In this paper we simulate a Unmanned Aerial Vehicle's (UAV) recognition after a possible case of diffuse damage after a seismic event in the town of Acireale (Sicily, Italy). Given a set of sites (84 relevant buildings) and the range of the UAV, we are able to find the number of vehicles to employ and the shortest survey path. The problem of finding the shortest survey path is an operational research problem called Vehicle Routing Problem (VRP) whose solution is known to be computationally time-consuming. We used the Simulated Annealing (SA) heuristic that is able to provide stable solutions in relatively short computing time. We also examined the distribution of the cost of the s…

Fleet deployment e routing design nel trasporto marittimo veloce dei passeggeri tra la Sicilia e le Isole Minori

2009

A Dynamic Distributed Algorithm for Multicast Path Setup

2005

In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…

An efficient distributed approach for dynamic multicast trees

2005

In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…

Backoff Hardware Architecture for Inter-FPGA Traffic Management

2017

International audience; Multi-FPGA platforms are considered to be the mostappropriate experimental way to emulate a large Multi-ProcessorSystem-on-Chip based on a Network-on-Chip. However, theuse of a Network-on-Chip in several FPGAs requires inter-FPGA communication links to replace intra-FPGA links betweenrouters. As the ratio of the logic capacity to the number of IOsonly increases slowly with each generation of FPGA, IOs inFPGA are becoming a scare resource. And as there are morerouters than IOs, using a Network-on-Chip requires sharinginter-FPGA links between routers, and sharing an external linkcan lead to bottlenecks. Here, we evaluate the inter-FPGA trafficmanagement using a backoff…

The essential variation of a function and some convergence theorems

1996

ВВОДИтсь ОпРЕДЕлЕНИ Е ВАРИАцИИ ФУНкцИИ, пР И кОтОРОМ ФОРМУлА $$V(F,E) = \int_E {|\bar DF(x)} |dx$$ спРАВЕДлИВА Дль пРОИ жВОльНОИ ФУНкцИИF И пРОИжВОльНОгО ИжМЕР ИМОгО МНОжЕстВАE НА ОтРЕжкЕ пРьМОИ. В т ЕРМИНАх ЁтОИ ВАРИАцИ И пОлУЧЕНы тЕОРЕМы О пОЧлЕННОМ ДИФФЕРЕНцИРОВАНИИ п ОслЕДОВАтЕльНОстИ Ф УНкцИИ И тЕОРЕМы О пРЕДЕльНОМ пЕРЕхОДЕ пОД жНАкОМ И НтЕгРАлА ДАНжУА-пЕРР ОНА.

Rectifiability of RCD(K,N) spaces via δ-splitting maps

2021

In this note we give simplified proofs of rectifiability of RCD(K,N) spaces as metric measure spaces and lower semicontinuity of the essential dimension, via -splitting maps. The arguments are inspired by the Cheeger-Colding theory for Ricci limits and rely on the second order differential calculus developed by Gigli and on the convergence and stability results by Ambrosio-Honda. peerReviewed

Iterative integral equation methods for structural coarse-graining

2021

In this paper, new Newton and Gauss-Newton methods for iterative coarse-graining based on integral equation theory are evaluated and extended. In these methods, the potential update is calculated from the current and target radial distribution function, similar to iterative Boltzmann inversion, but gives a potential update of quality comparable with inverse Monte Carlo. This works well for the coarse-graining of molecules to single beads, which we demonstrate for water. We also extend the methods to systems that include coarse-grained bonded interactions and examine their convergence behavior. Finally, using the Gauss-Newton method with constraints, we derive a model for single bead methano…

A rigorous and efficient full-wave analysis of uniform bends in rectangular waveguide under arbitrary incidence

2003

In this paper, a rigorous full-wave analysis of uniform bends in rectangular waveguides is performed. An accurate and efficient method-of-moments solution combined with the generalized-admittance-matrix (GAM) formulation is proposed in order to achieve a full-wave characterization of the analyzed structures. This full-wave modal solution turns out to be necessary for modeling complex microwave devices involving an arbitrary number of discontinuities between curved and straight waveguides, where all the modes of the involved guides are excited. The key feature of the presented method lies in the GAM representation of single and cascaded curved E- and H-plane uniform bends, which allows the c…

Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules

2021

Abstract The success of warehouse management in a supply chain widely depends on an efficient and effective retrieve of customer orders, which is known as the picking process. This paper investigates various routing policies of pickers under two different allocation methods of items in a warehouse of fixed layout, and evaluates their performance in terms of the resulting travel distance by means of a simulation approach. The allocation strategies taken into account are the random storage and a multi-criteria approach, called Interval-Value TOPSIS (IV-T), which is expressively proposed in this paper as a new way to solve the storage allocation problem of items in a warehouse. Because of the …