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 optimization of the relaying topology in multihop cellular network should provide the answer to the question who is transmitting to whom, and when, in such a way to insure the best system performance. In the case of temporally and spatially varying traffic distribution the optimal topology will also vary in time and an efficient way for topology reconfiguration is needed in order to maximize the...
Design optimisation of large system-on-chip (SoC) designs presents significant challenges in terms of the number of care-abouts in today's chip design scenario. While optimisation approaches have focused on key aspects like design timing, power and routability, there are several critical aspects that do not get modelled by the abstraction approaches used in current solutions, resulting in local areas...
Based on the principle of kernel route, a tabu search algorithm is designed for large-scale integrated vehicle routing problem (LSIVRP) with constraints of capacity and delivery distance. The algorithm has two phases: initial optimization and post-optimization. In initial optimization, the kernel routes in route library are updated constantly to form the framework of optimal routes. In the first phase...
The logistics vehicle scheduling problem is a widely existent problem in distribution. In fact, it is the vehicle routing problem with time window. In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimize the total distance travelled by all vehicles. This is an NP-complete optimization...
In LEO satellite constellation communication system, the routing strategy becomes a big challenge for the movement between satellites. According to researching on the 24/3/1 walker satellite constellation with inter-orbit ISLs and intra-orbit ISLs, two routing optimization scenarios based on ISL state and topology snapshot are suggested. At the same time, some valuable conclusions are provided according...
This paper compared the clustering performance of the proposed FCM-based clustering scheme with HCM to the hierarchical topology optimization in overlay multicast. The paper firstly depicts the proposed scheme including 1) defining the clustering feature distance based on overlay path latency, 2) calculating the Euclidean distance within each pair of overlay nodes to construct the fuzzy membership...
This paper proposed a dynamic fuzzy clustering scheme with adaptive fuzzy threshold to the hierarchical topology optimization in overlay multicast. The scheme firstly normalized the two routing metrics - overlay path delay and overlay node access bandwidth-- to comprise the clustering feature vector, and then calculated the Euclidean distance within each pair of overlay nodes to construct the fuzzy...
The enhancement of cellular networks with relaying technologies is expected to bring significant techno-economic benefits, but proper allocation of resources may be a challenging task. This paper addresses the question whether cross-layer optimization is essential for obtaining the expected relaying benefits. We present a network dimensioning approach based on joint routing and radio resource allocation...
In this paper, author comes up with a new optimization algorithm about distribution routing planning. This method is used to make the best distribution route according to vehiclepsilas load capacity, distance from distribution centre and various client demand as well as cargo priority etc. The result could be displayed in electronic map. Proved by instances, this method can help managers to reduce...
In this article we study the capacitated location routing problem (CLRP) which is defined as a combination of two problems: the facility location problem (FLP) and the vehicle routing problem (VRP). The CLRP is not just a purely academic construct; it has many applications in the practice. We propose a hybrid approach based on a tabu search algorithm combined with an improved ant colony system to...
Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each antpsilas solution might be improved by dynamic sweep Algorithm which...
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local...
Recently, it has been proven that the minimum-cost multicommodity flow can be realized by a link-state routing protocol, PEFT, using uneven traffic splitting (D. Xu et al., 2008). The achievement is due to solving a new convex optimization problem, network entropy maximization (NEM), by a gradient descent algorithm. However, gradient descent algorithms are notorious for slow convergence to optimality...
This paper explores the attributes, layering models and objective functions in cross layer designs for mobile ad hoc wireless networks by taking all the statistical characteristics and constraints from the physical (PHY) layer, media access control (MAC) layer and network (NET) layer into consideration. This paper reviews the entire network optimization across all the PHY/MAC/NET layers. At the PHY...
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.