一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

Concurrent reading while writing revisited

A modification is proposed to Peterson's construction of 1-writern-reader multivalued atomic shared variableusingn+2 multivalued safe variables and some boolean atomic variables. The resulting construction is elegant and is simpler than the original one. K. Vidyasankar received B.E. (Elec. Engg.) from Thiagarajar College of Engineering, Madurai, M. Tech. from I.I.T. Kanpur, India, and Ph.D. in Computer Science from University of Waterloo, Canada. He is now an Associate Professor in Computer Science at Memorial University of Newfoundland, Canada. His research interests include concurrency control and recovery in database systems, concurrency in interprocess communication, design and analysis of algorithms, and graph theory.A prelininary version of this paper, under the title Improving Peterson's Construction of 1-Writern-Reader Multivalued Atomic Register, appears in the Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois at Urbana Champaign, September 1988, pp 693–700     

Supervisory control of modular systems with global specification languages

The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synthesized for each module separately and the supervisory control consists of the parallel composition of the modular supervisory controls. The general case of the specification that is indecomposable and not necessarily contained in the plant language, which is often the case in practice, is considered. The usual assumption that all shared events are controllable is relaxed by introducing two new structural conditions relying on the global mutual controllability condition. The novel concept used as a sufficient structural condition is strong global mutual controllability. The main result uses a weaker condition called global mutual controllability together with local consistency of the specification. An example illustrates the approach.     

Development of a sequential robust–tolerance design model for a destructive quality characteristic

Robust design (RD) and tolerance design (TD) have received much attention from researchers and practitioners for more than two decades, and a number of methodologies for modeling and optimizing the RD and TD processes have been studied. However, there is ample room for improvement. Because most existing research considers RD and TD as separate research fields, the primary objective of this paper is to develop a sequential robust–tolerance design method to jointly determine the best factor settings and the closed-form solutions for the optimal specification limits. We then apply the proposed method to a destructive quality characteristic. Finally, a case study and sensitivity analyses are performed for verification purposes, and further studies are discussed.     

Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

The problem of transporting patients or elderly people has been widely studied in literature and is usually modeled as a dial-a-ride problem (DARP). In this paper we analyze the corresponding problem arising in the daily operation of the Austrian Red Cross. This nongovernmental organization is the largest organization performing patient transportation in Austria. The aim is to design vehicle routes to serve partially dynamic transportation requests using a fixed vehicle fleet. Each request requires transportation from a patient's home location to a hospital (outbound request) or back home from the hospital (inbound request). Some of these requests are known in advance. Some requests are dynamic in the sense that they appear during the day without any prior information. Finally, some inbound requests are stochastic. More precisely, with a certain probability each outbound request causes a corresponding inbound request on the same day. Some stochastic information about these return transports is available from historical data. The purpose of this study is to investigate, whether using this information in designing the routes has a significant positive effect on the solution quality. The problem is modeled as a dynamic stochastic dial-a-ride problem with expected return transports. We propose four different modifications of metaheuristic solution approaches for this problem. In detail, we test dynamic versions of variable neighborhood search (VNS) and stochastic VNS (S-VNS) as well as modified versions of the multiple plan approach (MPA) and the multiple scenario approach (MSA). Tests are performed using 12 sets of test instances based on a real road network. Various demand scenarios are generated based on the available real data. Results show that using the stochastic information on return transports leads to average improvements of around 15%. Moreover, improvements of up to 41% can be achieved for some test instances.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

Primal or dual: which promises faster spatiotemporal search?

The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gained considerable empirical knowledge about various access methods, currently there is only limited understanding on the theoretical characteristics of the two methodologies. In fact, the experimental results in different papers even contradict each other, regarding the relative superiority of the primal and dual techniques. This paper presents a careful study on the query performance of general primal and dual indexes, and reveals important insight into the behavior of each technique. In particular, we mathematically establish the conditions that determine the superiority of each methodology, and provide rigorous justification for well-known observations that have not been properly explained in the literature. Our analytical findings also resolve the contradiction in the experiments of previous work.     

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.     

A distributed control scheme for multiple robotic vehicles to make group formations

This paper presents a novel distributed control scheme of multiple robotic vehicles. Each robotic vehicle in this scheme has its own coordinate system, and it senses its relative position and orientation to others, in order to make group formations. Although there exists no supervisor and each robotic vehicle has only relative position feedback from the others in the local area around itself, all the robotic vehicles are stabilized, which we have succeeded in proving mathematically only in the cases where the attractions between the robots are symmetrical. Each robotic vehicle especially has a two-dimensional control input referred to as a “formation vector” and the formation is controllable by the vectors. The validity of this scheme is supported by computer simulations.