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 properties found in complex networks (e.g., small-world, scale-free) have been used to characterize the behaviour of several processes such as epidemics or oscillators. We analyze the impact of such properties on the quality of a routing process. Using a Mixed Integer/Linear Program, the routing minimizes the number of ports installed in a previously designed network. Ports are network components...
Redundant via insertion is highly recommended for improving chip yield and reliability. In this paper, we studied the problem of simultaneous double via insertion and wire bending (DVI/WB) in a postrouting stage, where a single via can have at most one redundant via inserted next to it. Aside from this, we are allowed to bend existing signal wires for enhancing the insertion rate of double vias. The...
According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome...
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve...
In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding, can be expensive in terms of energy. This limitation challenges the use of sensor networks for applications that demand a predefined operational-lifetime. To avoid this problem, using of mobile element (ME) as a mechanical data carrier has emerged as a promising approach. However, practical considerations...
According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed...
The performance of multi-radio multi-channel wireless mesh networks (WMNs) based on the IEEE 802.11 technology depends significantly on how the channels are assigned to the radios and how traffic is routed between the access points and the gateways. In this paper we propose an algorithmic approach to this problem, for which no conclusive solution has been put forward in the literature so far. The...
This paper investigates the diverse routing problem in the presence of shared risk link groups (SRLGs) and proposes two ILP models for partial SRLG-disjoint protection based on grouping of the individual SRLGs in classes. We demonstrate our approach with SRLGs constructed from seismic maps, hence reducing the likelihood of a single earthquake affecting large portions of the network. Compared with...
Most approaches to improve dual failure restorability characteristics of p-cycle designs remain within the paradigm of shared protection. In this paper we investigate a novel p-cycle-based dedicated protection architecture, somewhat resembling UPSR rings, called ??UPSR-like p-cycles??, that could be used to enable high levels of dual failure restorability for select services. We develop a fast and...
Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Pre-configuring the network in a traffic independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this...
p-Cycle protection is an efficient pre-configured and pre-cross-connected protection scheme which can achieve ring-like recovery speed while retaining the capacity efficiency of mesh-based schemes. Thereafter, we study the stability and the efficient reconfiguration of p-cycles in the context of dynamic asymmetric traffic, a protection problem that is acknowledged to be difficult to solve, but with...
Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed...
In this paper, we consider hybrid flow shop (HFS) scheduling problem with a special blocking constraint. Objective function is makespan minimization. HFS and RCb blocking constraint are firstly presented. Then, an integer linear model is presented to find the optimal solution and a lower bound is proposed for high size problems. In order to faster obtain a solution, especially for big size problems,...
Considering that travel routing costs change with time against the background of reverse logistics, this paper presents the time dependent vehicle routing problem of simultaneous delivery and pick-up (TD-VRPSDP), and establishes the mixed integer programming model of TD-VRPSDP. The pheromone updating strategy based on rank-based ant colony system and max-min ant system algorithm are used for solving...
This paper proposes an IP finely-distributed load- balanced routing scheme based on two-phase routing over shortest paths, where the traffic matrix is given. It is called the fine two-phase routing (F-TPR) scheme. In F-TPR, traffic is distributed from a source node to intermediate nodes more finely, compared to the original TPR. F-TPR determines the distribution ratios to intermediate nodes for each...
This paper addresses a ship inventory routing and scheduling problem faced by an oil company serving many locations. The problem involves the delivery of multiple products from loading to unloading ports by using heterogeneous types of limited numbers of ships. The nature of the products needs them to be loaded separately into compartments of the ships. However, the compartments are not dedicated...
Operations research is usually employed to solve the facility location problem, mainly using mixed integer linear programming (MILP). Meanwhile, some MILP models were not originally designed to solve a large class of location problems, corresponding to those where customers are served in a routing operation. In this case location and routing decisions are strongly interrelated. Moreover, this modeling...
Wireless Sensor Networks (WSNs) are composed of autonomous and resource-constrained (power, sensing, radios, and processors) nodes. These networks are conceived to have a large number of nodes working on monitoring phenomena in an area. So, a major challenge for this networks is to provide solutions that maximize quality of service (QoS) requirements, such as coverage and data routing, and minimize...
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design path-selection strategies that minimize the probability that the adversary can successfully control the entrance to and exit from the network. This minimizes the chance that the adversary can observe and correlate patterns...
There are lots of operations in the distribution center, of which the replenishment operation is an important one that can decrease the processing time seriously and bring considerable economic benefit if managed effectively. We consider the replenishment problem in which travel time and distance is measured according to rectilinear norm. An O(n) polynomial time algorithm to find the optimal replenishing...
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.