Search results for "electronic design automation"
showing 10 items of 118 documents
Fast automated design of waveguide filters using aggressive space mapping with a new segmentation strategy and a hybrid optimization algorithm
2005
Waveguide filters are key elements present in many microwave and millimeter-wave communication systems. In recent times, ever-increasing efforts are being devoted to the development of automated computer-aided design (CAD) tools of such devices. In this paper, a novel CAD tool based on modal analysis methods, which improves the efficiency and robustness of the classical aggressive space-mapping technique, is presented for those purposes. The use of a new segmentation strategy and the hybridization of a specific combination of several well-known optimization algorithms is proposed. The CAD tool has been successfully validated with the practical design of several H-plane coupled cavity filter…
Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints
2012
This paper presents a survey of vehicle routing problems with multiple synchronization constraints. These problems exhibit, in addition to the usual task covering constraints, further synchronization requirements between the vehicles, concerning spatial, temporal, and load aspects. They constitute an emerging field in vehicle routing research and are becoming a “hot” topic. The contribution of the paper is threefold: (i) It presents a classification of different types of synchronization. (ii) It discusses the central issues related to the exact and heuristic solution of such problems. (iii) It comprehensively reviews pertinent literature with respect to applications as well as successful s…
Novel Fault-Tolerant Routing Technique for ZMesh Topology based Network-on-Chip Design
2020
This paper proposes a novel fault-tolerant routing technique for ZMesh topology based Network-on-Chip (NoC) design. The proposed algorithm caters the link faults and routes the data packets seamlessly to the destination. This algorithm has been compared with the existing techniques proposed for mesh topology counterparts. The experimentations have been carried out by increasing ZMesh network size and percentage of link faults. The results show that in the event of link failures the proposed algorithm routes the data from source to destination flawlessly.
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
Routing quantum information in spin chains
2013
Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to be the target of the quantum state transmission protocol via a coherent quantum coupling mechanism making use of local/global magnetic fields. Quantum routing is achieved, in the first of the models considered, by weakly coupling the sender and the receiver to the data bus. In the second model, strong magnetic fields acting on additional spins located between the sender/receiver and the data bus allow us to perform high fidelity routing.
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra
1998
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…
Real-Time Routing Selection in Flexible Manufacturing Systems
1993
Routing flexibility is one of the main peculiarities of Flexible Manufacturing Systems. This paper proposes three methods for real-time routing selection. The first one makes decisions comparing the current workload of machines in each alternative path. The second method considers the current workloads at the bottleneck machines in each allowed route. The third approach makes real-time decisions minimizing a merit index that represents a measure of the still required resource amount. The index is computed by short discrete-event simulation runs. Some case studies evaluate and compare the proposed approaches.
Interactive simulation of one-dimensional flexible parts
2006
Computer simulations play an ever growing role for the development of automotive products. Assembly simulation, as well as many other processes, are used systematically even before the first physical prototype of a vehicle is built in order to check whether particular components can be assembled easily or whether another part is in the way. Usually, this kind of simulation is limited to rigid bodies. However, a vehicle contains a multitude of flexible parts of various types: cables, hoses, carpets, seat surfaces, insulations, weatherstrips... Since most of the problems using these simulations concern one-dimensional components and since an intuitive tool for cable routing is still needed, w…
Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
2021
Abstract The multi-compartment vehicle routing problem with flexible compartment sizes is a variant of the classical vehicle routing problem in which customers demand different product types and the vehicle capacity can be separated into different compartments each dedicated to a specific product type. The size of each compartment is not fixed beforehand but the number of compartments is limited. We consider two variants for dividing the vehicle capacity: On the one hand the vehicle capacity can be discretely divided into compartments and on the other hand compartment sizes can be divided continuously. The objective is to minimize the total distance of all vehicle routes such that all custo…
Cost-Effective Congestion Management for Interconnection Networks Using Distributed Deterministic Routing
2010
The Interconnection networks are essential elements in current computing systems. For this reason, achieving the best network performance, even in congestion situations, has been a primary goal in recent years. In that sense, there exist several techniques focused on eliminating the main negative effect of congestion: the Head of Line (HOL) blocking. One of the most successful HOL blocking elimination techniques is RECN, which can be applied in source routing networks. FBICM follows the same approach as RECN, but it has been developed for distributed deterministic routing networks. Although FBICM effectively eliminates HOL blocking, it requires too much resources to be implemented. In this …