Showing papers in "European Journal of Operational Research in 2001"

TL;DR: This paper addresses the "super-efficiency" issue of Data Envelopment Analysis by using the slacks-based measure (SBM) of efficiency, which the author proposed in his previous paper [European Journal of Operational Research 130 (2001) 498].

TL;DR: In this article, a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS), is presented, which can easily be implemented using any local search algorithm as a subroutine.

TL;DR: The original rough set approach proved to be very useful in dealing with inconsistency problems following from information granulation, but is failing when preference-orders of attribute domains (criteria) are to be taken into account and it cannot handle inconsistencies following from violation of the dominance principle.

TL;DR: The purpose of this paper is to highlight some of the pitfalls that have been identified in application papers under each of these headings and to suggest protocols to avoid the pitfalls and guide the application of the methodology.

TL;DR: The motivations, extensions and generalizations of various models in each sub-class have been discussed in brief to bring out pertinent information regarding model developments in the last decade.

TL;DR: A generalised and extended decision matrix is constructed and rule and utility based techniques are developed for transforming various types of information within the matrix for aggregating attributes via ER that are equivalent with regard to underlying utility and rational in terms of preserving the features of original assessments.

TL;DR: Various approaches for treating undesirable outputs in the framework of Data Envelopment Analysis (DEA) are discussed and the resulting efficient frontiers are compared.

TL;DR: This study compares the hybrid algorithms in terms of solution quality and computation time on a number of packing problems of different size and shows the effectiveness of the design of the different algorithms.

TL;DR: This article aims at the systematic derivation of ecologically extended DEA models by incorporating a multi-dimensional value function f .

TL;DR: A multiplicative decision model based on fuzzy majority is presented to choose the best alternatives, and several transformation functions are obtained to relate preference orderings and utility functions with multiplicative preference relations.

TL;DR: The results obtained indicate that the TLRN is capable of predicting speed up to 5 minutes into the future with a high degree of accuracy, which represents substantial improvements on conventional model performance and clearly demonstrate the feasibility of using the object-oriented approach for short-term traffic prediction.

TL;DR: A panorama of preference disaggregation methods is presented and the most important results and applications over the last 20 years are summarized.

TL;DR: The suggested “adaptive” approach allows policymakers to cope with the uncertainties that confront them by creating policies that respond to changes over time and that make explicit provision for learning.

TL;DR: To overcome the difficulties that DEA encounters when there is an excessive number of inputs or outputs, principal component analysis (PCA) is employed to aggregate certain, clustered data, whilst ensuring very similar results to those achieved under the original DEA model.

TL;DR: An efficient heuristic solution procedure that utilizes the solution generated from a Lagrangian relaxation of the problem is presented and results of extensive tests indicate that the solution method is both efficient and effective.

TL;DR: It is shown in several examples that although the optimal schedule may be very different from that of the classical version of the problem, and the computational effort becomes significantly greater, polynomial-time solutions still exist.

TL;DR: It is found that for 482 US firms in 1992, pollution prevention and end-of-pipe efficiencies are both negatively related to ROS, and that this negative relationship is larger and more significant for pollution prevention efficiencies.

TL;DR: A heuristic solution algorithm is developed that applies successive linear programming based on the reformulation and the relaxation of the original problem to produce feasible solutions with very small gaps between the solutions and their upper bound.

TL;DR: A comparative analysis of the production processes and production management problems for the SM–CC–HR and the traditional cold charge process is given and planning and scheduling systems developed and methods used for SM– CC–HR production are reviewed.

TL;DR: A way of mapping workflow into Petri nets, which can be used as a basis for such systems as well as an agreed and standard modelling technique.

TL;DR: This is the first experiment where the subjects created the alternatives and attributes themselves and suggests that the resulting weights are different because the methods explicitly or implicitly lead the decision makers to choose their responses from a limited set of numbers.

TL;DR: The role of vertical co-op advertising efficiency with respect to transactions between a manufacturer and a retailer through brand name investments, local advertising expenditures, and sharing rules of advertising expenses is explored.

TL;DR: A heuristic procedure based on the genetic algorithm for determining a dynamic berth assignment to ships in the public berth system is developed and it is shown that the proposed algorithm is adaptable to real world applications.

TL;DR: An algorithm is presented that can find shortest order picking tours in this type of warehouses and it appears that in many cases the average order picking time can be decreased significantly by adding a middle aisle to the layout.

TL;DR: A hybrid genetic algorithm for the container loading problem with boxes of different sizes and a single container for loading that uses specific genetic operators based on an integrated greedy heuristic to generate offspring.

TL;DR: An overview of the research, models and literature about optimisation approaches to the problem of optimally locating one or more new facilities in an environment where competing facilities are already established is given.

TL;DR: A model to study and analyze the benefit of coordinating supply chain inventories through the use of common replenishment epochs or time periods for a one-vendor, multi-buyer supply chain for a single product is proposed.

TL;DR: In this article, the authors investigated the criteria for a β-reduct within variable precision rough sets (VPRS) and suggested an additional condition for finding βreducts which assures a more general level knowledge equivalent to that of the full set of attributes.

TL;DR: A combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve is introduced, and a mixed integer programming formulation of the problem is presented to strengthen its LP relaxation.

TL;DR: A justification of two qualitative counterparts of the expected utility criterion for decision under uncertainty, which only require bounded, linearly ordered, valuation sets for expressing uncertainty and preferences, and proposes an operationally testable description of possibility theory.