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.
Warehouses are obliged to optimize their operations with regard to multiple objectives, such as maximizing effective use space, equipment, labor, maximize accessibility of products, maximize amount of processed orders and all this should be achieved whilst minimizing order processing times, distance traveled, broken promises, errors and not to forget the operational cost. A product placement problem...
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...
A wireless sensor network consists of a large number of sensor nodes scattered in the region of the network which have limited energy and limited computational and sensing ability. Data aggregation is important in this kind of network which can make use of the energy of the sensor nodes efficiently, and reduce the traffic in network by utilizing the abilities of the nodes in local computation and...
It's necessary to choose the optimal route in traffic network. Various foreign researchers have done a lot of research and improvement. The traditional optimal routing algorithms were represented by Dijkstra algorithm, and they all not only had high complexity but also had the disadvantage of not reflecting the dynamic very well. In this paper, a new algorithm about choosing the optimal routing problem...
We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange state information. Since communication costs can be significant, we seek conditions under which communication of state information among nodes can be minimized while still ensuring that the optimization process converges. In prior...
An important limitation of the fixed charge location model, is the assumption that full truckload quantities are shipped from a facility to a customer. In many contexts, shipments are made in less-than-truckload (LTL) quantities from a facility to customers along a multiple-stop route. The different location decision is made from the different cost of delivery. In this paper we are concerned with...
The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on cross-entropy is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic...
Ant system (AS) is a novel simulated evolutionary algorithm which shows many good characters, but it has some typical shortcomings, such as high time complexity, stagnation behavior. An ant adaptive dynamic ant system (ADAS) based on acceleration is proposed, which is improved from AS by modifying the pheromone updating rule and the transition rule with evenness of solution, interesting and acceleration...
In the following paper, we study the tradeoff between network utility and network lifetime for energy-constrained wireless sensor networks (WSNs). By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. First, using the dual decomposition method, we decompose the tradeoff model...
A two-phase set partitioning model is proposed to solve passenger transportation, this problem is a real life application for the pickup and delivery problem where vehicles have to transport passengers from their locations to different destinations with minimal routing cost. Following the classical cluster-first route-second approach the problem is modelled in two phases and solved like a set partitioning...
Multipath inter-domain routing can solve many technical flaws which have been exposed in BGP, but the market-driven factors have more direct relationship with its deployment. In order to analyze impact of these market-driven elements, this paper established an optimization model for Internet service provider (ISP) revenues based on user's utility function. Then, the solution using Lagrange multiplier...
Due to the increased demands for distribution/redistribution, recycling and repacking, there has been a significant change in the logistics process. This article presented an ant colony system (ACS) algorithm to solve a vehicle routing problem with simultaneous delivery and pick-up (VRPSDP). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery...
Wireless sensor networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. These characteristics make them different rather than other networks. WSNs composed of set of nodes that collect and transmit information about their environment. They have different constraints such as computational power, storage capacity, energy and etc. Of course the...
To resolve the scalability problem in the existing Internet, there are many researches proposing the idea of separating the Internet into two independent evolving spaces, the access network and the core network, respectively. Such separation provides us opportunities to reconsider the methods of implementation of inter-domain traffic engineering under the new network environment. Based on the existing...
Recent study reveals that great benefit can be achieved for data gathering in wireless sensor networks by employing mobile collectors that gather the data via short-range communications. To pursue maximum energy saving at sensor nodes, intuitively, a mobile collector should traverse the transmission range of each sensor in the field such that the transmission of each packet can be constrained to a...
Microfluidic biochips require continued online test to ensure their functionality, performance, and reliability in the presence of runtime parametric variation and system wear-out. Previous techniques locate catastrophic defects which guide subsequent droplet scheduling and routing procedures. However, a significant number of defects on a microfluidic biochip are parametric variations, taking them...
The high capacity of fibers used in optical networks, can be divided into many channels, using the WDM technology. Any damage to a fiber causes all the channels routed through this link to be broken, which may result in a serious amount of data loss. As a solution to this problem, the virtual layer can be mapped onto the physical topology, such that, a failure on any physical link does not disconnect...
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...
In this paper, a hierarchical evolutionary approach is proposed for an NP-complete telecommunication problem- all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of...
Energy efficiency is one of the most important factors in wireless sensor networks. In this paper, we present a centralized ldquocluster-chainrdquo power efficient routing algorithm SOC-IACO which consists of self-organizing clustering algorithm SOC and intelligent ant colony algorithm IACO. The base station (BS) firstly uses SOC algorithm to form clusters and select associated cluster heads (one...
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.