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 heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal...
Most EOL electronic products come from industrial by-products and consumer goods as solid waste. Recycling the EOL electronic products is a complex and long term process. This paper focuses on the location and routing problem of electronic products recycling center. Firstly this paper applies AHP method to select the locations of electronic products recycling centers, and sort various elements by...
Vehicle routing problem is an important combinatorial optimization problem. It has an important position in logistics optimization and supply chain management theory. Due to traffic flow, traffic incidents and other factors, the travel speed and travel time of road has large time-variability and randomness in real transport network. The study of vehicle routing problem in time-dependent network has...
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
Wireless Sensor Networks(WSN) is a hot spot of the research of wireless networks currently, the key of achieving efficient transmission business is to control node energy and improve the network lifetime in wireless sensor networks. The paper first uses Boolean sensing model based on Poisson point process to identify the function of the rate of coverage and the node density in unit area, and then...
Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay-jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded...
There are certain aspects in the field of networking that needs to be accomplished, yet it is very difficult to achieve. One such concept is Optimization. Achieving a high degree of reliability will eventually lead us to Optimization. But, achieving high degree of reliability?? This indeed is a very big problem that needs a solution. There have been many solutions before that solves the problem in...
Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. aiming at the increasing network traffic and the deficity that the former Ant...
Take a research in depth on the modeling problem of service path selection based on SON. Firstly, the optimal model is built with the optimal goal of balanced loading and with the functional constraints of users for composed service and multi-QoS constraints. Then the layered method and improved Ant algorithm are adopted to solve this problem. Finally, a simulated emulation is made to the algorithm,...
The design of telecommunication network concerns the selection of arcs in a graph with involved cost as low as possible, but satisfies constraints such as point-to-point demands routed across the network, arc capacity, hop constraints and so on. Such a design must allocate enough flows and diverse routing paths through the network to ensure that feasible information flows continue to exist, even when...
We studied a class of Service Overlay Network (SON) capacity allocation problem. By analyzing the problem with two different nonlinear optimization formulations, we show that the prices of offering service guarantees are closely related to a set of Lagrange multipliers. Moreover, if the Grade of service (GoS) constraints are not hard requirements, the network design resulting from the set of prices...
The capacitated vehicle routing is a combinatorial optimization problem of that has aroused major interest because it is present in critical areas (logistics, transport and other) and it is a problem of considerable difficulty. There are currently several techniques that have been developed to try to solve this problem efficiently. In this paper, we present a solution to this problem based on the...
In this paper we propose a tabu search heuristic embedded in adaptative memory procedure to solve the profitable arc tour problem (PATP). The PATP is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the tours of vehicle that maximize the collection of profits minus travel costs, which is in its turn subject...
Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given...
In order to establish a trusted and secure wireless mesh network, routing protocols should not only ensure the integrity, confidentiality and authentication, but also take into consideration the fact that the application of routing strategies should not impact the performance of routing protocols to a severe extent. This paper adopts Node's Trust as a routing parameter, and some improvements are made...
We introduce the problem of joint routing, scheduling and power control for multiple information flows in half-duplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N3) time. We attack the problem in two ways, first by presenting a reformulation and decomposition...
This paper presents a new approach for solving network routing optimization problems. In particular, the goal is to optimize the traffic in the network structured event-driven systems as well as to provide means for efficient adaptation of the system to changes in the environment-i.e. when some nodes and/or links fail. Many network routing optimization problems belong to the class of NP hard problems,...
Routing is a challenging task in mobile adhoc network due to nodal mobility, unstable links and limited resources. Swarm intelligence, as demonstrated by biological swarm, such as ant colony has found to be a attractive technique for routing in MANET. However existing swarm intelligence based routing protocols find an optimal path by considering only one or two route selection metrics, such as hop...
Nowadays, the requirement of Internet is increasing in more and more heterogeneous scenarios; especially in mobile platforms, such as Planes, trains and buses. NEMOWG (network mobility workging group) a new working group in IETF (Internet Engineering Task Force) is formed to provide mechanisms to manage the mobility of a network as a whole, enabling that network to change its point of attachment to...
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kinds of networks are very flexible and thus they do not require any fixed infrastructure or central administration. Therefore, mobile ad-hoc networks can be deployed easily and used as temporary communication links. The biggest challenge in these kinds of networks is to find a path between the communication...
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.