Search results for " operations"
showing 10 items of 1066 documents
Fuzzy expected utility
1984
Decision making under uncertainty requires not only measures of the uncertainty of situations that we try to recognize , but also an estimate of the imprecision from which they are determined. This imprecision can be the result either of a lack of exactness in the measure of the elements which are necessary to the determination of the states of nature or the purely subjective interpretation of these states. Through a subjective measure of the non-measurable imprecision, the purpose of the fuzzy expected utility, which is investigated, is to translate with a great accuracy the imprecise behaviour of the decision-maker in an uncertain world. Consequently we propose to introduce first the prob…
The fuzzy p-median problem
2004
In many location models, the strong crisp assumptions, like known demands and distances, are not realistic in most cases. The fuzzy p-median problem relaxes this hypothesis giving to the decision maker a necessary degree of freedom to solve real-world problems. It allows a decision maker to improve an optimal covering of a location problem by considering partially feasible solutions in which some demand is left uncovered. Here we revise the main facts and results about this problem emphasising different specific algorithms of resolution. Finally we show that this fuzzy version can be used to analyse the global structure of a given instance of the crisp problem.
Soft-computing based heuristics for location on networks: The p-median problem
2011
We propose a genetic algorithm for the fuzzy p-median problem in which the optimal transport cost of the associated crisp problem is unknown. Our algorithm works with two populations: in one, the solutions with a better crisp transport cost are favored by the selection criterion, whereas in the second one, solutions with a better fuzzy satisfaction level are preferred. These populations are not independent. On the contrary, the first one periodically invades the second one, thus providing new starting points for finding fuzzy improvements. Our computational results also reveal the importance of choosing adequate functions for selecting the parents. Our best results are obtained with functio…
Involving fuzzy orders for multi-objective linear programming
2012
This paper presents a solution approach for multi-objective linear programming problem. We propose to involve fuzzy order relations to describe the objective functions where in ”classical” fuzzy approach the membership functions which illustrate how far the concrete point is from the solution of individual problem are studied. Further the global fuzzy order relation is constructed by aggregating the individual fuzzy order relations. Thus the global fuzzy relation contains the information about all objective functions and in the last step we find a maximum in the set of constrains with respect to the global fuzzy order relation. We illustrate this approach by an example.
Controller Design Under Fuzzy Pole-Placement Specifications: An Interval Arithmetic Approach
2006
This paper discusses fuzzy specifications for robust controller design, as a way to define different specification levels for different plants in a family and allow the control of performance degradation. Controller synthesis will be understood as mapping a fuzzy plant onto a desired fuzzy set of closed-loop specifications. In this context, a fuzzy plant is considered as a possibility distribution on a given plant space. In particular, pole placement in linear plants with fuzzy parametric uncertainty is discussed, although the basic idea is general and could be applied to other settings. In the case under consideration, the controller coefficients are the solution of a fuzzy linear system o…
Reactive GRASP for the strip-packing problem
2008
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite height so as to minimize the required height. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
2013
The three-dimensional multiple bin-size bin packing problem, MBSBPP, is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of bins used for packing the boxes. First we propose a GRASP algorithm, including a constructive procedure, a postprocessing phase and some improvement moves. The best solutions obtained are then combined into a Path Relinking procedure for which we have developed three versions: static, dynamic and evolutionary. An extensive computational study, using two- and three-dimensional instances, shows the relative efficiency of the alternatives considere…
A cutting plane algorithm for the capacitated arc routing problem
2003
The Capacitated Arc Routing Problem (CARP) consists of finding a set of minimum cost routes that service all the positive-demand edges of a given graph, subject to capacity restrictions.In this paper, we introduce some new valid inequalities for the CARP. We have designed and implemented a cutting plane algorithm for this problem based on these new inequalities and some other which were already known. Several identification algorithms have been developed for all these valid inequalities. This cutting plane algorithm has been applied to three sets of instances taken from the literature as well as to a new set of instances with real data, and the resulting lower bound was optimal in 47 out of…
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
2021
Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…
Heuristics for the Mixed Rural Postman Problem
2000
Abstract The Rural Postman Problem on a mixed graph (MRPP) consists of finding a minimum cost tour which traverses, at least once, the arcs and edges of a given subset of the arcs and edges of the graph. This problem is known to be NP-hard. This paper presents two heuristic approaches to solve it. An approximate algorithm based on the resolution of some flow and matching problems and a tabu search implementation is presented. The tabu search algorithm seeks high-quality tours by means of a switching mechanism in an intensification phase and two levels of diversification. Computational results are presented to assess the merits of the method. Scope and purpose Routing Problems arise in sever…