A study on exponential-size neighborhoods for the bin packing problem with conflicts

We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various application contexts such as logistics and transportation, timetabling, and resource allocation for cloud computing. We introduce $O(1)$ evaluation procedures for classical local-search moves, polynomial variants of ejection chains and assignment neighborhoods, an adaptive set covering-based neighborhood, and finally a controlled use of 0-cost moves to further diversify the search. The overall method produces solutions of good quality on the classical benchmark instances and scales very well with an increase of problem size. Extensive computational experiments are conducted to measure the respective contribution of each proposed neighborhood. In particular, the 0-cost moves and the large neighborhood based on set covering contribute very significantly to the search. Several research perspectives are open in relation to possible hybridizations with other state-of-the-art mathematical programming heuristics for this problem.Comment: 26 pages, 8 figure

On the design of custom packs: grouping of medical disposable items for surgeries

A custom pack combines medical disposable items into a single sterile package that is used for surgical procedures. Although custom packs are gaining importance in hospitals due to their potential benefits in reducing surgery setup times, little is known on methodologies to configure them, especially if the number of medical items, procedure types and surgeons is large. In this paper, we propose a mathematical programming approach to guide hospitals in developing or reconfiguring their custom packs. In particular, we are interested in minimising points of touch, which we define as a measure for physical contact between staff and medical materials. Starting from an integer non-linear programming model, we develop both an exact linear programming (LP) solution approach and an LP-based heuristic. Next, we also describe a simulated annealing approach to benchmark the mathematical programming methods. A computational experiment, based on real data of a medium-sized Belgian hospital, compares the optimised results with the performance of the hospital’s current configuration settings and indicates how to improve future usage. Next to this base case, we introduce scenarios in which we examine to what extent the results are sensitive for waste, i.e. adding more items to the custom pack than is technically required for some of the custom pack’s procedures, since this can increase its applicability towards other procedures. We point at some interesting insights that can be taken up by the hospital management to guide the configuration and accompanying negotiation processes

A grouping hyper-heuristic framework: application on graph colouring

Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimised. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than solutions. Most of the recently proposed selection hyper-heuristics are iterative and make use of two key methods which are employed successively; heuristic selection and move acceptance. In this study, we present a novel generic selection hyper-heuristic framework containing a fixed set of reusable grouping low level heuristics and an unconventional move acceptance mechanism for solving grouping problems. This framework deals with one solution at a time at any given decision point during the search process. Also, a set of high quality solutions, capturing the trade-off between the number of groups and the additional objective for the given grouping problem, is maintained. The move acceptance mechanism embeds a local search approach which is capable of progressing improvements on those trade-off solutions. The performance of different selection hyper-heuristics with various components under the proposed framework is investigated on graph colouring as a representative grouping problem. Then, the top performing hyper-heuristics are applied to a benchmark of examination timetabling instances. The empirical results indicate the effectiveness and generality of the proposed framework enabling grouping hyper-heuristics to achieve high quality solutions in both domains. ©2015 Elsevier Ltd. All rights reserved

The evolution of cell formation problem methodologies based on recent studies (1997-2008): review and directions for future research

This paper presents a literature review of the cell formation (CF) problem concentrating on formulations proposed in the last decade. It refers to a number of solution approaches that have been employed for CF such as mathematical programming, heuristic and metaheuristic methodologies and artificial intelligence strategies. A comparison and evaluation of all methodologies is attempted and some shortcomings are highlighted. Finally, suggestions for future research are proposed useful for CF researchers

Multi-objective model for optimizing railway infrastructure asset renewal

Trabalho inspirado num problema real da empresa Infraestruturas de Portugal, EP.A multi-objective model for managing railway infrastructure asset renewal is presented. The model aims to optimize three objectives, while respecting operational constraints: levelling investment throughout multiple years, minimizing total cost and minimizing work start postponements. Its output is an optimized intervention schedule. The model is based on a case study from a Portuguese infrastructure management company, which specified the objectives and constraints, and reflects management practice on railway infrastructure. The results show that investment levelling greatly influences the other objectives and that total cost fluctuations may range from insignificant to important, depending on the condition of the infrastructure. The results structure is argued to be general and suggests a practical methodology for analysing trade-offs and selecting a solution for implementation.info:eu-repo/semantics/publishedVersio

A decision support system to design water supply and sewer pipes replacement intervention programs

Article number 107967Asset management in hydraulic infrastructures aims for the long-term sustainability of water distribution and wastewater networks. Strategic maintenance planning has thus been deeply analyzed in the literature for indi vidual water and sewer pipes. However, water utilities do not plan and perform replacement activities on in dividual elements, but rather on coherent aggregations of neighboring pipes. We have developed a decision support system (DSS) to help water utilities design intervention programs for hydraulic infrastructures. It in tegrates a two-stage algorithm that groups water supply and sewer pipes into practical and efficient replacement works, based upon their proximity and their priority of renewal. A multi-objective genetic algorithm optimizes the work programs configurations while integrating the water company’s strategic policy into an innovative multi-objective function. We have applied our methodology to a large water company in Spain and illustrated this application with a sensitivity analysis to determine how the company’s strategic criteria influences the resulting work configurations.Empresa Metropolitana de Abastecimiento y Saneamiento de Aguas de Sevilla (EMASESA) 273/17, 286/1

Maintenance grouping for multi-component systems with availability constraints and limited maintenance teams

International audienceThe paper deals with a maintenance grouping approach for multi-component systems whose components are connected in series. The considered systems are required to serve a sequence of missions with limited breaks/stoppage durations while maintenance teams (repairmen) are limited and may vary over time. The optimization of the maintenance grouping decision for such multi-component systems leads to a NP-complete problem. The aim of the paper is to propose and to optimize a dynamic maintenance decision rule on a rolling horizon. The heuristic optimization scheme for the maintenance decision is developed by implementing two optimization algorithms (genetic algorithm and MULTIFIT) to find an optimal maintenance planning under both availability and limited repairmen constraints. Thanks to the proposed maintenance approach, impacts of availability constraints or/and limited maintenance teams on the maintenance planning and grouping are highlighted. In addition, the proposed grouping approach allows also updating online the maintenance planning in dynamic contexts such as the change of required availability level and/or the change of repairmen over time. A numerical example of a 20-component system is introduced to illustrate the use and the advantages of the proposed approach in the maintenance optimization framework