MAP inference via Block-Coordinate Frank-Wolfe Algorithm

We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems

Project portfolio evaluation and selection using mathematical programming and optimization methods

Project portfolio selection is an essential process for portfolio management and plays an important role in accomplishing organizational goals. This research explores the feasibility of developing a project portfolio selection tool by using mathematical programming and optimization models, specifically 0-1 integer programming (one objective portfolio) and goal programming (multiple objectives portfolio). These methods select the set of projects which deliver the maximum benefit (e.g., net present value, profit, etc.) represented for objective functions subjected to a series of constraints (e.g., technical requirements and/or resources availability) considering the scheduling of selected projects in a planning horizon, interdependence relationship among projects (e.g., complementary projects and mutually exclusive projects) and especial cases like mandatory and ongoing projects. ^ Based on the proposed model, a Decision Support System (DSS) will be developed and tested for accuracy, flexibility and ease of use. This computational tool will be designed for decision makers and users that are not familiar with mathematical programming models

A contribution to support decision making in energy/water sypply chain optimisation

The seeking of process sustainability forces enterprises to change their operations. Additionally, the industrial globalization implies a very dynamic market that, among other issues, promotes the enterprises competition. Therefore, the efficient control and use of their Key Performance Indicators, including profitability, cost reduction, demand satisfaction and environmental impact associated to the development of new products, is a significant challenge. All the above indicators can be efficiently controlled through the Supply Chain Management. Thus, companies work towards the optimization of their individual operations under competitive environments taking advantage of the flexibility provided by the virtually inexistent world market restrictions. This is achieved by the coordination of the resource flows, across all the entities and echelons belonging to the system network. Nevertheless, such coordination is significantly complicated if considering the presence of uncertainty and even more if seeking for a win-win outcome. The purpose of this thesis is extending the current decision making strategies to expedite these tasks in industrial processes. Such a contribution is based on the development of efficient mathematical models that allows coordinating large amount of information synchronizing the production and distribution tasks in terms of economic, environmental and social criteria. This thesis starts presents an overview of the requirements of sustainable production processes, describing and analyzing the current methods and tools used and identifying the most relevant open issues. All the above is always within the framework of Process System Engineering literature. The second part of this thesis is focused in stressing the current Multi-Objective solution strategies. During this part, first explores how the profitability of the Supply Chain can be enhanced by considering simultaneously multiple objectives under demand uncertainties. Particularly, solution frameworks have been proposed in which different multi-criteria decision making strategies have been combined with stochastic approaches. Furthermore, additional performance indicators (including financial and operational ones) have been included in the same solution framework to evaluate its capabilities. This framework was also applied to decentralized supply chains problems in order to explore its capabilities to produce solution that improves the performances of each one of the SC entities simultaneously. Consequently, a new generalized mathematical formulation which integrates many performance indicators in the production process within a supply chain is efficiently solved. Afterwards, the third part of the thesis extends the proposed solution framework to address the uncertainty management. Particularly, the consideration of different types and sources of uncertainty (e.g. external and internal ones) where considered, through the implementation of preventive approaches. This part also explores the use of solution strategies that efficiently selects the number of scenarios that represent the uncertainty conditions. Finally, the importance and effect of each uncertainty source over the process performance is detailed analyzed through the use of surrogate models that promote the sensitivity analysis of those uncertainties. The third part of this thesis is focused on the integration of the above multi-objective and uncertainty approaches for the optimization of a sustainable Supply Chain. Besides the integration of different solution approaches, this part also considers the integration of hierarchical decision levels, by the exploitation of mathematical models that assess the consequences of considering simultaneously design and planning decisions under centralized and decentralized Supply Chains. Finally, the last part of this thesis provides the final conclusions and further work to be developed.La globalización industrial genera un ambiente dinámico en los mercados que, entre otras cosas, promueve la competencia entre corporaciones. Por lo tanto, el uso eficiente de las los indicadores de rendimiento, incluyendo rentabilidad, satisfacción de la demanda y en general el impacto ambiental, representa un area de oportunidad importante. El control de estos indicadores tiene un efecto positivo si se combinan con la gestión de cadena de suministro. Por lo tanto, las compañías buscan definir sus operaciones para permanecer activas dentro de un ambiente competitivo, tomando en cuenta las restricciones en el mercado mundial. Lo anterior puede ser logrado mediante la coordinación de los flujos de recursos a través de todas las entidades y escalones pertenecientes a la red del sistema. Sin embargo, dicha coordinación se complica significativamente si se quiere considerar la presencia de incertidumbre, y aún más, si se busca exclusivamente un ganar-ganar. El propósito de esta tesis es extender el alcance de las estrategias de toma de decisiones con el fin de facilitar estas tareas dentro de procesos industriales. Estas contribuciones se basan en el desarrollo de modelos matemáticos eficientes que permitan coordinar grandes cantidades de información sincronizando las tareas de producción y distribución en términos económicos, ambientales y sociales. Esta tesis inicia presentando una visión global de los requerimientos de un proceso de producción sostenible, describiendo y analizando los métodos y herramientas actuales así como identificando las áreas de oportunidad más relevantes dentro del marco de ingeniería de procesos La segunda parte se enfoca en enfatizar las capacidades de las estrategias de solución multi-objetivo, durante la cual, se explora el mejoramiento de la rentabilidad de la cadena de suministro considerando múltiples objetivos bajo incertidumbres en la demanda. Particularmente, diferentes marcos de solución han sido propuestos en los que varias estrategias de toma de decisión multi-criterio han sido combinadas con aproximaciones estocásticas. Por otra parte, indicadores de rendimiento (incluyendo financiero y operacional) han sido incluidos en el mismo marco de solución para evaluar sus capacidades. Este marco fue aplicado también a problemas de cadenas de suministro descentralizados con el fin de explorar sus capacidades de producir soluciones que mejoran simultáneamente el rendimiento para cada uno de las entidades dentro de la cadena de suministro. Consecuentemente, una nueva formulación que integra varios indicadores de rendimiento en los procesos de producción fue propuesta y validada. La tercera parte de la tesis extiende el marco de solución propuesto para abordar el manejo de incertidumbres. Particularmente, la consideración de diferentes tipos y fuentes de incertidumbre (p.ej. externos e internos) fueron considerados, mediante la implementación de aproximaciones preventivas. Esta parte también explora el uso de estrategias de solución que elige eficientemente el número de escenarios necesario que representan las condiciones inciertas. Finalmente, la importancia y efecto de cada una de las fuentes de incertidumbre sobre el rendimiento del proceso es analizado en detalle mediante el uso de meta modelos que promueven el análisis de sensibilidad de dichas incertidumbres. La tercera parte de esta tesis se enfoca en la integración de las metodologías de multi-objetivo e incertidumbre anteriormente expuestas para la optimización de cadenas de suministro sostenibles. Además de la integración de diferentes métodos. Esta parte también considera la integración de diferentes niveles jerárquicos de decisión, mediante el aprovechamiento de modelos matemáticos que evalúan lasconsecuencias de considerar simultáneamente las decisiones de diseño y planeación de una cadena de suministro centralizada y descentralizada. La parte final de la tesis detalla las conclusiones y el trabajo a futuro necesario sobre esta línea de investigaciónPostprint (published version

Optimization problems in the postal sector

Supply chain optimization is a widely studied field of operations research. Nevertheless, adapting the existing solutions to the specifications of each company is an interesting and stimulating challenge. With this in mind, the project described herein, developed in partnership with CTT, looks to provide the company with precious tools to more efficiently manage the labour allocated to mail delivery and increase the productivity of the workforce as a whole. To achieve these objectives, it follows up on a previous work by Pereira[26], where an extension of the Vehicle Routing Problem (VRP) was proposed to optimize the last-mile delivery step of the mail distribution procedure, but this time giving particular relevance to the adequacy of the model developed to the intricacies imposed by the company and exploring suitable adaptations. One of the requirements, for standardization purposes, is the creation of segments, composed of sets of postal codes that serve as input to the optimization model. Finally, it was necessary to merge this work with the company’s workflow by integrating the model with SISMA, a productivity assessment tool already used by CTT.A otimização de uma cadeia de abastecimento é um campo vastamente estudado no âm- bito da investigação operacional. Contudo, adaptar as soluções existentes aos critérios de cada empresa é um desafio bastante interessante e estimulante. Tendo isto em consi- deração, este projeto, desenvolvido em parceria com os CTT – Correios de Portugal, S.A. (CTT), procura fornecer à empresa ferramentas que permitam uma gestão eficiente da força de trabalho afeta à distribuição de correio. Para atingir este propósito, este trabalho teve como ponto de partida uma proposta de- senvolvida por Pereira[26], onde uma adaptação do Vehicle Routing Problem (VRP) foi desenvolvida para otimizar a etapa last-mile do processo de distribuição. No presente trabalho, dá-se uma atenção redobrada à compatibilidade do modelo desenvolvido com as complexidades impostas pela empresa e explora-se algumas melhorias consideradas apropriadas. Um dos requisitos, para manter alguma estibilidade nos resultados, é a introdução de segmentos, compostos por conjuntos contíguos de códigos postais, que ali- mentam o modelo. Finalmente, para combinar este trabalho com o fluxo de trabalho da empresa, fez-se a integração do modelo de otimização com o SISMA, uma ferramenta de avalição de produtividade já utilizada pelos CTT

How to locate services optimizing redundancy: A comparative analysis of K-Covering Facility Location models

Redundancy aspects related to covering facility location problems are of extreme importance for many applications, in particular those regarding critical services. For example, in the healthcare sector, facilities such as ambulances or first -aid centers must be located robustly against unpredictable events causing disruption or congestion. In this paper, we propose different modeling tools that explicitly address coverage redundancy for the underlying service. We also evaluate, both theoretically and experimentally, the properties and behavior of the models, and compare them from a computational and managerial point of view. More precisely, by starting from three classical double -covering models from the literature (BACOP1, BACOP2, and DSM), we define three parametric families of models (namely, K-BACOP1, K-BACOP2, and K-DSM) which generalize the former to any possible Kth coverage level of interest. The study of such generalizations allows us to derive interesting managerial insights on location decisions at the strategic level. The CPU performance and the quality of the solutions returned are assessed through ad -hoc KPIs collected over many representative instances with different sizes and topological characteristics, and also by dynamically simulating scenarios involving possible disruption for the located facilities. Finally, a real case study concerning ambulance service in Morocco is analyzed. The results show that, in general, K-BACOP1 performs very well, even if intrinsic feasibility issues limit its broad applicability. Instead, K-DSM achieves the best coverage and equity performances for lower levels of redundancy, while K-BACOP2 seems the most robust choice when high redundancy is required, showing smoother and more predictable trends

How to locate services optimizing redundancy: A comparative analysis of K-Covering Facility Location models

Redundancy aspects related to covering facility location problems are of extreme importance for many applications, in particular those regarding critical services. For example, in the healthcare sector, facilities such as ambulances or first-aid centers must be located robustly against unpredictable events causing disruption or congestion. In this paper, we propose different modeling tools that explicitly address coverage redundancy for the underlying service. We also evaluate, both theoretically and experimentally, the properties and behavior of the models, and compare them from a computational and managerial point of view. More precisely, by starting from three classical double-covering models from the literature (BACOP1, BACOP2, and DSM), we define three parametric families of models (namely, K-BACOP1, K-BACOP2, and K-DSM) which generalize the former to any possible Kth coverage level of interest. The study of such generalizations allows us to derive interesting managerial insights on location decisions at the strategic level. The CPU performance and the quality of the solutions returned are assessed through ad-hoc KPIs collected over many representative instances with different sizes and topological characteristics, and also by dynamically simulating scenarios involving possible disruption for the located facilities. Finally, a real case study concerning ambulance service in Morocco is analyzed. The results show that, in general, K-BACOP1 performs very well, even if intrinsic feasibility issues limit its broad applicability. Instead, K-DSM achieves the best coverage and equity performances for lower levels of redundancy, while K-BACOP2 seems the most robust choice when high redundancy is required, showing smoother and more predictable trends

Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises

Tesis por compendio[ES] La optimización en las empresas manufactureras es especialmente importante, debido a las grandes inversiones que realizan, ya que a veces estas inversiones no obtienen el rendimiento esperado porque los márgenes de beneficio de los productos son muy ajustados. Por ello, las empresas tratan de maximizar el uso de los recursos productivos y financieros minimizando el tiempo perdido y, al mismo tiempo, mejorando los flujos de los procesos y satisfaciendo las necesidades del mercado. El proceso de planificación es una actividad crítica para las empresas. Esta tarea implica grandes retos debido a los cambios del mercado, las alteraciones en los procesos de producción dentro de la empresa y en la cadena de suministro, y los cambios en la legislación, entre otros. La planificación del aprovisionamiento, la producción y la distribución desempeña un papel fundamental en el rendimiento de las empresas manufactureras, ya que una planificación ineficaz de los proveedores, los procesos de producción y los sistemas de distribución contribuye a aumentar los costes de los productos, a alargar los plazos de entrega y a reducir los beneficios. La planificación eficaz es un proceso complejo que abarca una amplia gama de actividades para garantizar que los equipos, los materiales y los recursos humanos estén disponibles en el momento y el lugar adecuados. Motivados por la complejidad de la planificación en las empresas manufactureras, esta tesis estudia y desarrolla herramientas cuantitativas para ayudar a los planificadores en los procesos de la planificación del aprovisionamiento, producción y distribución. Desde esta perspectiva, se proponen modelos realistas y métodos eficientes para apoyar la toma de decisiones en las empresas industriales, principalmente en las pequeñas y medianas empresas (PYMES). Las aportaciones de esta tesis suponen un avance científico basado en una exhaustiva revisión bibliográfica sobre la planificación del aprovisionamiento, la producción y la distribución que ayuda a comprender los principales modelos y algoritmos utilizados para resolver estos planes, y pone en relieve las tendencias y las futuras direcciones de investigación. También proporciona un marco holístico para caracterizar los modelos y algoritmos centrándose en la planificación de la producción, la programación y la secuenciación. Esta tesis también propone una herramienta de apoyo a la decisión para seleccionar un algoritmo o método de solución para resolver problemas concretos de la planificación del aprovisionamiento, producción y distribución en función de su complejidad, lo que permite a los planificadores no duplicar esfuerzos de modelización o programación de técnicas de solución. Por último, se desarrollan nuevos modelos matemáticos y enfoques de solución de última generación, como los algoritmos matheurísticos, que combinan la programación matemática y las técnicas metaheurísticas. Los nuevos modelos y algoritmos comprenden mejoras en términos de rendimiento computacional, e incluyen características realistas de los problemas del mundo real a los que se enfrentan las empresas de fabricación. Los modelos matemáticos han sido validados con un caso de una importante empresa del sector de la automoción en España, lo que ha permitido evaluar la relevancia práctica de estos novedosos modelos utilizando instancias de gran tamaño, similares a las existentes en la empresa objeto de estudio. Además, los algoritmos matheurísticos han sido probados utilizando herramientas libres y de código abierto. Esto también contribuye a la práctica de la investigación operativa, y proporciona una visión de cómo desplegar estos métodos de solución y el tiempo de cálculo y rendimiento de la brecha que se puede obtener mediante el uso de software libre o de código abierto.[CA] L'optimització a les empreses manufactureres és especialment important, a causa de les grans inversions que realitzen, ja que de vegades aquestes inversions no obtenen el rendiment esperat perquè els marges de benefici dels productes són molt ajustats. Per això, les empreses intenten maximitzar l'ús dels recursos productius i financers minimitzant el temps perdut i, alhora, millorant els fluxos dels processos i satisfent les necessitats del mercat. El procés de planificació és una activitat crítica per a les empreses. Aquesta tasca implica grans reptes a causa dels canvis del mercat, les alteracions en els processos de producció dins de l'empresa i la cadena de subministrament, i els canvis en la legislació, entre altres. La planificació de l'aprovisionament, la producció i la distribució té un paper fonamental en el rendiment de les empreses manufactureres, ja que una planificació ineficaç dels proveïdors, els processos de producció i els sistemes de distribució contribueix a augmentar els costos dels productes, allargar els terminis de lliurament i reduir els beneficis. La planificació eficaç és un procés complex que abasta una àmplia gamma d'activitats per garantir que els equips, els materials i els recursos humans estiguen disponibles al moment i al lloc adequats. Motivats per la complexitat de la planificació a les empreses manufactureres, aquesta tesi estudia i desenvolupa eines quantitatives per ajudar als planificadors en els processos de la planificació de l'aprovisionament, producció i distribució. Des d'aquesta perspectiva, es proposen models realistes i mètodes eficients per donar suport a la presa de decisions a les empreses industrials, principalment a les petites i mitjanes empreses (PIMES). Les aportacions d'aquesta tesi suposen un avenç científic basat en una exhaustiva revisió bibliogràfica sobre la planificació de l'aprovisionament, la producció i la distribució que ajuda a comprendre els principals models i algorismes utilitzats per resoldre aquests plans, i posa de relleu les tendències i les futures direccions de recerca. També proporciona un marc holístic per caracteritzar els models i algorismes centrant-se en la planificació de la producció, la programació i la seqüenciació. Aquesta tesi també proposa una eina de suport a la decisió per seleccionar un algorisme o mètode de solució per resoldre problemes concrets de la planificació de l'aprovisionament, producció i distribució en funció de la seua complexitat, cosa que permet als planificadors no duplicar esforços de modelització o programació de tècniques de solució. Finalment, es desenvolupen nous models matemàtics i enfocaments de solució d'última generació, com ara els algoritmes matheurístics, que combinen la programació matemàtica i les tècniques metaheurístiques. Els nous models i algoritmes comprenen millores en termes de rendiment computacional, i inclouen característiques realistes dels problemes del món real a què s'enfronten les empreses de fabricació. Els models matemàtics han estat validats amb un cas d'una important empresa del sector de l'automoció a Espanya, cosa que ha permés avaluar la rellevància pràctica d'aquests nous models utilitzant instàncies grans, similars a les existents a l'empresa objecte d'estudi. A més, els algorismes matheurístics han estat provats utilitzant eines lliures i de codi obert. Això també contribueix a la pràctica de la investigació operativa, i proporciona una visió de com desplegar aquests mètodes de solució i el temps de càlcul i rendiment de la bretxa que es pot obtindre mitjançant l'ús de programari lliure o de codi obert.[EN] Optimisation in manufacturing companies is especially important, due to the large investments they make, as sometimes these investments do not obtain the expected return because the profit margins of products are very tight. Therefore, companies seek to maximise the use of productive and financial resources by minimising lost time and, at the same time, improving process flows while meeting market needs. The planning process is a critical activity for companies. This task involves great challenges due to market changes, alterations in production processes within the company and in the supply chain, and changes in legislation, among others. Planning of replenishment, production and distribution plays a critical role in the performance of manufacturing companies because ineffective planning of suppliers, production processes and distribution systems contributes to higher product costs, longer lead times and less profits. Effective planning is a complex process that encompasses a wide range of activities to ensure that equipment, materials and human resources are available in the right time and the right place. Motivated by the complexity of planning in manufacturing companies, this thesis studies and develops quantitative tools to help planners in the replenishment, production and delivery planning processes. From this perspective, realistic models and efficient methods are proposed to support decision making in industrial companies, mainly in small- and medium-sized enterprises (SMEs). The contributions of this thesis represent a scientific breakthrough based on a comprehensive literature review about replenishment, production and distribution planning that helps to understand the main models and algorithms used to solve these plans, and highlights trends and future research directions. It also provides a holistic framework to characterise models and algorithms by focusing on production planning, scheduling and sequencing. This thesis also proposes a decision support tool for selecting an algorithm or solution method to solve concrete replenishment, production and distribution planning problems according to their complexity, which allows planners to not duplicate efforts modelling or programming solution techniques. Finally, new state-of-the-art mathematical models and solution approaches are developed, such as matheuristic algorithms, which combine mathematical programming and metaheuristic techniques. The new models and algorithms comprise improvements in computational performance terms, and include realistic features of real-world problems faced by manufacturing companies. The mathematical models have been validated with a case of an important company in the automotive sector in Spain, which allowed to evaluate the practical relevance of these novel models using large instances, similarly to those existing in the company under study. In addition, the matheuristic algorithms have been tested using free and open-source tools. This also helps to contribute to the practice of operations research, and provides insight into how to deploy these solution methods and the computational time and gap performance that can be obtained by using free or open-source software.This work would not have been possible without the following funding sources: Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for hiring predoctoral research staff with Grant (ACIF/2018/170) and the European Social Fund with the Grant Operational Programme of FSE 2014-2020. Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for predoctoral contract students to stay in research centers outside the research centers outside the Valencian Community (BEFPI/2021/040) and the European Social Fund.Guzmán Ortiz, BE. (2022). Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/187461Compendi

Individually optimized commercial road transport: A decision support system for customizable routing problems

The Vehicle Routing Problem (VRP) in its manifold variants is widely discussed in scientific literature. We investigate related optimization models and solution methods to determine the state of research for vehicle routing attributes and their combinations. Most of these approaches are idealized and focus on single problem-tailored routing applications. Addressing this research gap, we present a customizable VRP for optimized road transportation embedded into a Decision Support System (DSS). It integrates various model attributes and handles a multitude of real-world routing problems. In the context of urban logistics, practitioners of different industries and researchers are assisted in efficient route planning that allows for minimizing driving distances and reducing vehicle emissions. Based on the design science research methodology, we evaluate the DSS with computational benchmarks and real-world simulations. Results indicate that our developed DSS can compete with problem-tailored algorithms. With our solution-oriented DSS as final artifact, we contribute to an enhanced economic and environmental sustainability in urban logistic applications

On the inventory routing problem with stationary stochastic demand rate

One of the most significant paradigm shifts of present business management is that individual businesses no longer participate as solely independent entities, but rather as supply chains (Lambert and Cooper, 2000). Therefore, the management of multiple relationships across the supply chain such as flow of materials, information, and finances is being referred to as supply chain management (SCM). SCM involves coordinating and integrating these multiple relationships within and among companies, so that it can improve the global performance of the supply chain. In this dissertation, we discuss the issue of integrating the two processes in the supply chain related, respectively, to inventory management and routing policies. The challenging problem of coordinating the inventory management and transportation planning decisions in the same time, is known as the inventory routing problem (IRP). The IRP is one of the challenging optimization problems in logis-tics and supply chain management. It aims at optimally integrating inventory control and vehicle routing operations in a supply network. In general, IRP arises as an underlying optimization problem in situations involving simultaneous optimization of inventory and distribution decisions. Its main goal is to determine an optimal distribution policy, consisting of a set of vehicle routes, delivery quantities and delivery times that minimizes the total inventory holding and transportation costs. This is a typical logistical optimization problem that arises in supply chains implementing a vendor managed inventory (VMI) policy. VMI is an agreement between a supplier and his regular retailers according to which retailers agree to the alternative that the supplier decides the timing and size of the deliveries. This agreement grants the supplier the full authority to manage inventories at his retailers'. This allows the supplier to act proactively and take responsibility for the inventory management of his regular retailers, instead of reacting to the orders placed by these retailers. In practice, implementing policies such as VMI has proven to considerably improve the overall performance of the supply network, see for example Lee and Seungjin (2008), Andersson et al. (2010) and Coelho et al. (2014). This dissertation focuses mainly on the single-warehouse, multiple-retailer (SWMR) system, in which a supplier serves a set of retailers from a single warehouse. In the first situation, we assume that all retailers face a deterministic, constant demand rate and in the second condition, we assume that all retailers consume the product at a stochastic stationary rate. The primary objective is to decide when and how many units to be delivered from the supplier to the warehouse and from the warehouse to retailers so as to minimize total transportation and inventory holding costs over the finite horizon without any shortages

On High-Performance Benders-Decomposition-Based Exact Methods with Application to Mixed-Integer and Stochastic Problems

RÉSUMÉ : La programmation stochastique en nombres entiers (SIP) combine la difficulté de l’incertitude et de la non-convexité et constitue une catégorie de problèmes extrêmement difficiles à résoudre. La résolution efficace des problèmes SIP est d’une grande importance en raison de leur vaste applicabilité. Par conséquent, l’intérêt principal de cette dissertation porte sur les méthodes de résolution pour les SIP. Nous considérons les SIP en deux étapes et présentons plusieurs algorithmes de décomposition améliorés pour les résoudre. Notre objectif principal est de développer de nouveaux schémas de décomposition et plusieurs techniques pour améliorer les méthodes de décomposition classiques, pouvant conduire à résoudre optimalement divers problèmes SIP. Dans le premier essai de cette thèse, nous présentons une revue de littérature actualisée sur l’algorithme de décomposition de Benders. Nous fournissons une taxonomie des améliorations algorithmiques et des stratégies d’accélération de cet algorithme pour synthétiser la littérature et pour identifier les lacunes, les tendances et les directions de recherche potentielles. En outre, nous discutons de l’utilisation de la décomposition de Benders pour développer une (méta- )heuristique efficace, décrire les limites de l’algorithme classique et présenter des extensions permettant son application à un plus large éventail de problèmes. Ensuite, nous développons diverses techniques pour surmonter plusieurs des principaux inconvénients de l’algorithme de décomposition de Benders. Nous proposons l’utilisation de plans de coupe, de décomposition partielle, d’heuristiques, de coupes plus fortes, de réductions et de stratégies de démarrage à chaud pour pallier les difficultés numériques dues aux instabilités, aux inefficacités primales, aux faibles coupes d’optimalité ou de réalisabilité, et à la faible relaxation linéaire. Nous testons les stratégies proposées sur des instances de référence de problèmes de conception de réseau stochastique. Des expériences numériques illustrent l’efficacité des techniques proposées. Dans le troisième essai de cette thèse, nous proposons une nouvelle approche de décomposition appelée méthode de décomposition primale-duale. Le développement de cette méthode est fondé sur une reformulation spécifique des sous-problèmes de Benders, où des copies locales des variables maîtresses sont introduites, puis relâchées dans la fonction objective. Nous montrons que la méthode proposée atténue significativement les inefficacités primales et duales de la méthode de décomposition de Benders et qu’elle est étroitement liée à la méthode de décomposition duale lagrangienne. Les résultats de calcul sur divers problèmes SIP montrent la supériorité de cette méthode par rapport aux méthodes classiques de décomposition. Enfin, nous étudions la parallélisation de la méthode de décomposition de Benders pour étendre ses performances numériques à des instances plus larges des problèmes SIP. Les variantes parallèles disponibles de cette méthode appliquent une synchronisation rigide entre les processeurs maître et esclave. De ce fait, elles souffrent d’un important déséquilibre de charge lorsqu’elles sont appliquées aux problèmes SIP. Cela est dû à un problème maître difficile qui provoque un important déséquilibre entre processeur et charge de travail. Nous proposons une méthode Benders parallèle asynchrone dans un cadre de type branche-et-coupe. L’assouplissement des exigences de synchronisation entraine des problèmes de convergence et d’efficacité divers auxquels nous répondons en introduisant plusieurs techniques d’accélération et de recherche. Les résultats indiquent que notre algorithme atteint des taux d’accélération plus élevés que les méthodes synchronisées conventionnelles et qu’il est plus rapide de plusieurs ordres de grandeur que CPLEX 12.7.----------ABSTRACT : Stochastic integer programming (SIP) combines the difficulty of uncertainty and non-convexity, and constitutes a class of extremely challenging problems to solve. Efficiently solving SIP problems is of high importance due to their vast applicability. Therefore, the primary focus of this dissertation is on solution methods for SIPs. We consider two-stage SIPs and present several enhanced decomposition algorithms for solving them. Our main goal is to develop new decomposition schemes and several acceleration techniques to enhance the classical decomposition methods, which can lead to efficiently solving various SIP problems to optimality. In the first essay of this dissertation, we present a state-of-the-art survey of the Benders decomposition algorithm. We provide a taxonomy of the algorithmic enhancements and the acceleration strategies of this algorithm to synthesize the literature, and to identify shortcomings, trends and potential research directions. In addition, we discuss the use of Benders decomposition to develop efficient (meta-)heuristics, describe the limitations of the classical algorithm, and present extensions enabling its application to a broader range of problems. Next, we develop various techniques to overcome some of the main shortfalls of the Benders decomposition algorithm. We propose the use of cutting planes, partial decomposition, heuristics, stronger cuts, and warm-start strategies to alleviate the numerical challenges arising from instabilities, primal inefficiencies, weak optimality/feasibility cuts, and weak linear relaxation. We test the proposed strategies with benchmark instances from stochastic network design problems. Numerical experiments illustrate the computational efficiency of the proposed techniques. In the third essay of this dissertation, we propose a new and high-performance decomposition approach, called Benders dual decomposition method. The development of this method is based on a specific reformulation of the Benders subproblems, where local copies of the master variables are introduced and then priced out into the objective function. We show that the proposed method significantly alleviates the primal and dual shortfalls of the Benders decomposition method and it is closely related to the Lagrangian dual decomposition method. Computational results on various SIP problems show the superiority of this method compared to the classical decomposition methods as well as CPLEX 12.7. Finally, we study parallelization of the Benders decomposition method. The available parallel variants of this method implement a rigid synchronization among the master and slave processors. Thus, it suffers from significant load imbalance when applied to the SIP problems. This is mainly due to having a hard mixed-integer master problem that can take hours to be optimized. We thus propose an asynchronous parallel Benders method in a branchand- cut framework. However, relaxing the synchronization requirements entails convergence and various efficiency problems which we address them by introducing several acceleration techniques and search strategies. In particular, we propose the use of artificial subproblems, cut generation, cut aggregation, cut management, and cut propagation. The results indicate that our algorithm reaches higher speedup rates compared to the conventional synchronized methods and it is several orders of magnitude faster than CPLEX 12.7