Algorithms for the On-Line Travelling Salesman 1

In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We consider two versions of the problem. In the first one the server is not required to return to the departure point after all presented requests have been served. For this problem we derive a lower bound on the competitive ratio of 2 on the real line. Besides, a 2.5 -competitive algorithm for a wide class of metric spaces, and a 7/3 -competitive algorithm for the real line are provided. For the other version of the problem, in which returning to the departure point is required, we present an optimal 2 -competitive algorithm for the above-mentioned general class of metric spaces. If in this case the metric space is the real line we present a 1.75 -competitive algorithm that compares with a \approx 1.64 lower bound. Received November 12, 1997; revised June 8, 1998.     

MASS BALANCE CALCULATIONS FOR DIFFERENT MODELS OF HYDROCARBON MIGRATION IN THE JEANNE D'ARC BASIN,OFFSHORE NEWFOUNDLAND

Basin and petroleum systems modelling is a powerful tool in petroleum exploration, but uncertainties remain in terms of the evaluation of a petroleum accumulation's size and quality, even when the petroleum system is well known and the latest modelling technology is applied. In order to interpret the results of a modelling exercise, it is necessary to understand the advantages and disadvantages of the various possible approaches used to assess petroleum migration and accumulation. This paper attempts to compare the influence of different migration modelling techniques – the flowpath, Darcy “hybrid” and invasion percolation approaches – on basin‐wide mass balance calculations for a temperature‐ and pressure‐calibrated, numerical four‐dimensional basin model. The study was performed using PetroMod® software. The study area is the well‐known Jeanne d'Arc Basin located offshore Newfoundland, eastern Canada. Model predictions were verified against pre‐existing data including the quantity and quality of discovered hydrocarbons in the basin. Modelling results showed that the Darcy method produced substantially different results compared to the other migration techniques and this was due to the high accumulation efficiency. The flowpath method, and a combination of flowpath and Darcy methods (referred to as the “hybrid” method) yielded similar results; furthermore, the hybrid method predicted the petroleum composition quite accurately. The invasion percolation method gave similar results to the hybrid approach, but little or no variation in API and GOR across the basin was predicted. The adsorption model initially applied did not adequately reproduce the natural behaviour of source rocks with respect to petroleum expulsion efficiency. Therefore a revised model was implemented in which the adsorption capacity was reduced with increasing maturity. This revised adsorption model led to more realistic volumes of hydrocarbons being retained within the source rock. The application of this approach had only a minor impact on the volume and quality of the petroleum present in the reservoir units.     

Network-aware service placement and selection algorithms on large-scale overlay networks

Currently many service providers offer their services on a private and proprietary hard- and software infrastructure. These infrastructures often share many similarities. Hence we believe a generic service management architecture, that allows service providers to offer a large array of different services on a single infrastructure or multiple providers to offer their services cooperatively, would provide many advantages over current silo-based approaches. Additionally, by allowing the distributed service management components to cooperate in a peer-to-peer overlay network, scalability and resilience of the system could be greatly improved.In this paper we propose an optimal algorithm, based on an integer linear programming (ILP) formulation, and several heuristics to support such a generic overlay-based service management architecture. More specifically, we propose algorithms for dynamically allocating server and network resources to a set of services and selecting a suitable service instance for each client. Service instances are placed on a set of servers, taking into account server resource constraints (e.g. CPU and memory). Unlike existing algorithms for this problem, those proposed in this paper also support service level agreements (SLAs), which take the form of Quality of Service demands such as transmission latency constraints and bandwidth requirements. The optimisation goal is to maximise the percentage of satisfied demand (answered requests) and minimise the total number of required overlay servers, while satisfying the SLAs and resource constraints. Additionally, we propose an extension that allows the algorithms to find overlay routing paths to improve the transmission latency for latency-sensitive services.Extensive simulations were performed to evaluate the performance and scalability of the heuristics. They showed that in many cases the heuristics perform close to optimal and they scale well in terms of network size.     

The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

