The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The random nature of network topology is a major challenge while developing new routing protocol for Opportunistic Networks (OppNets). Additionally, other factors like intermittent connections, limited bandwidth etc. further restrict the performance of existing routing protocols. In this paper, an advanced context aware routing protocol called GAP is proposed. The proposed protocol efficiently combines...
The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling numerous scheduling and routing constraints while aiming to minimise total operational cost. One of the main obstacles in designing a genetic algorithm for this highly-constrained combinatorial optimisation problem is the amount of...
This paper describes the developed genetic, ant colony and bee algorithms for solving the following printed circuit board (PCB) design multi-criteria optimization problems: PCB elements packaging within modules, irregularly shaped components placement on PCB, and multilayer PCB routing. The results of the simulation experiments confirm that the bionic algorithms have the better convergence and better...
In Three Dimensional Integration Circuit (3D IC) challenges involved in removing heat from the intervening layers. Here, the thermal analysis of TTSVs (Thermal Through Silicon Vias) at the heat sink of the circuit and also the optimizations of corresponding heat sinks has been carried out using Genetic algorithm (GA) with IBM-route benchmark circuits as a inputs. Compared to the previous experimental...
This paper provides a stochastic optimization algorithm for the planning of distribution system (DS) feeders. The algorithm finds the optimal feeder routing considering the stochastic variations of load demands (e.g., electric vehicle charging stations) as well as renewable-based distributed generators (DGs) (e.g., photovoltaic and wind DGs). The stochastic variations are addressed using a Monte-Carlo...
Routing and spectrum assignment (RSA) problem is a crucial task in designing, planning and operating next-generation optical network based on flex-grid scheme. In practical cases, solving RSA problem involves a number of objectives which, very often, may be in conflict to each other. The need is therefore to find a pool of solutions, known as Pareto-optimal solutions, which are equally optimal. In...
Driven by environmental concerns, electric vehicles (EVs) have been used in last-mile delivery in some areas. Limited cruising range, long recharge time and insufficient number of recharging stations have to be considered in route planning to avoid unnecessary detours. In this paper we present a vehicle routing problem for battery electric vehicles with time window constraints. Both driving costs...
In flex-grid optical network, routing and spectrum assignment (RSA) problem is a crucial task for planning and operating. Due to the non-deterministic polynomial time (NP-hard) complexity of problem, efficient computing techniques are always sought out with the aim to not only achieve good solutions but also in an efficient time span. In this context, this paper addresses the static version of RSA...
Elastic Optical Network (EON) architecture has been proposed as a promising technology for a new generation of OFDM networks. It is based on the concept that spectrum can be split into smaller slices than are used currently in the fixed-grid network. It allows better spectral utilization and support for bit rates over 100 Gb/s. EONs arise with the problem of routing and spectrum allocation (RSA)....
Routing plays a major role in increasing the energy efficiency of a wireless sensor network. In a cluster based wireless sensor network, cluster head can forward the data to the base station either directly or indirectly (multi-hoping). However, in multi-hop routing energy saving is more as compared to direct transmission. Further, the selection of energy efficient routing schedules helps in increasing...
The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling scheduling and routing constraints while aiming to minimise the total operational cost. This paper presents a Genetic Algorithm (GA) tailored to tackle a set of real-world instances of this problem. The proposed GA uses a customised...
In transparent optical networks it is critical to consider the impact of the crosstalk effect on the routing and wavelength assignment (RWA) process, in order to limit the impact of jamming attacks on the network, as well as the increased cost arising from the need for high port isolation in optical nodes. In this paper, we propose the use of a Genetic Algorithm (GA) that solves the RWA problem with...
Network path identification is an important problem in networks. It is important to identify routing path for data transfer from a source to destination. Network path found should be feasible in overcoming congestion, real time data transfer. This paper reviews three different methods to find network path identification using biologically inspired algorithms in different scenarios. It will provide...
The placing components and routing are very important in designing PCB, although they require a lot of time and precision. Auto placer and auto router application that are available so far are proprietary and thus cannot be developed freely. This research proposes optimization design of PCB alongside with genetic algorithm and routing lee algorithm. The genetic algorithm allocates components automatically...
In the recent years many researchers have addressed the problem of energy efficient routing in the WDM optical networks. Typical strategies involve putting the network components into sleep mode or switching off the network components in low utilization periods. In this paper, we propose a strategy based on the principle of anycast routing, where it is possible to select the most suitable destination,...
Given an undirected weighted connected graph G = (V,E) with vertex set V and edge set E and a designated vertex r ∈ V , we consider the problem of constructing a spanning tree in G that balances both the minimum spanning tree and the shortest paths tree rooted at r. Formally, for any two constants α, β ≥ 1, we consider the problem of computing an (α, β)-balanced spanning tree T in G, in the sense...
In Wireless Sensor Networks (WSNs), data aggregation techniques have the ability of reducing the data redundancy and the communication load. The probabilistic aggregation protocols make the dynamic routing decision, the nodes do not have explicit knowledge of downstream and upstream neighbors, and then it is difficult to obtain high aggregation efficiency. In order to address this problem, this paper...
Aimed at the problem of commercial vehicles' distribution routes and transportation mode, as well as the reliability of service, a distribution optimization model is constructed which considered the transportation cost, transit cost and punishment cost. Then apply genetic algorithm to solve the problem. Finally, used the data from a vehicle logistics enterprise for analyzing, which proved that the...
This paper presents the development of web logistics system to collect products, whose objective to minimize the transport cost and finding the best routes and represent them graphically on a map. The routing problem studied in this paper uses vehicle capacity constraints, time windows and dynamic constraints based on the domain model of the system. The method proposed of resolution was genetic algorithm,...
The Capacitated Vehicle Routing Problem (CVRP), is a capacity constrained type of vehicle routing problem, which is widely studied with many real-world applications. Based on this problem there are many researches and proposed papers depend on different types of algorithms. However, genetic algorithm based methods are scarcely proposed in the literature. In this paper, genetic algorithms are examined...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.