Models and algorithms for the capacitated location-routing problem

Le problème de localisation-routage avec capacités (PLRC) apparaît comme un problème clé dans la conception de réseaux de distribution de marchandises. Il généralisele problème de localisation avec capacités (PLC) ainsi que le problème de tournées de véhicules à multiples dépôts (PTVMD), le premier en ajoutant des décisions liées au routage et le deuxième en ajoutant des décisions liées à la localisation des dépôts. Dans cette thèse on dévelope des outils pour résoudre le PLRC à l’aide de la programmation mathématique. Dans le chapitre 3, on introduit trois nouveaux modèles pour le PLRC basés sur des flots de véhicules et des flots de commodités, et on montre comment ceux-ci dominent, en termes de la qualité de la borne inférieure, la formulation originale à deux indices [19]. Des nouvelles inégalités valides ont été dévelopées et ajoutées aux modèles, de même que des inégalités connues. De nouveaux algorithmes de séparation ont aussi été dévelopés qui dans la plupart de cas généralisent ceux trouvés dans la litterature. Les résultats numériques montrent que ces modèles de flot sont en fait utiles pour résoudre des instances de petite à moyenne taille. Dans le chapitre 4, on présente une nouvelle méthode de génération de colonnes basée sur une formulation de partition d’ensemble. Le sous-problème consiste en un problème de plus court chemin avec capacités (PCCC). En particulier, on utilise une relaxation de ce problème dans laquelle il est possible de produire des routes avec des cycles de longueur trois ou plus. Ceci est complété par des nouvelles coupes qui permettent de réduire encore davantage le saut d’intégralité en même temps que de défavoriser l’apparition de cycles dans les routes. Ces résultats suggèrent que cette méthode fournit la meilleure méthode exacte pour le PLRC. Dans le chapitre 5, on introduit une nouvelle méthode heuristique pour le PLRC. Premièrement, on démarre une méthode randomisée de type GRASP pour trouver un premier ensemble de solutions de bonne qualité. Les solutions de cet ensemble sont alors combinées de façon à les améliorer. Finalement, on démarre une méthode de type détruir et réparer basée sur la résolution d’un nouveau modèle de localisation et réaffectation qui généralise le problème de réaffectaction [48].

Distribución hiperbólica generalizada: una aplicación en la selección de portafolios y en la cuantificación de medidas de riesgo de mercado

En este trabajo se implementa una metodología para incluir momentos de orden superior en la selección de portafolios, haciendo uso de la Distribución Hiperbólica Generalizada, para posteriormente hacer un análisis comparativo frente al modelo de Markowitz.

Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.

Natural resource windfalls and efficiency of local government expenditures: evidence from Peru

We study the role of natural resource windfalls in explaining the efficiency of public expenditures. Using a rich dataset of expenditures and public good provision for 1,836 municipalities in Peru for period 2001-2010, we estimate a non-monotonic relationship between the efficiency of public good provision and the level of natural resource transfers. Local governments that were extremely favored by the boom of mineral prices were more efficient in using fiscal windfalls whereas those benefited with modest transfers were more inefficient. These results can be explained by the increase in political competition associated with the boom. However, the fact that increases in efficiency were related to reductions in public good provision casts doubts about the beneficial effects of political competition in promoting efficiency.

Typification of farming systems for constructing representative farm models: two illustrations of the application of multi-variate analyses in Chile and Pakistan

If the fundamental precepts of Farming Systems Research were to be taken literally then it would imply that for each farm 'unique' solutions should be sought. This is an unrealistic expectation, but it has led to the idea of a recommendation domain, implying creating a taxonomy of farms, in order to increase the general applicability of recommendations. Mathematical programming models are an established means of generating recommended solutions, but for such models to be effective they have to be constructed for 'truly' typical or representative situations. The multi-variate statistical techniques provide a means of creating the required typologies, particularly when an exhaustive database is available. This paper illustrates the application of this methodology in two different studies that shared the common purpose of identifying types of farming systems in their respective study areas. The issues related with the use of factor and cluster analyses for farm typification prior to building representative mathematical programming models for Chile and Pakistan are highlighted. (C) 2003 Elsevier Science Ltd. All rights reserved.

Formulating generalised 'goal games' against nature: An illustration from decision-making under uncertainty in agriculture

The games-against-nature approach to the analysis of uncertainty in decision-making relies on the assumption that the behaviour of a decision-maker can be explained by concepts such as maximin, minimax regret, or a similarly defined criterion. In reality, however, these criteria represent a spectrum and, the actual behaviour of a decision-maker is most likely to embody a mixture of such idealisations. This paper proposes that in game-theoretic approach to decision-making under uncertainty, a more realistic representation of a decision-maker's behaviour can be achieved by synthesising games-against-nature with goal programming into a single framework. The proposed formulation is illustrated by using a well-known example from the literature on mathematical programming models for agricultural-decision-making. (c) 2005 Elsevier Inc. All rights reserved.