The capacitated vehicle routing problem (CVRP) is a well known problem which has long been tackled by researchers for several decades now, not only because of its potential applications but also due to the fact that CVRP can be used to test the efficiency of new algorithms and optimization methods. The objective of our work is to present SR-GCWS, a hybrid algorithm that combines a CVRP classical heuristic with Monte Carlo simulation using state-of-the-art random number generators. The resulting algorithm is tested against some well-known benchmarks. In most cases, our approach is able to compete or even outperform much more complex algorithms, which is especially interesting if we consider that our algorithm does not require any previous parameter fine-tuning or set-up process. Moreover, our algorithm has been able to produce high-quality solutions almost in real-time for most tested instances. Another important feature of the algorithm worth mentioning is that it uses a randomized constructive heuristic, capable of generating hundreds or even thousands of alternative solutions with different properties. These alternative solutions, in turn, can be really useful for decision-makers in order to satisfy their utility functions, which are usually unknown by the modeler. The presented methodology may be a fine framework for the development of similar algorithms for other complex combinatorial problems in the routing arena as well as in some other research fields.     

A Comparison Between Machine Flexibility and Routing Flexibility

In this paper, we evaluate two types of flexibility, machine flexibility and routing flexibility, in terms of manufacturing performance in various shop environments. A simulation-based investigation was conducted to analyze the impact of these types of flexibility on the average flow time of parts under various job flow pattern conditions, which characterize the shop nature from a random job shop to a flow shop, operation time variance, setup time, and shop load. The experimental results show how these types of flexibility affect the average flow time of parts and which type is superior under what conditions. Management can obtain better insight and guidelines for determining priorities or the scale, or scope, of various decision items relating to design standardization, process and operations improvement, investment in new equipment and tools, and the like.     

路由信息的攻击对AODV协议性能的影响分析

AODV协议是移动自组网络中一种按需反应的表驱动路由协议。在移动自组网中，每个节点既是计算机又是路由器，容易遭受基于路由信息的网络攻击，而现今的路由协议基本没有考虑到该问题。本文在分析移动自组网中针对路由信息主要攻击方法的基础上，建立了主动性和自私性两个攻击模型，并且在AODV协议中扩充实现了这两类攻击行为。通过对模拟结果的分析和比较，讨论了路由信息的攻击对AODV协议性能的影响，并进一步探讨了针对基于路由信息攻击的防御措施。     

US GOSIP: The challenges ahead

This paper looks beyond the existing United States Government Open Systems Interconnection Profile (GOSIP) toward several important challenges to be met in the years ahead. The first challenge is creating effective, economical, and technically credible test policies and procedures for GOSIP. The second challenge is stimulating the strategic and tactical planning within Federal Agencies necessary to implement the provisions of GOSIP. The third challenge is adding functions to later versions of GOSIP to provide directory services, dynamic routing, security, transaction processing, and electronic data interchange. The fourth challenge is fostering and successfully pursuing international collaboration in functional standards, procurement profiles, and testing. Beyond these four challenges lies the next horizon - integrated, interoperable network management.     

Efficient routing for IP subnet VLAN over Ethernet

Existing IP routing algorithms have been developed mainly for non‐VLAN networks. For these routing algorithms to work, an end station must be attached to its associated network. The introduction of VLAN has, however, allowed the physical location of the end station to be changed from time to time. Therefore, some extra mechanism is required to support routing in VLAN environment. Existing approaches have some drawbacks in terms of inefficiency in traffic forwarding and switch software complexity. In this paper, a simple and efficient method for routing over IP subnet VLAN in Ethernet is proposed. This method has been implemented in hardware and found to work correctly. Various measurements and analyses have been performed to verify the efficiency of this protocol. Copyright © 2002 John Wiley & Sons, Ltd.     

弧形爆破在钟山铁矿的应用

为降低钟山铁矿采矿中的大块率，试验采用了弧形爆破方法，应用结果表明，不仅大块问题得到解决，开采成本也大大降低。     

在ATM网络中业务流分布的自适应路由优化控制

根据ＡＴＭ网络中所有信道上业务流的分布情况，采用业务流自适应的优化算法，动态地调整各节点的路由，达到防止拥塞，保证服务质量的目的。