Showing papers in "Journal of the Operational Research Society in 1987"
••
TL;DR: (1987).
Abstract: (1987). Discrete Choice Analysis: Theory and Application to Travel Demand. Journal of the Operational Research Society: Vol. 38, No. 4, pp. 370-371.
2,018 citations
••
TL;DR: In this paper, applied probability and queuing in the field of applied probabilistic analysis is discussed. But the authors focus on the application of queueing in the context of road traffic.
Abstract: (1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.
1,121 citations
••
451 citations
••
TL;DR: In this paper, a credibility measurement of distance function and a broader concept of the axiom of choice in order to reconcile disagreement among compromise solutions is introduced, and the credibility measurement is used to reconcile disagreements among compromise solution.
Abstract: The application of compromise solutions to discrete multi-objective problems brings about some technical flexibilities, such as the selection of distance function for computing both normalized attribute ratings and distances between two alternatives, and the choice between the ideal and negative-ideal alternatives for implementing the axiom of choice These flexibilities are undesirable, since the method may yield conflicting preference-alternative rankings, depending on parameter choice This paper introduces a credibility measurement of distance function and takes a broader concept of the axiom of choice in order to reconcile disagreement among compromise solutions
449 citations
••
TL;DR: It is proposed in the following article to examine in detail the writings of the author of Species in detail, and so by implication those of Mr. Darwin himself, rather than specially to criticise the Descent.
Abstract: crit' 6n^t^' ^10wever, Mr. Darwin would seem to have found a Mi 'VGt a^most said an adversary, worthy of him. Mr. for^th^ S ' ^?.nes*s Species ' can scarcely be praised too highly ie candid spirit in which it is written, and for the wide knowledge it displays. e propose in the following article to examine in detail the l^gurnents of its author, and so by implication those of Mr. ai'\\vin himself, rather than specially to criticise the ' Descent 0
445 citations
••
TL;DR: The heuristics presented in this paper are suitable for practical use, and behave in a manner which reflects the proven worst-case bounds for the two-dimensional open-ended bin-packing problem.
Abstract: Given a set of rectangular pieces, the two-dimensional bin-packing problem is to place the pieces into an open-ended bin of infinite height such that the height of the resulting packing is minimize...
355 citations
••
214 citations
••
TL;DR: Rule induction has been proposed as a way of speeding up the acquisition of knowledge for expert systems but can only deal with determinate data and extensions to deal with statistical data are explored.
Abstract: Rule induction has been proposed as a way of speeding up the acquisition of knowledge for expert systems. Quinlan's ID3 algorithm has been used successfully but can only deal with determinate data. This paper explores extensions to deal with statistical data.
172 citations
••
TL;DR: The p-median and p-centre problems are generalized by considering the possibility that one or more of the facilities may become inactive, and an heuristic procedure is presented for each problem.
Abstract: In this paper, the p-median and p-centre problems are generalized by considering the possibility that one or more of the facilities may become inactive. The unreliable p-median problem is defined by introducing the probability that a facility becomes inactive. The (p, q)-centre problem is defined when p facilities need to be located but up to q of them may become unavailable at the same time. An heuristic procedure is presented for each problem. A rigorous procedure is discussed for the (p, q)-centre problem. Computational results are presented.
167 citations
••
TL;DR: Results of some recent research into queueing models are applied to the hospital waiting-list problem to give some important insights into the likely implications of attempts to reduce waiting lists.
Abstract: Results of some recent research into queueing models are applied to the hospital waiting-list problem to give some important insights into the likely implications of attempts to reduce waiting lists.
153 citations
••
TL;DR: In this article, the authors examined the nature of information obtained from data envelopment analysis (DEA) in comparative studies of the efficiency of decision-making units, and discussed the interpretation and practical usefulness of such information.
Abstract: This paper examines the nature of information obtained from data envelopment analysis (DEA) in comparative studies of the efficiency of decision-making units, and it discusses the interpretation and practical usefulness of such information The themes developed in the paper are illustrated by an application of DEA to data on the rate-collection function of London Boroughs and Metropolitan District Councils The paper begins with an overview of DEA, followed by a discussion of some of the practical considerations arising in the application of DEA It then describes the structuring of the rate-collection function for assessment by DEA, and explores the extent to which units can be classified as relatively efficient or inefficient In respect of relatively inefficient units, it illustrates the construction of target inputs and outputs so that their relative efficiency may improve In respect of relatively efficient units, it is argued that their identification is weak in the sense that for some of them their apparent efficiency may be simply a reflection of an uncommon input-output profile It is shown, nevertheless, that information about relatively efficient units can be used to identify those of them which may prove examples of good operating practice in given aspects of their function (Readers not familiar with British taxes may wish to note that rates are a tax on property, levied by local authorities)
••
TL;DR: In this paper, a heuristic is developed to determine the decision rule for selecting the times and sizes of replenishments over a finite time-horizon so as to keep the total costs minimum.
Abstract: We discuss the inventory replenishment policy for an item having a deterministic demand pattern with a linear (positive) trend and shortages. A heuristic is developed to determine the decision rule for selecting the times and sizes of replenishments over a finite time-horizon so as to keep the total costs minimum. The use of the heuristic is illustrated with a numerical example.
••
TL;DR: It is concluded that this type of efficiency analysis does have value for the Air Force, where it can serve as a guide to auditors, budget programmers, managers and others in measuring, evaluating and enhancing operational efficiency.
Abstract: The objective of this research is to evaluate a new methodology, data envelopment analysis (DEA), as a tool for measuring and evaluating the operational efficiency of US Air Force organizations. This study involves the application of DEA to locate possible inefficiencies in the performance of US Air Force real-property maintenance activities. Dynamic behaviour, as exhibited via window analyses, is reviewed along with static counterparts. The testing was done in close coordination with Air Force officials, who reviewed the results for accuracy, validity and relevance. We conclude that this type of efficiency analysis does have value for the Air Force, where it can serve as a guide to auditors, budget programmers, managers and others in measuring, evaluating and enhancing operational efficiency.
••
TL;DR: In this article, the authors examined the use of market-valuation models in analysing stochastic inventory problems and compared the resulting optimal policy with the classical expected benefit maximization framework.
Abstract: This paper examines the use of market-valuation models in analysing stochastic inventory problems. As an example, the one-period newsboy problem is treated using the capital asset pricing model (CAPM). It is pointed out that, unlike other working-capital decisions, the use of CAPM to analyse inventory problems need not imply conflicting assumptions. The resulting optimal policy is characterized and is compared with the classical expected benefit maximization framework. It is shown that when the relevant risk of the inventory investment is considered, results are dramatically different.
••
TL;DR: In this paper, the problem of determining the economic order quantity under conditions of permissible delay has been analyzed under the assumption of the classical economic order model, obtaining different results under different assumptions.
Abstract: The problem of determining the economic order quantity under conditions of permissible delay has been recently analysed. This note analyses the same problem under assumptions of the ‘classical’ economic order quantity model, obtaining different results.
••
TL;DR: In this article, the authors examined the interactions between the demand forecasting and reordering subsystems in inventory management and used simulation to study the average discrepancy between a desired customer service level and that actually achieved.
Abstract: This paper examines the interactions between the demand forecasting and reordering subsystems in inventory management. Simulation is used to study the average discrepancy between a desired customer service level and that actually achieved, and the increase in average annual inventory cost resulting from fluctuations in the forecast demand parameters of several lumpy demand patterns.
••
TL;DR: In this paper, a forecasting procedure is presented, to be used in conjunction with a base-stock (order-up-to) inventory control policy under periodic review, to determine the size and timing of replenishment orders.
Abstract: A sporadic or lumpy demand pattern is characterized by large transactions separated by periods of zero demand. Such demand patterns occur frequently for items in parts and supplies inventory systems. A forecasting procedure is presented, to be used in conjunction with a base-stock (order-up-to) inventory-control policy under periodic review. The procedure determines the size and timing of replenishment orders. Although a base-stock policy calls for a replenishment order after each transaction, it is shown that a delay in placing the order can result in significant holding-cost reductions with little additional risk or cost of stockouts.
••
TL;DR: In this paper, the traditional method of estimating mean activity-time in PERT analysis, as a weighted average of the pessimistic, most likely and optimistic activity-times, is examined.
Abstract: The traditional method of estimating mean activity-time in PERT analysis, as a weighted average of the pessimistic, most likely and optimistic activity-times, is examined. Based on properties of the beta distribution, it is shown that there are theoretical grounds for using this estimate for a specified range of modal activity times. Finally, a simple refinement of the estimate is suggested when the modal value lies outside this range.
••
TL;DR: This book should be of interest to statisticians; students of statistics; computer scientists.
Abstract: (1987). Regression Analysis with Applications. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1091-1092.
••
TL;DR: In this paper, the ID3 algorithm was extended to deal with statistical data, and an experimental comparison with multiple regression was conducted with a set of multiple regressions. But the results showed that ID3 was not suitable for rule induction in the case of determinate data.
Abstract: Rule induction is a method of automatically developing rules from sets of examples. Quinlan's ID3 algorithm, which was developed for determinate data, has been extended to deal with statistical data. This paper reports on an experimental comparison with multiple regression.
••
TL;DR: A solution routine, based on iterative improvement of an initial solution, has been developed for vehicle-scheduling problems and tries to reduce the overall distance travelled by moving customers in a systematic way.
Abstract: A solution routine, based on iterative improvement of an initial solution, has been developed for vehicle-scheduling problems. The improving routine combines a number of very simple procedures, each of which tries to reduce the overall distance travelled by moving customers in a systematic way. Tests were run using standard problems, and results obtained were of good quality. An application of the procedure is described briefly.
••
TL;DR: A microcomputer-based simulation model was developed to aid in the planning of future berth requirements at a third-world port, and some of the complications of the ship-to-berth allocation rules are described.
Abstract: A microcomputer-based simulation model is described which was developed to aid in the planning of future berth requirements at a third-world port. The port handles a variety of incoming and outgoing cargoes, using a mixture of specialized and general berths. Some of the complications of the ship-to-berth allocation rules are described, and how they were modelled. The help that the model provided to the consultants is briefly outlined.
••
TL;DR: A model is developed for the reliability of a single component, subject to one type of inspectable defect, which will subsequently lead to a failure, which is readily extended to the case of a component with multiple and independent defects.
Abstract: A model is developed for the reliability of a single component, subject to one type of inspectable defect, which will subsequently lead to a failure. Inspections are assumed perfect. The model utilizes the notion of delay time to establish the reliability consequences of inspecting on different inspection periods. The argument is readily extended to the case of a component with multiple and independent defects. Numerical examples are provided.
••
TL;DR: A heuristic method, incorporating an annealing algorithm, is developed to help the organizers timetable similar conferences in the future.
Abstract: Participants at a conference held in 1985 were asked to select seminars that they wished to attend, before the schedule of seminars was constructed The conference organizers were then faced with the problem of finding a timetable that would allow participants to attend the seminars they had chosen This interesting combinatorial optimization problem is investigated here A heuristic method, incorporating an annealing algorithm, is developed to help the organizers timetable similar conferences in the future
••
TL;DR: The process of developing a hierarchical structure of the attributes of the problem of choosing a suitable mode of transport for radioactive waste, and several important questions about the structuring process are formulated.
Abstract: The first stage in a multi-attribute value analysis is the development of a hierarchical structure of the attributes of the problem. This paper reports the process of developing such a structure for the problem of choosing a suitable mode of transport for radioactive waste. The initial hierarchy of attributes went through several stages of development as new insights emerged about the nature of the problem. Some of the reasons behind this restructuring are discussed, and several important questions about the structuring process are formulated.
••
TL;DR: It's important for you to start having that hobby that will lead you to join in better concept of life and reading will be a positive activity to do every time.
Abstract: expert systems for business What to say and what to do when mostly your friends love reading? Are you the one that don't have such hobby? So, it's important for you to start having that hobby. You know, reading is not the force. We're sure that reading will lead you to join in better concept of life. Reading will be a positive activity to do every time. And do you know our friends become fans of expert systems for business as the best book to read? Yeah, it's neither an obligation nor order. It is the referred book that will not make you feel disappointed.
••
TL;DR: An approximation formula for chance constraints is presented which can be used in either the single- or multiple-objective case, and will place a bound on the chance constraint at least as tight as the true non-linear form, thus overachieving the chance constraints at the expense of other constraints or objectives.
Abstract: Decision environments involve the need to solve problems with varying degrees of uncertainty as well as multiple, potentially conflicting objectives. Chance constraints consider the uncertainty encountered. Codes incorporating chance constraints into a mathematical programming model are not available on a widespread basis owing to the non-linear form of the chance constraints. Therefore, accurate linear approximations would be useful to analyse this class of problems with efficient linear codes. This paper presents an approximation formula for chance constraints which can be used in either the single- or multiple-objective case. The approximation presented will place a bound on the chance constraint at least as tight as the true non-linear form, thus overachieving the chance constraint at the expense of other constraints or objectives.
••
••
TL;DR: In this paper, a linear programming model to find the optimal "CON due-date" is considered for n independent jobs to be processed on a single machine, where the measure of performance considered is a more generalized version of similar problems studied earlier.
Abstract: A linear-programming model to find the optimal ‘CON due-date’ is considered for n independent jobs to be processed on a single machine. The term ‘CON due-date’ stands for constant-allowance due-date, where each job receives exactly the same due-date. The measure of performance considered is a more generalized version of similar problems studied earlier. Duality theory is used to obtain an optimal solution. Some earlier studies are shown to be special cases of the model studied in this paper. Numerical examples are presented for better understanding.
••
TL;DR: A new transformation of generalized into standard travelling-salesman problem is presented, which makes it possible to solve symmetric problems with a relatively large number of specified nodes, which cannot be solved by previously published algorithms based on a linear assignment relaxation.
Abstract: We discuss generalized travelling-salesman problems where nodes are visited either once or not, and a penalty cost is incurred for each unvisited node. The generalization includes the longest-path problem and the shortest-path problem with specified nodes to be visited. A new transformation of generalized into standard travelling-salesman problem is presented. We give computational results for the shortest-path problem with specified nodes. The transformation makes it possible to solve symmetric problems with a relatively large number of specified nodes, which cannot be solved by previously published algorithms based on a linear assignment relaxation. Furthermore, we show how to obtain improved lower bounds for a special Euclidean-type variant.