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

TL;DR: This article introduced a theoretical framework that describes the importance of affect in guiding judgments and decisions and argued that reliance on such feelings can be characterized as "the affect heuristic" and discussed some of the important practical implications resulting from ways that this heuristic impacts our daily lives.

TL;DR: A steady-state EMOA is proposed that features a selection operator based on the hypervolume measure combined with the concept of non-dominated sorting, thereby focussing on interesting regions of the Pareto front.

TL;DR: In this paper, a literature overview on typical decision problems in design and control of manual order-picking processes is given, focusing on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning.

TL;DR: An improved typology of C&P problems is presented, which is partially based on Dyckhoff’s original ideas, but introduces new categorisation criteria, which define problem categories different from those of Dykhoff.

TL;DR: The VIKOR method as mentioned in this paper was developed to solve MCDM problems with conflicting and noncommensurable (different units) criteria, assuming that compromising is acceptable for conflict resolution, the decision maker wants a solution that is the closest to the ideal, and the alternatives are evaluated according to all established criteria.

TL;DR: A comprehensive review of the work done, during the 1968-2005, in the application of statistical and intelligent techniques to solve the bankruptcy prediction problem faced by banks and firms is presented.

TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.

TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.

TL;DR: The purpose is to provide a bridge between academic researchers and warehouse practitioners, explaining what planning models and methods are currently available for warehouse operations, and what are the future research opportunities.

TL;DR: To ease communication between researchers and practitioners, a classification scheme of assembly line balancing is provided, which is a valuable step in identifying remaining research challenges which might contribute to closing the gap.

TL;DR: The proposed model is a mixed integer multi-commodity network flow model that treats vehicles as integer commodity flows rather than binary variables that results in a more compact formulation whose output is processed to extract a detailed vehicle route and load instruction sheet.

TL;DR: This paper presents some of the most important QAP formulations and classify them according to their mathematical sources and gives a detailed discussion of the progress made in both exact and heuristic solution methods, including those formulated according to metaheuristic strategies.

TL;DR: A series of new score functions are defined for multi-criteria decision-making problem based on the intuitionistic fuzzy point operators and the evaluation function and their effectiveness and advantage are illustrated by examples.

TL;DR: A branch and bound algorithm which includes implication rules enabling to speed up the computation of a train scheduling problem faced by railway infrastructure managers during real-time traffic control is developed.

TL;DR: A fuzzy ranking method is used to rank the fuzzy objective values and to deal with the inequality relation on constraints in linear programming problems where all the coefficients are, in general, fuzzy numbers.

TL;DR: A heuristic rule called the smallest position value (SPV) borrowed from the random key representation of Bean was developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems.

TL;DR: In this article, a generic hyper-heuristic approach based on a set of widely used graph coloring heuristics is proposed for timetabling problems, where a Tabu Search approach is employed to search for permutations of graph heuristic which are used for constructing timetables.

TL;DR: A generalized model for the design of a generic reverse logistics network where capacity limits, multi-product management and uncertainty on product demands and returns are considered is proposed.

TL;DR: This paper presents two alternative approaches to second stage DEA, the results of which are compared with the tobit approach through a case study for the Danish fishery, and it is shown that OLS may actually in many cases replace tobit as a sufficientsecond stage DEA model.

TL;DR: A limited survey of what appear to be the most useful of the variations of the assignment problem that have appeared in the literature over the past 50 years and what they are called so as to make it easier for a researcher trying to develop some variation of the assignments problem for a particular application to find the relevant literature.

TL;DR: This paper provides a review of coordination mechanisms of supply chain systems in a framework that is based on supply chain decision structure and nature of demand, and highlights the behavioral aspects and information need in the coordination of a supply chain.

TL;DR: It is found that the environmental performance of OECD countries as a whole has been improved from 1995 to 1997 and a non-radial Malmquist environmental performance index for modeling the change of environmental performance over time is presented.

TL;DR: Consumer credit risk assessment involves the use of risk assessment tools to manage a borrower’s account from the time of pre-screening a potential application through to the management of the account during its life and possible write-off.

TL;DR: This survey examines the p-median problem, with the aim of providing an overview on advances in solving it using recent procedures based on metaheuristic rules.

TL;DR: This paper presents a stochastic model of the multi-stage global supply chain network problem, incorporating a set of related risks, namely, supply, demand, exchange, and disruption, and provides a new solution methodology using the Moreau–Yosida regularization.

TL;DR: In this article, the authors provide an overview of the recently proposed rule extraction techniques for SVMs and introduce two others taken from the artificial neural networks domain, being Trepan and G-REX.

TL;DR: This paper presents some IOWA operators to aggregate fuzzy preference relations in group decision-making (GDM) problems, and provides a procedure to deal with ‘ties’ in respect to the ordering induced by the application of one of these operators.

TL;DR: The hybrid NM-PSO algorithm based on the Nelder–Mead (NM) simplex search method and particle swarm optimization (PSO) for unconstrained optimization is proposed to demonstrate how the standard particle swarm optimizers can be improved by incorporating a hybridization strategy.

TL;DR: A heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming is proposed, which indicates the validity of the technique to MDVRPI.

TL;DR: Several hierarchical and non-hierarchical clustering techniques are integrated in a sequential heuristic algorithm for the location routing problem, which appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).