@article {17629,
	title = {A comparison of separation routines for benders optimality cuts for two-level facility location problems},
	journal = {Expert Systems with Applications},
	volume = {141},
	year = {2020},
	pages = {112928},
	abstract = {
	This paper studies two-level uncapacitated facility location problems, a class of discrete location problems that consider different hierarchies of facilities and their interactions. Benders reformulations for both single and multiple assignment variants and while several separation procedures for three classes of Benders cuts are presented: standard optimality cuts, lifted optimality cuts, and non-dominated optimality cuts. Extensive computational experiments are performed on difficult and large-scale benchmark instances to assess the performance of the considered separation routines.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0957417419306463},
	author = {Paganini Barcellos de Oliveira and Ivan Contreras and Ricardo Saraiva de Camargo and Gilberto de Miranda J{\'u}nior}
}
@article {17789,
	title = {Surgical scheduling under uncertainty by approximate dynamic programming},
	journal = {Omega},
	volume = {95},
	year = {2020},
	pages = {102066},
	abstract = {
	Surgical scheduling consists of selecting surgeries to be performed within a day, while jointly assigning operating rooms, starting times and the required resources. Patients can be elective or emergency/urgent. The scheduling of surgeries in an operating theatre with common resources to emergency or urgent and elective cases is highly subject to uncertainties not only on the duration of an intervention but mainly on the arrival of emergency or urgent cases. At the beginning of the day we are given a candidate set of elective surgeries with and an expected duration and a time window the surgery must start, but the expected duration and the time window of an emergency or urgent case become known when the surgery arrives. The day is divided into decision stages. Due to the dynamic nature of the problem, at the beginning of each stage the planner can make decisions taking into account the new information available. Decisions can be to schedule arriving surgeries, and to reschedule or cancel surgeries not started yet. The objective is to minimize the total expected cost composed of terms related to refusing arriving surgeries, to canceling scheduled surgeries, and to starting surgeries out of their time window. We address the problem with an approximate dynamic programming approach embedding an integer programming formulation to support decision making. We propose a dynamic model and an approximate policy iteration algorithm making use of basis functions to capture the impact of decisions to the future stages. Computational experiments have shown with statistical significance that the proposed algorithm outperforms a lookahead reoptimization approach.

},
	url = {https://doi.org/10.1016/j.omega.2019.05.002},
	author = {Thiago Augusto de Oliveira Silva and Mauricio Cardoso de Souza}
}
@article {17762,
	title = {An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem},
	journal = {Swarm and Evolutionary Computation},
	volume = {51},
	year = {2019},
	pages = {100601},
	abstract = {
	Green machine scheduling consists in the allocation of jobs in order to maximize production, in view of the sustainable use of energy. This work addresses the unrelated parallel machine scheduling problem with setup times, with the minimization of the makespan and the total energy consumption. The latter takes into account the power consumption of each machine in different operation modes. We propose multi-objective extensions of the Adaptive Large Neighborhood Search (ALNS) metaheuristic with Learning Automata (LA) to improve the search process and to solve the large scale instances efficiently. ALNS combines ad-hoc destroy and repair (also named removal and insertion) operators and a local search procedure. The LA is used to adapt the selection of insertion and removal operators within the framework of ALNS. Two new algorithms are developed: the MO-ALNS and the MO-ALNS/D. The first algorithm is a direct extension of single objective ALNS by using multi-objective local search. As this method does not offer much control of the diversification of the Pareto front approximation, a second strategy employs the decomposition. approach similar to MOEA/D algorithm. The results show that the MO-ALNS/D algorithm has better performance than MO-ALNS and MOEA/D in all indicators. These findings show that the decomposition strategy is beneficial not only for evolutionary algorithms, but it is indeed an efficient way to extend ALNS to multi-objective problems.

},
	url = {https://doi.org/10.1016/j.swevo.2019.100601},
	author = {Luciano Perdig{\~a}o Cota and Frederico Gadelha Guimar{\~a}es and Roberto G. Ribeiro and Ivan R. Meneghini and Fernando Bernardes de Oliveira and Marcone Jamilson Freitas Souza and Patrick Siarry}
}
@article {17634,
	title = {Modelos de precifica{\c c}{\~a}o para loca{\c c}{\~a}o e venda de im{\'o}veis residenciais na cidade de Jo{\~a}o Monlevade-MG via regress{\~a}o linear multivariada},
	journal = {Revista GEPROS - Gest{\~a}o da Produ{\c c}{\~a}o, Opera{\c c}{\~o}es e Sistemas},
	volume = {14},
	number = {3},
	year = {2019},
	abstract = {
	Consumers of goods and services in a particular market are attracted by a set of value attributes that directly or indirectly qualify them in relation to their competitors. On the other hand, although the {\textquotedblleft}price{\textquotedblright} is only one among the various attributes, it is often interpreted as a response variable that gathers the others, precisely because of their relevance level to the consumers budget constraint. This paper proposes to evaluate the level of influence and correlation of a set of explanatory variables in the prices of residential properties offered for rent and sale in the city of Jo{\~a}o Monlevade-MG, using multivariate linear regression models. The methodology is based on real information regarding the prices offered in the city and its structural and locational characteristics, to quote: number of rooms and parking spaces; number of police occurrences; proximity to the center, health centers and schools more nearby. As a result, it was possible to obtain a set of mathematical equations able to explain the price according to the predictor variables, as well as to understand the relation between these variables.

},
	url = {https://revista.feb.unesp.br/index.php/gepros/article/view/2614},
	author = {Vanessa Silva Rosa and Paganini Barcellos de Oliveira and Rafael Lucas Machado Pinto}
}
@article {17769,
	title = {A multi-criteria Approach to the Problem of Managing the new Product Development Project Portfolio},
	journal = {International Journal of Advanced Engineering Research and Science},
	volume = {6},
	number = {8},
	year = {2019},
	pages = {257-264},
	abstract = {
	The management problem of the New Product Development Project Process (PDNP) is recurrent in the literature, as it reflects a question that exists in R\&amp;D companies, which is to decide which product project portfolio which will minimize the necessary development costs while maximizing the return for the organization. In this context, the present study aims to use two multi-criteria approaches - TOPSIS and PROMETHEE II - using the Analytic Hierarchy Process (AHP) method to establish, in a non-partial way, the weights and to determine which approach yields the best profit for NPDP, and raise the question of which approach is most appropriate for this problem. In addition, a practical example was proposed that shows the impact between the different orderings present in the work, to assist in achieving the goal. As a result, it was possible to obtain a study in which the non-compensatory approach is better for the practical example, making the present work the beginning of deeper studies on the subject.

},
	url = {https://ijaers.com/detail/a-multi-criteria-approach-to-the-problem-of-managing-the-new-product-development-project-portfolio/},
	author = {Samuel Martins Drei and Thiago Augusto de Oliveira Silva}
}
@article {13307,
	title = {Multi-objective Approach for Power Quality Monitor Allocation with Symmetry in Short-Duration Voltage Variations},
	journal = {IEEE Transactions on Power Delivery},
	volume = {34},
	number = {2},
	year = {2019},
	pages = {430 - 437},
	abstract = {In this paper, we present a new approach for solving the problem of power quality monitors (PQMs) optimal allocation, for the monitoring of short-duration voltage variations caused by a fault condition in a power grid system. The problem is treated in a multiobjective perspective with two optimal criteria: minimization of the number of PQMs and maximization of the number of identified faults. Non-identification of an event can occur as a result of symmetry conditions in the network, i.e., in cases where two or more faults generate the same signals in some buses, which leads to ambiguity in the monitoring results. Symmetry increases the complexity of both the problem formulation and solution. The problem is described as a multiobjective discrete optimization problem and is solved by the algorithm for bicriteria discrete optimization within reasonable computational time. That approach was tested in power grids of different characteristics and sizes. The results demonstrate the proposed methodology applicability for solving the problem in real-size networks.},
	url = {10.1109/TPWRD.2018.2890233},
	author = {Paulo Estev{\~a}o Teixeira Martins and Wilingthon Guerra Zvietcovich and Thiago Augusto de Oliveira Silva and Fernando Bernardes de Oliveira}
}
@article {13306,
	title = {Surgical scheduling under uncertainty by approximate dynamic programming},
	journal = {Omega},
	volume = {95},
	year = {2019},
	pages = {102066},
	abstract = {Surgical scheduling consists of selecting surgeries to be performed within a day, while jointly assigning operating rooms, starting times and the required resources. Patients can be elective or emergency/urgent. The scheduling of surgeries in an operating theatre with common resources to emergency or urgent and elective cases is highly subject to uncertainties not only on the duration of an intervention but mainly on the arrival of emergency or urgent cases. At the beginning of the day we are given a candidate set of elective surgeries with and an expected duration and a time window the surgery must start, but the expected duration and the time window of an emergency or urgent case become known when the surgery arrives. The day is divided into decision stages. Due to the dynamic nature of the problem, at the beginning of each stage the planner can make decisions taking into account the new information available. Decisions can be to schedule arriving surgeries, and to reschedule or cancel surgeries not started yet. The objective is to minimize the total expected cost composed of terms related to refusing arriving surgeries, to canceling scheduled surgeries, and to starting surgeries out of their time window. We address the problem with an approximate dynamic programming approach embedding an integer programming formulation to support decision making. We propose a dynamic model and an approximate policy iteration algorithm making use of basis functions to capture the impact of decisions to the future stages. Computational experiments have shown with statistical significance that the proposed algorithm outperforms a lookahead reoptimization approach.},
	url = {https://doi.org/10.1016/j.omega.2019.05.002},
	author = {Thiago Augusto de Oliveira Silva and Mauricio C. de Souza}
}
@article {17641,
	title = {Feira livre de Jo{\~a}o Monlevade: diagn{\'o}stico socioecon{\^o}mico, estrutural e sistema de governan{\c c}a},
	journal = {Revista UFG},
	volume = {17},
	number = {21},
	year = {2018},
	abstract = {
	A crescente procura por alimentos saud{\'a}veis e sem agrot{\'o}xico e o ambiente prop{\'\i}cio para o conv{\'\i}vio social atrai pessoas de diferentes perfis {\`a}s feiras livres. Dessa forma, o objetivo do presente estudo {\'e} avaliar os aspectos essenciais referentes {\`a} estrutura f{\'\i}sica, social e econ{\^o}mica da Feira Livre de Jo{\~a}o Monlevade sob perspectiva de consumidores, n{\~a}o consumidores e feirantes e propor um novo sistema de governan{\c c}a de feira. Para isto, foram utilizados recursos como visitas in loco, observa{\c c}{\~a}o, verbaliza{\c c}{\~o}es estruturais, conversas informais e pesquisas bibliogr{\'a}ficas. Neste contexto, esta pesquisa possibilitou o conhecimento mais aprofundado sobre a realidade da Feira Livre de Jo{\~a}o Monlevade e consequentemente, atrav{\'e}s do apoio dos {\'o}rg{\~a}os respons{\'a}veis locais, ser{\'a} poss{\'\i}vel realizar reparos adequados que possam torn{\'a}-la uma importante forma de manifesta{\c c}{\~a}o cultural na cidade e um local de entretenimento para os diferentes p{\'u}blicos presentes na sociedade.

},
	url = {https://www.revistas.ufg.br/revistaufg/article/view/51709},
	author = {J{\'e}ssica da Silva Soares Cunha and M{\'a}rbia Fernandes Pereira de Ara{\'u}jo and Thiago Augusto de Oliveira Silva and Wagner Ragi Curi Filho}
}
@article {17646,
	title = {The gateway hub location problem},
	journal = {Journal of Air Transport Management},
	volume = {73},
	year = {2018},
	pages = {95-112},
	abstract = {
	We introduce the Gateway Hub Location Problem (GHLP) to design global air transportation systems. Relying on a three-level hub network structure and on having nodes located in different geographic regions, the GHLP consists of locating international gateways and domestic hubs, activating arcs to induce a connected gateway and hub network, and routing flows within the network at minimum cost. Most previous studies focus on a typical hub-and-spoke network, in which local and global flows are not differentiated. Here to better represent a world wide air transportation system, global flows can only leave or enter a given geographic region by means of a gateway, while local flows can only use hubs within their respective region. As routing local or global flows involved different agents, this study presents a mixed integer programming formulation that exploits these differences to model both the local and global flows. Due to the formulation{\textquoteright}s characteristics, two algorithm variants based on Benders decomposition method are devised to solve the problem. A new repair procedure produces optimality Benders cuts whenever feasibility Benders cuts would rather be expected. While the monolithic version failed to solve medium size instances, our algorithms solved lager ones in reasonable time.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0969699717304647},
	author = {Luiza Bernardes Real and Morton O{\textquoteright}Kelly and Gilberto de Miranda J{\'u}nior and Ricardo Saraiva de Camargo}
}
@article {17643,
	title = {HMS: A hybrid multi-start algorithm for solving binary linear programs},
	journal = {Electronic Notes in Discrete Mathematics},
	volume = {66},
	year = {2018},
	pages = {7-14},
	abstract = {
	This work presents a hybrid multi-start algorithm for solving generic binary linear programs. This algorithm, called HMS, is based on a Multi-Start Metaheuristic and combines exact and heuristic strategies to address the problem. The initial solutions are generated by a strategy that applies linear programming and constraint propagation for defining an optimized set of fixed variables. In order to refine them, a local search, guided by a Variable Neighborhood Descent heuristic, is called, which, in turn, uses Local Branching cuts. The algorithm was tested in a set of binary LPs from the MIPLIB 2010 library and the results pointed out its competitive performance, resulting in a promising matheuristic.

},
	url = {https://doi.org/10.1016/j.endm.2018.03.002},
	author = {Josiane da Costa Vieira Rezende and Marcone Jamilson Freitas Souza and Vitor Naz{\'a}rio Coelho and Alexandre Xavier Martins}
}
@article {17642,
	title = {A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem},
	journal = {Electronic Notes in Discrete Mathematics},
	volume = {66},
	year = {2018},
	pages = {159-166},
	abstract = {
	This work addresses the multi-level capacitated minimum spanning tree (MLCMST) problem. It consists of finding a minimal cost spanning tree such that the flow to be transferred from a central node (root) to the other nodes is bounded by the edge capacities. In this paper, a hybrid algorithm, combining the Variable Neighborhood Search (VNS) metaheuristic and one mathematical programming formulation of the literature, is used for solving it. The formulation is used to give an initial solution to VNS. Five neighborhoods are used for exploring the solution space. Results show that the VNS is able to improve the initial solutions and to obtain small gap solutions for all instance sets.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S1571065318300672},
	author = {Jean Carlos Tib{\'u}rcio Campos and Alexandre Xavier Martins and Marcone Jamilson Freitas Souza}
}
@article {17644,
	title = {Mathematical modelling for the transmission of dengue: Symmetry and travelling wave analysis},
	journal = {Nonlinear Analysis: Real World Applications},
	volume = {41},
	year = {2018},
	pages = {269-287},
	abstract = {
	In this paper we propose some mathematical models for the transmission of dengue using a system of reaction{\textendash}diffusion equations. The mosquitoes are divided into infected, uninfected and aquatic subpopulations, while the humans, which are divided into susceptible, infected and recovered, are considered homogeneously distributed in space with a constant total population. We find Lie point symmetries of the models and we study theirs temporal dynamics, which provides us the regions of stability and instability, depending on the values of the basic offspring and the basic reproduction numbers. Also, we calculate the possible values of the wave speed for the mosquitoes invasion and dengue spread and compare them with those found in the literature.

},
	url = {https://www.sciencedirect.com/science/article/pii/S1468121817301608},
	author = {Felipo Bacani and Stylianos Dimas and Igor Leite Freire and Norberto Anibal Maidana and Mariano Torrisi}
}
@article {17759,
	title = {Sco-concat: a solution to a planning problem in flexible manufacturing systems using supervisory control theory and optimization techniques},
	journal = {Journal of Control, Automation and Electrical Systems},
	volume = {29},
	number = {4},
	year = {2018},
	pages = {500-511},
	abstract = {
	This work presents a modified version of the SCO (Supervisory Control and Optimization) methodology, proposed in Pena et al. (Inf Sci 329:491{\textendash}502, 2016) to deal with planning problems in flexible manufacturing systems. Although having proved to be an alternative to deal with this class of problems, the SCO methodology is limited by the fact that it can only be applied to deal with small batches of products. Previous works show that when considering manufacturing systems of a moderate degree of complexity, this approach is only efficient to generate solutions for batches containing very few products, as for larger batches, the necessary computational time to process a solution is very high. It is obvious that, for the problems in the real world, this dimension of production is very small, which, at first, makes the application of SCO methodology quite limited. Therefore, this work proposes a complementary approach to SCO, here called SCO-Concat, developed to carry out the planning in larger batches of production. The proposed methodology was tested in a plant of moderate size, and the results obtained show that planning for batches as large as desired can be achieved in an efficient manner by SCO-Concat at a very reduced computational cost.

},
	url = {https://link.springer.com/article/10.1007/s40313-018-0386-7},
	author = {Tatiana Alves Costa and Patr{\'\i}cia N. Pena and Ricardo H. C. Takahashi}
}
@article {17645,
	title = {Flexibility evaluation of multiechelon supply chains},
	journal = {PLOS ONE},
	volume = {13},
	number = {3},
	year = {2018},
	pages = {1-27},
	abstract = {Multiechelon supply chains are complex logistics systems that require flexibility and coordination at a tactical level to cope with environmental uncertainties in an efficient and effective manner. To cope with these challenges, mathematical programming models are developed to evaluate supply chain flexibility. However, under uncertainty, supply chain models become complex and the scope of flexibility analysis is generally reduced. This paper presents a unified approach that can evaluate the flexibility of a four-echelon supply chain via a robust stochastic programming model. The model simultaneously considers the plans of multiple business divisions such as marketing, logistics, manufacturing, and procurement, whose goals are often conflicting. A numerical example with deterministic parameters is presented to introduce the analysis, and then, the model stochastic parameters are considered to evaluate flexibility. The results of the analysis on supply, manufacturing, and distribution flexibility are presented. Tradeoff analysis of demand variability and service levels is also carried out. The proposed approach facilitates the adoption of different management styles, thus improving supply chain resilience. The model can be extended to contexts pertaining to supply chain disruptions; for example, the model can be used to explore operation strategies when subtle events disrupt supply, manufacturing, or distribution.},
	url = {https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0194050},
	author = {Jo{\~a}o Fl{\'a}vio de Freitas Almeida and Samuel Vieira Concei{\c c}{\~a}o and Luiz Ricardo Pinto and Ricardo Saraiva de Camargo and Gilberto de Miranda J{\'u}nior}
}
@article {13308,
	title = {Product value dimensions and strategic decisions},
	journal = {Journal of Engineering, Architecture and Technology Innovation},
	volume = {6},
	number = {1},
	year = {2018},
	pages = {2-19},
	abstract = {Although the product value is a central element in the competitive strategy, it has not been properly discussed in theoretical models. The authors have found no clear analysis of cause-and-effect relationships between the product value and the strategic decision issues in the literature. Regarding this theoretical gap, the present article proposes a theoretical model of the dimensions of the product value and relates these elements to the strategic decisions that should be taken in the context of competitive strategy elaboration. The related decisions are exploited, and guidelines for competitive strategy definition are structured. Thus, this theoretical essay has three main contributions. First, it extends the current concept of product value through an in-depth and detailed view. Second, it presents a direct link between product value forms and competitive strategy. Third, it outlines a comprehensive and integrative view of the process of competitive strategy elaboration based on product value.\&nbsp;},
	url = {http://dx.doi.org/10.1590/S0101-74382009000300003},
	author = {Sergio Evangelista Silva and Wagner Ragi Curi Filho and Thiago Augusto Oliveira Silva}
}
@article {5520,
	title = {A column generation approach for the strong network orientation problem},
	journal = {Electronic Notes in Discrete Mathematics},
	volume = {62},
	year = {2017},
	pages = {75-80},
	abstract = {In this study, an aggregated flow formulation and a column generation strategy are proposed for the Strong Network Orientation Problem (SNOP) that consists in setting an orientation for each edge in a given graph, such that the resulting digraph is strongly connected and the total travel distance between all pairs of vertices is minimized. SNOP is NP-hard and finds application in urban networks.},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S1571065317302524},
	author = {Alexandre Xavier Martins and Christophe Duhamel and Andr{\'e}a Cynthia Santos}
}
@article {17625,
	title = {Application of prediction models using fuzzy sets: a Bayesian inspired approach},
	journal = {Fuzzy Sets and Systems},
	volume = {319},
	year = {2017},
	pages = {104-116},
	abstract = {
	A fuzzy inference framework based on fuzzy relations is developed, adapted and applied to temperature and humidity measurements from a specific coffee crop site in Brazil. This framework consists of fuzzy relations over possibility distributions, resulting in a model analogous to a Bayesian inference process. The application of this fuzzy model to a data set of experimental measurements and its correspondent forecasts of temperature and humidity resulted in a set of revised forecasts, that incorporate information from a historical record of the problem. Each set of revised forecasts was compared with the correspondent set of experimental data using two different statistical measures, MAPE (Mean Absolute Percentage Error) and Willmott{\textquoteright}s D. This comparison showed that the sets of forecasts revised by the fuzzy model exhibited better results than the original forecasts on both statistical measures for more than two thirds of the evaluated cases.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0165011416302792},
	author = {Felipo Bacani and La{\'e}cio C. de Barros}
}
@article {17627,
	title = {Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints},
	journal = {Applied Mathematical Modelling},
	volume = {51},
	year = {2017},
	pages = {274-301},
	abstract = {
	The incomplete hub location problem with and without hop-constraints is modeled using a Leontief substitution system approach. The Leontief formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders decomposition technique which can solve large scale test instances. The performance of the devised algorithm is primarily due to a new general scheme for separating Benders feasibility cuts. The novel cuts render a stabilizing effect that is directly responsible for the solution of instances up to 80 nodes.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0307904X17304274},
	author = {Ricardo Saraiva de Camargo and Gilberto de Miranda J{\'u}nior and Morton E. O{\textquoteright}Kelly and James F. Campbell}
}
@article {17626,
	title = {Integer programming techniques for educational timetabling},
	journal = {European Journal of Operational Research},
	volume = {262},
	number = {1},
	year = {2017},
	pages = {28-39},
	abstract = {
	Educational timetabling problems require the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The XHSTT format was adopted in this work because it models the main features of educational timetabling and it is the most used format in recent studies in the field. This work presents new cuts and reformulations for the existing integer programming model for XHSTT. The proposed cuts improved hugely the linear relaxation of the formulation, leading to an average gap reduction of 32\%. Applied to XHSTT-2014 instance set, the alternative formulation provided four new best known lower bounds and, used in a matheuristic framework, improved eleven best known solutions. The computational experiments also show that the resulting integer programming models from the proposed formulation are more effectively solved for most of the instances.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0377221717302242},
	author = {George H. G. Fonseca and Haroldo G. Santos and Eduardo G. Carrano and Thomas J. R. Stidsen}
}
@article {17624,
	title = {A multi-start heuristic for the design of hub-and-spoke networks},
	journal = {Proceeding Series of the Brazilian Society of Computational and Applied Mathematics},
	volume = {5},
	number = {1},
	year = {2017},
	abstract = {
	Design of Hub-and-spoke networks is an extension of classical facility location problem and it is very important due to its applications in cargo, passenger and telecommunication systems. The problem consists in determining the number and location of the hubs, besides define the allocation of non-hub nodes to the installed hubs, aiming to minimize the total costs. This problem is known to be NP-hard and it has been tackled by heuristic based approaches. In this paper it is proposed an efficient multi-start heuristic composed by a simple construction phase, a perturbation mechanism and an adaptive local search. Computational experiments using standard benchmark problems shows that the proposed approach is competitive when compared with the best heuristics in the literature.

},
	url = {https://doi.org/10.5540/03.2017.005.01.0471},
	author = {Rodrigo de Carvalho and Bruno Nonato Gomes and Alexandre Xavier Martins and Rodney Rezende Saldanha and Ricardo Saraiva de Camargo}
}
@article {5523,
	title = {Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem},
	journal = {4OR},
	volume = {14},
	number = {2},
	year = {2016},
	pages = { 201{\textendash}220},
	abstract = {The routing and wavelength assignment (RWA) problem typically occurs in wavelength division multiplexing optical networks. Given a number of available wavelengths, we consider here the problem of maximising the number of accepted connections with respect to the clash and continuity constraints. We first propose a new strategy which combines two existing models. This leads to an improved column generation scheme. We also present two heuristics to compute feasible solutions: a hybrid heuristic and the integer solution at the root node of the column generation. Our approaches are compared with the best existing results on a set of classic RWA instances.},
	url = {https://link.springer.com/article/10.1007/s10288-016-0309-z},
	author = {Christophe Duhamel and Philippe Mahey and Alexandre X. Martins and Rodney R. Saldanha and Rodney R. Saldanha}
}
@article {17748,
	title = {Control of Flexible Manufacturing Systems under model uncertainty using Supervisory Control Theory and evolutionary computation schedule synthesis},
	journal = {Information Sciences},
	volume = {329},
	year = {2016},
	pages = {491-502},
	abstract = {
	A new approach for the problem of optimal task scheduling in flexible manufacturing systems is proposed in this work, as a combination of metaheuristic optimization techniques with the supervisory control theory of discrete-event systems. A specific encoding, the word-shuffling encoding, which avoids the generation of a large number of infeasible sequences, is employed. A metaheuristic method based on a Variable Neighborhood Search is then built using such an encoding. The optimization algorithm performs the search for the optimal schedules, while the supervisory control has the role of codifying all the problem constraints, allowing an efficient feasibility correction procedure, and avoiding schedules that are sensitive to uncertainties in the execution times associated with the plant operation. In this way, the proposed methodology achieves a system performance which is typical from model-predictive scheduling, combined with the robustness which is required from a structural control.

},
	url = {https://www.sciencedirect.com/science/article/pii/S002002551500691X},
	author = {Patr{\'\i}cia N. Pena and Tatiana Alves Costa and Regiane S. Silva and Ricardo H. C. Takahashi}
}
@article {17602,
	title = {A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem},
	journal = {Expert Systems with Applications},
	volume = {43},
	year = {2016},
	pages = {117-130},
	abstract = {
	The Multi-Depot Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of depots. This paper introduces a cooperative coevolutionary algorithm to minimize the total route cost of the MDVRP. Coevolutionary algorithms are inspired by the simultaneous evolution process involving two or more species. In this approach, the problem is decomposed into smaller subproblems and individuals from different populations are combined to create a complete solution to the original problem. This paper presents a problem decomposition approach for the MDVRP in which each subproblem becomes a single depot VRP and evolves independently in its domain space. Customers are distributed among the depots based on their distance from the depots and their distance from their closest neighbor. A population is associated with each depot where the individuals represent partial solutions to the problem, that is, sets of routes over customers assigned to the corresponding depot. The fitness of a partial solution depends on its ability to cooperate with partial solutions from other populations to form a complete solution to the MDVRP. As the problem is decomposed and each part evolves separately, this approach is strongly suitable to parallel environments. Therefore, a parallel evolution strategy environment with a variable length genotype coupled with local search operators is proposed. A large number of experiments have been conducted to assess the performance of this approach. The results suggest that the proposed coevolutionary algorithm in a parallel environment is able to produce high-quality solutions to the MDVRP in low computational time.

},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0957417415005771},
	author = {Fernando Bernardes de Oliveira and Rasul Enayatifar and Hossein  Javedani Sadaei and Frederico Gadelha Guimar{\~a}es and Jean-Yves Potvin}
}
@article {17603,
	title = {GOAL solver: a hybrid local search based solver for high school timetabling},
	journal = {Annals of Operations Research},
	volume = {239},
	number = {1},
	year = {2016},
	pages = {77-97},
	abstract = {
	This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built upon the Kingston High School Timetabling Engine. Several neighborhood structures were developed and used in a hybrid metaheuristic based on Simulated Annealing and Iterated Local Search. The developed algorithm was the winner of the competition and produced the best known solutions for almost all instances.

},
	url = {https://link.springer.com/article/10.1007/s10479-014-1685-4},
	author = {George Henrique Godim da Fonseca and Haroldo Gambini Santos and T{\'u}lio {\^A}ngelo Machado Toffolo and Samuel Souza Brito and Marcone Jamilson Freitas Souza}
}
@article {17605,
	title = {Late acceptance hill-climbing for high school timetabling},
	journal = {Journal of Scheduling},
	volume = {19},
	number = {4},
	year = {2016},
	pages = {453-465},
	abstract = {
	The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.

},
	url = {https://link.springer.com/article/10.1007/s10951-015-0458-5},
	author = {George H. G. Fonseca and Haroldo G. Santos and Eduardo G. Carrano}
}
@article {17623,
	title = {Um estudo sobre localiza{\c c}{\~a}o de terminais intermodais na rede de escoamento da soja brasileira},
	journal = {Production},
	volume = {26},
	number = {3},
	year = {2016},
	pages = {562-580},
	abstract = {
	A soja {\'e} um dos principais produtos agr{\'\i}colas brasileiros. Do total colhido, aproximadamente 40\% {\'e} destinado {\`a} exporta{\c c}{\~a}o. Como as lavouras est{\~a}o concentradas principalmente na regi{\~a}o central no pa{\'\i}s, essa soja percorre, em geral, grandes dist{\^a}ncias at{\'e} os portos mar{\'\i}timos. Nesse caso, o transporte intermodal pode tornar mais eficiente e econ{\^o}mica a movimenta{\c c}{\~a}o de grandes volumes por longas dist{\^a}ncias. Analisa-se, neste estudo, a aplica{\c c}{\~a}o de um modelo de programa{\c c}{\~a}o matem{\'a}tica para apoiar decis{\~o}es de fluxo de soja e localiza{\c c}{\~a}o de terminais intermodais. Com base em dados secund{\'a}rios, foram propostas tr{\^e}s redes alternativas de escoamento, com diferentes {\'a}reas de abrang{\^e}ncia e possibilidade de utiliza{\c c}{\~a}o de ferrovias ainda em constru{\c c}{\~a}o ou projeto. Foram considerados os principais estados produtores e movimentadores da soja. Experimentos computacionais resultaram em fluxos de escoamento e localiza{\c c}{\~a}o de terminais condizentes com a realidade. Cen{\'a}rios alternativos da rede tamb{\'e}m foram analisados, evidenciando o potencial de an{\'a}lise dessa ferramenta de otimiza{\c c}{\~a}o.

},
	url = {https://www.scielo.br/pdf/prod/v26n3/0103-6513-prod-0103-6513144513.pdf},
	author = {Marina Soares Almeida and M{\^o}nica do Amaral and Reinaldo Morabito}
}
@article {17604,
	title = {Integrating matheuristics and metaheuristics for timetabling},
	journal = {Computers \& Operations Research},
	volume = {74},
	year = {2016},
	pages = {108-117},
	abstract = {The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. Computational experiments on well-known benchmark instances demonstrate the success of the proposed hybrid approach, which outperforms the standalone Variable Neighbourhood Search algorithm by far. Additionally, the proposed algorithm was able to improve 15 out of 17 current best known solutions in a very famous benchmark set.},
	url = {https://www.sciencedirect.com/science/article/abs/pii/S0305054816300879},
	author = {George H. G. Fonseca and Haroldo G. Santos and Eduardo G. Carrano}
}
@article {13304,
	title = {Surgical scheduling with simultaneous employment of specialised human resources},
	journal = {European Journal of Operational Research},
	volume = {245},
	number = {3},
	year = {2015},
	pages = {719-730},
	abstract = {Surgical scheduling is a challenging problem faced by hospital managers. It is subject to a wide range of constraints depending upon the particular situation within any given hospital. We deal with the simultaneous employment of specialised human resources, which must be assigned to surgeries according to their skills as well as the time windows of the staff. A particular feature is that they can be assigned to two surgeries simultaneously if the rooms are compatible. The objective is to maximise the use of the operating rooms. We propose an integer model and integer programming based heuristics to address the problem. Computational experiments were conducted on a number of scenarios inspired by real data to cover different practical problem solving situations. Numerical results show that relaxations provide tight upper bounds, and relax-and-fix heuristics are successful in finding optimal or near optimal solutions.},
	url = {https://doi.org/10.1016/j.ejor.2015.04.008},
	author = {Thiago A.O.Silva and Mauricio C. de Souza and Rodney R. Saldanha and Edmund K.Burke}
}
@article {5527,
	title = {Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem},
	journal = {Networks},
	year = {2011},
	abstract = {We propose algorithms to compute tight lower bounds and high quality upper bounds (UBs) for the multilevel capacitated minimum spanning tree problem. We first develop a branch-and-cut algorithm, introducing some new features: (i) the exact separation of cuts corresponding to some master equality polyhedra found in the formulation; (ii) the separation of Fenchel cuts, solving LPs considering all the possible solutions restricted to small portions of the graph. We then use that branch-and-cut within a GRASP that performs moves by solving to optimality subproblems corresponding to partial solutions. The computational experiments were conducted on 450 benchmark instances from the literature. Numerical results show improved best known (UBs) for almost all instances that could not be solved to optimality. {\textcopyright} 2011 Wiley Periodicals, Inc. NETWORKS, 2012},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/net.20485/abstract},
	author = {Eduardo Uchoa and T{\'u}lio A. M. Toffolo and Mauricio C. de Souza and Alexandre X. Martins and Ricardo Fukasawa}
}
@article {5601,
	title = {A VND-ILS Heuristic to Solve the RWA Problem},
	journal = {Network Optimization},
	year = {2011},
	pages = { 577-582},
	abstract = {The Routing and Wavelength Assignment problem occurs in optical networks where communication requests fulfilled without inducing wavelength conflicts. We propose a VND-ILS algorithm which is a hybridization of both the ILS metaheuristic and the VND local search. Three neighborhood structures are defined for the VND as well as a perturbation step in the ILS. The efficiency of our approach is illustrated on classical realistic RWA instances. The computational results show our method outperforms some of the best existing methods in the literature.},
	url = {https://link.springer.com/chapter/10.1007\%2F978-3-642-21527-8_64},
	author = {Alexandre Xavier Martins and Christophe Duhamel and Mauricio Cardoso de Souza and Rodney Rezende Saldanha and Philippe Mahey}
}
@article {5602,
	title = {GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem},
	journal = {Journal of Heuristics},
	volume = {15},
	number = {2},
	year = {2009},
	pages = {133{\textendash}151},
	abstract = {We propose a GRASP using an hybrid heuristic-subproblem optimization approach for the Multi-Level Capacitated Minimum Spanning Tree (MLCMST) problem. The motivation behind such approach is that to evaluate moves rearranging the configuration of a subset of nodes may require to solve a smaller-sized MLCMST instance. We thus use heuristic rules to define, in both the construction and the local search phases, subproblems which are in turn solved exactly by employing an integer programming model. We report numerical results obtained on benchmark instances from the literature, showing the approach to be competitive in terms of solution quality. The proposed GRASP have in fact improved the best known upper bounds for almost all of the considered instances.},
	url = {https://link.springer.com/article/10.1007\%2Fs10732-008-9079-x},
	author = {Alexandre X. Martins and Mauricio C. de Souza and Marcone J. F. Souza and T{\'u}lio A. M. Toffolo}
}
@article {13309,
	title = {New product development projects evaluation under time uncertainty},
	journal = {Pesquisa Operacional},
	volume = {29},
	number = {3},
	year = {2009},
	pages = {517-532},
	abstract = {The development time is one of the key factors that contribute to the new product development success. In spite of that, the impact of the time uncertainty on the development has been not fully exploited, as far as decision supporting models to evaluate this kind of projects is concerned. In this context, the objective of the present paper is to evaluate the development process of new technologies under time uncertainty. We introduce a model which captures this source of uncertainty and develop an algorithm to evaluate projects that incorporates Monte Carlo Simulation and Dynamic Programming. The novelty in our approach is to thoroughly blend the stochastic time with a formal approach to the problem, which preserves the Markov property. We base our model on the distinction between the decision epoch and the stochastic time. We discuss and illustrate the applicability of our model through an empirical example.},
	author = {Thiago Augusto de Oliveira Silva and Leonardo P. Santiago}
}
@article {5604,
	title = {Simulated annealing aplicado {\`a} resolu{\c c}{\~a}o do problema de roteamento de ve{\'\i}culos com janela de tempo},
	journal = {ANPET - Associa{\c c}{\~a}o Nacional de Pesquisa e Ensino em Transportes},
	volume = {13},
	number = {2},
	year = {2005},
	abstract = {Este trabalho apresenta um algoritmo eficiente, baseado na metaheur{\'\i}stica\&nbsp;Simulated Annealing\&nbsp;(SA), para resolver o Problema de Roteamento de Ve{\'\i}culos com Janela de Tempo. Esse problema tem como objetivo determinar as rotas de custo m{\'\i}nimo para uma frota de ve{\'\i}culos de mesma capacidade, atendendo {\`a} demanda de um conjunto de clientes, para os quais o atendimento somente {\'e} poss{\'\i}vel dentro de um intervalo de tempo determinado, chamado janela de tempo. A metodologia proposta, denominada SA-RAI, incorpora ao algoritmo\&nbsp;Simulated Annealing\&nbsp;cl{\'a}ssico, mecanismos auto-adaptativos para determina{\c c}{\~a}o da temperatura inicial e n{\'u}mero de itera{\c c}{\~o}es em uma mesma temperatura. Nesta metodologia, quando a temperatura atinge um valor limiar, a mesma {\'e} reaquecida um certo n{\'u}mero de vezes, possibilitando escapar de {\'o}timos locais. Al{\'e}m disso, ela conta com uma fase de intensifica{\c c}{\~a}o. Sempre que uma melhor solu{\c c}{\~a}o {\'e} encontrada, ela {\'e} submetida a um procedimento de refinamento, visando ao seu melhoramento. A metodologia foi aplicada a 168 problemas-teste da literatura e 13 novos melhores resultados foram encontrados.},
	url = {https://www.revistatransportes.org.br/anpet/article/view/98},
	author = {Alo{\'\i}sio de Castro Gomes J{\'u}nior and Marcone Jamilson Freitas Souza and Alexandre Xavier Martins}
}