World Health Organization dietary norms: a quantitative evaluation of potential consumption impacts in the United States, United Kingdom, and France

The member countries of the World Health Organization have endorsed its Global Strategy on Diet, Physical Activity, and Health. We assess the potential consumption impacts of these norms in the United States, France, and the United Kingdom using a mathematical programming approach. We find that adherence would involve large reductions in the consumption of fats and oils accompanying large rises in the consumption of fruits, vegetables, and cereal. Further, in the United Kingdom and the United States, but not France, sugar intakes would have to shrink considerably. Focusing on sub-populations within each country, we find that the least educated, not necessarily the poorest, would have to bear the highest burden of adjustment.

Food consumption impacts of adherence to dietary norms in the United States: a quantitative assessment

Promotion of adherence to healthy-eating norms has become an important element of nutrition policy in the United States and other developed countries. We assess the potential consumption impacts of adherence to a set of recommended dietary norms in the United States using a mathematical programming approach. We find that adherence to recommended dietary norms would involve significant changes in diets, with large reductions in the consumption of fats and oils along with large increases in the consumption of fruits, vegetables, and cereals. Compliance with norms recommended by the World Health Organization for energy derived from sugar would involve sharp reductions in sugar intakes. We also analyze how dietary adjustments required vary across demographic groups. Most socio-demographic characteristics appear to have relatively little influence on the pattern of adjustment required to comply with norms, Income levels have little effect on required dietary adjustments. Education is the only characteristic to have a significant influence on the magnitude of adjustments required. The least educated rather than the poorest have to bear the highest burden of adjustment. Out- analysis suggests that fiscal measures like nutrient-based taxes may not be as regressive as commonly believed. Dissemination of healthy-eating norms to the less educated will be a key challenge for nutrition policy.

Food consumption impacts of adherence to dietary norms in the United States: a quantitative assessment

Promotion of adherence to healthy-eating norms has become an important element of nutrition policy in the United States and other developed countries. We assess the potential consumption impacts of adherence to a set of recommended dietary norms in the United States using a mathematical programming approach. We find that adherence to recommended dietary norms would involve significant changes in diets, with large reductions in the consumption of fats and oils along with large increases in the consumption of fruits, vegetables, and cereals. Compliance with norms recommended by the World Health Organization for energy derived from sugar would involve sharp reductions in sugar intakes. We also analyze how dietary adjustments required vary across demographic groups. Most socio-demographic characteristics appear to have relatively little influence on the pattern of adjustment required to comply with norms, Income levels have little effect on required dietary adjustments. Education is the only characteristic to have a significant influence on the magnitude of adjustments required. The least educated rather than the poorest have to bear the highest burden of adjustment. Out- analysis suggests that fiscal measures like nutrient-based taxes may not be as regressive as commonly believed. Dissemination of healthy-eating norms to the less educated will be a key challenge for nutrition policy.

An assessment of the potential consumption impacts of WHO dietary norms in OECD countries

The member countries of the World Health Organization (WHO) have recently endorsed its global strategy on diet, physical activity and health. The strategy emphasises the need to limit the consumption of saturated fats and trans-fatty acids, salt and sugars, and to increase consumption of fruits and vegetables in order to combat the growing burden of non-communicable diseases. This paper attempts a broad quantitative assessment of the consumption impacts of these norms in OECD countries using a mathematical programming approach. We find that adherence to the WHO norms would involve a significant decrease in the consumption of vegetable oils (30%), dairy products (28%), sugar (24%), animal fats (30%) and meat (pig meat, 13.5%, mutton and goat 14.5%) and a significant increase in the human consumption of cereals (31%), fruits (25%) and vegetables (21%). (c) 2005 Elsevier Ltd. All rights reserved.

Global minimization using an Augmented Lagrangian method with variable lower-level constraints

A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the epsilon(k)-global minimization of the Augmented Lagrangian with simple constraints, where epsilon(k) -> epsilon. Global convergence to an epsilon-global minimizer of the original problem is proved. The subproblems are solved using the alpha BB method. Numerical experiments are presented.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Newton`s iterates can converge to non-stationary points

In this note we discuss the convergence of Newton`s method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hessian is positive definite at each step and yet the iterates converge to a non-stationary point. These examples answer a question posed by Fletcher in his 1987 book Practical methods of optimization.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Algoritmos para o problema de localização de uma facilidade com distâncias limitadas e restrições de atendimento

The objective in the facility location problem with limited distances is to minimize the sum of distance functions from the facility to the customers, but with a limit on each distance, after which the corresponding function becomes constant. The problem has applications in situations where the service provided by the facility is insensitive after a given threshold distance (eg. fire station location). In this work, we propose a global optimization algorithm for the case in which there are lower and upper limits on the numbers of customers that can be served