Search results for "Operation"
showing 10 items of 2969 documents
The Rural Postman Problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…
Necessary conditions for extremality and separation theorems with applications to multiobjective optimization
1998
The aim of this paper is to give necessary conditions for extremality in terms of an abstract subdifferential and to obtain general separation theorems including both finite and infinite classical separation theorems. This approach, which is mainly based on Ekeland's variational principle and the concept of locally weak-star compact cones, can be considered as a generalization f the notions of optima in problems of scalar or vector optimization with and without constraints. The results obtained are applied to derive new necessary optimality conditions for Pareto local minimum and weak Pareto minimum of nonsmooth multlobjectivep rogramming problems.
Decision-aid for discrete multiple criteria decision making problems with imprecise data
1999
Abstract We describe ways of aiding decision making with a discrete set of alternatives. In many decision situations, it is not possible to obtain explicit preference information from the decision makers. Instead, useful decision-aid can be provided to the decision makers by describing what kind of weighting of the criteria result in certain choices of the alternatives. The suggested treatment is based on the basic ideas of the ELECTRE III method. The modelling of the preferences by pseudo-criteria is especially helpful in case the data, that is, the criterion values are imprecise. Unlike ELECTRE III, no ranking of the alternatives is produced. Based on a minimum-procedure in the exploitati…
Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem
2017
The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understand…
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
2012
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…
Efecto Bullwhip y restricciones de capacidad productiva en las cadenas colaborativas
2008
El objetivo del presente artículo es profundizar en el análisis de Evans y Naim (1) sobre la relación entre la capacidad de limitada producción y el efecto bullwhip, y actualizarlo en función de las recientes configuraciones de cadenas de suministro colaborativas. Se analizan tres cadenas de suministro con capacidad de producción limitada: la misma cadena de suministro tradicional estudiada por Evans y Naim (1), una cadena EPOS (Exchange Point of Sales) y una cadena sincronizada. Se adopta un sistema de métricas para evaluar los beneficios de los nodos de la cadena medidos en términos de estabilidad de la orden de pedido, estabilidad de los inventarios, y robustez del sistema, y en términos…
Designing portfolios of financial products via integrated simulation and optimization models
1999
We analyze the problem of debt issuance through the sale of innovative financial products. The problem is broken down to questions of designing the financial products, specifying the debt structure with the amount issued in each product, and determining an optimal level of financial leverage. We formulate a hierarchical optimization model to integrate these three issues and provide constructive answers. Input data for the models are obtained from Monte Carlo simulation procedures that generate scenarios of holding period returns of the designed products. The hierarchical optimization model is specialized for the problem of issuing a portfolio of callable bonds to fund mortgage assets. The …
A GRASP ALGORITHM FOR THE CONTAINER LOADING PROBLEM WITH MULTI-DROP CONSTRAINTS
2015
This paper studies a variant of the container loading problem in which to the classical geometric constraints of packing problems we add other conditions appearing in practical problems, the multi-drop constraints. When adding multi-drop constraints, we demand that the relevant boxes must be available, without rearranging others, when each drop-off point is reached. We present first a review of the different types of multi-drop constraints that appear in literature. Then we propose a GRASP algorithm that solves the different types of multi-drop constraints and also includes other types of realistic constraints such as full support of the boxes and load bearing strength. The computational re…
Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
2018
As an emerging research field, multiobjective robust optimization employs minmax robustness as the most commonly used concept. Light robustness is a concept in which a parameter, tolerable degradations, can be used to control the loss in the objective function values in the most typical scenario for gaining in robustness. In this paper, we develop a lightly robust interactive multiobjective optimization method, LiRoMo, to support a decision maker to find a most preferred lightly robust efficient solution with a good balance between robustness and the objective function values in the most typical scenario. In LiRoMo, we formulate a lightly robust subproblem utilizing an achievement scalarizi…
Resource-constrained project scheduling: A critical activity reordering heuristic
2003
Abstract In this paper, we present a new metaheuristic algorithm for the resource-constrained project-scheduling problem. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework. The procedure makes use of a fan search strategy to intensify the search, whereas a strategic oscillation mechanism loosely related to the forward/backward technique provides the necessary diversification. Our implementation employs the topological order (TO) representation of schedules. To explore the TO vector space we introduce three types of moves, two of them based on the concept of relative critic…