Timetabling County Cricket Fixtures Using a Form of Tabu Search

This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.     

An Experimental Evaluation of Interactive MCDM Methods and the Decision Making Process

Increasingly, it is becoming recognized that interactive solution methods should provide not only a solution to a multiple criteria decision making (MCDM) problem, but also the opportunity for decision makers to learn about their own preferences. In this paper, we describe an experiment that examines three MCDM solution methods and the process of converging on a final solution. Twenty-four management students participated in the experiment and were required to solve two completely different MCDM problems. Within this experimental framework, we examined the use of a two-stage approach to decision making. Both quantitative and qualitative results are presented. Preferences among the different solution methods vary significantly. Several conclusions are drawn concerning the desirable features of interactive MCDM solution methods.     

A Repeated Matching Heuristic for the Vehicle Routeing Problem

A new heuristic for the vehicle routeing problem which makes use of repeated matching is described. The numerical results are comparable to or better than the best published for most of the 14 benchmark problems commonly used to evaluate VRP heuristics.     

A Practical Solution to a Cargo Loading Problem at Bethlehem Steel

The optimum assignment of structural steel shapes to rail cars is an important logistical problem in the steel industry. In this paper, we discuss an application at Bethlehem Steel that not only involves weight and dimensional constraints, but also customer unloading constraints. The formulation is a generalized bin packing problem which is solved by modifying and extending the first fit decreasing algorithm. The solution algorithm, SOLID (for Structural Optimal Loading IDentification), has been used extensively for one of Bethlehem's high tonnage customers providing very good practical (implementable) results that achieve the desired goals. Bethlehem has enhanced this approach for use with other customers.     

Composition of the Canadian Total Force: Issues and Findings for the Air Components

In 1987 the Canadian Department of National Defence enunciated the Total Force concept. The Total Force is comprised of Regular and Reserve components. The intention is to make maximum use of the Reserve to reduce defence expenditures and at the same time to ensure that military capability remains adequate to support national policy objectives. This paper discusses some of the governing parameters that affect the modelling of the composition of the Total Force and analyses the mix of regular and reserve forces. The interplay between the key factors and their marginal costs will be stressed. The models are employed to study two units in the Canadian Forces, a maintenance support unit and a tactical unit with high operational activity cost. The lessons drawn from these studies are highlighted.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

The Nature of Community OR

This paper outlines the results of a study undertaken to investigate the nature of Community Operational Research (COR). The objective was to contact the people involved in COR through a series of personal interviews and a questionnaire survey, in order to clarify many of the issues that have emerged within the profession relating to the practice of OR within the community and voluntary sector. A total of 20 individuals were successfully contacted, and they have been responsible for at least two-thirds of the projects in the COR area.     

A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

Some Experiences with the Teaching of Decision Support Systems to Management Students

There are essentially two schools of thought regarding the function of decision support systems. One is that the main purpose is to support the decision-maker in whatever style of decision-making he or she wishes. The other is that the support, while suiting the decision-maker's individual style, must also be based on an appropriate theoretical paradigm. The work with students of decision support systems reported here suggests that the latter, normative, view is not one which comes naturally to many of the students, even when working on an example where it seemed relatively easy to incorporate. Other conclusions are also presented, relating to the choice of software for decision support system development, the process of teaching about decision support systems, and group formation.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.