@inbook {17632,
	title = {Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem},
	booktitle = {Variable Neighborhood Search},
	year = {2020},
	pages = {126-138},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {
	This paper addresses the Uncapacitated Single Allocation p-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the p-hubs within a node network in order to maximize the network coverage. We proposed a search strategy-based heuristic Basic Variable Neighborhood Search (VNS) to solve the problem. Two different sets of test instances from the literature, Civil Aeronautics Board (CAB) and Australian Post (AP), were used to evaluate the performance of VNS and to compare it with the Tabu Search (TS) metaheuristic. In most instances, the bounds obtained by VNS and TS were the same but, on the other hand, for some of them, VNS presented a slight advantage and vice versa. That is, both algorithms are convenient to solve the proposed problem.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-030-44932-2_9},
	author = {Matheus de Ara{\'u}jo Butinholi and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Diego Perdig{\~a}o Martino},
	editor = {Rachid Benmansour and Angelo Sifaleras and Nenad Mladenovi{\'c}}
}
@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}
}
@conference {17635,
	title = {Algoritmo de descida em vizinhan{\c c}a vari{\'a}vel aplicado ao problema de cobertura m{\'a}xima de p-eixos n{\~a}o capacitados com aloca{\c c}{\~a}o simples},
	booktitle = {LI SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	volume = {2},
	year = {2019},
	pages = {107798},
	address = {Limeira, SP},
	abstract = {O presente artigo aborda o problema de cobertura m{\'a}xima de p-eixos n{\~a}o capacitados com aloca{\c c}{\~a}o simples (Uncapacitated Single Allocation p-hub Maximal Covering Problem - USApHMCP), que objetiva maximizar a cobertura de um conjunto de n{\'o}s de uma rede atrav{\'e}s de p-eixos. Uma heur{\'\i}stica baseada na estrat{\'e}gia de busca em descida com vizinhan{\c c}a vari{\'a}vel (Variable Neighborhood Descent - VND) foi desenvolvida para o problema. Dois diferentes conjuntos de inst{\^a}ncias, Civil Aeronautics Board (CAB) e Australian Post (AP), s{\~a}o utilizados para avaliar e comparar o desempenho do VND {\`a} metaheur{\'\i}stica Busca Tabu (Tabu Search - TS) encontrada na literatura. Como resultado, o VND apresentou limites superiores melhores para inst{\^a}ncias de grande porte (AP), bem como um desempenho m{\'e}dio ligeiramente superior em tempo computacional de resolu{\c c}{\~a}o para as inst{\^a}ncias CAB, de menor porte.},
	url = {https://proceedings.science/sbpo-2019/papers/algoritmo-de-descida-em-vizinhanca-variavel-aplicado-ao-problema-de-cobertura-maxima-de-p-eixos-nao-capacitados-com-aloc?lang=pt-br},
	author = {Matheus de Ara{\'u}jo Butinholi and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Diego Perdig{\~a}o Martino}
}
@conference {17636,
	title = {Algoritmo de pesquisa em vizinhan{\c c}a vari{\'a}vel aplicado ao problema de orienta{\c c}{\~a}o de redes fortemente conexas},
	booktitle = {LI SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	volume = {2},
	year = {2019},
	pages = {107799},
	address = {Limeira, SP},
	abstract = {A infraestrutura inadequada e o intenso fluxo de pessoas e ve{\i}́culos resultam em problemas associados {\`a}s vias urbanas no mundo. O Problema de Orienta{\c c}{\~a}o de Redes Fortemente Conexas (Strong Network Orientation Problem {\textendash} SNOP) {\'e} uma alternativa para amenizar esse cen{\'a}rio na medida em que objetiva minimizar a soma das dist{\^a}ncias percorridas a partir de cada ponto de interse{\c c}{\~a}o entre vias, tendo em vista os custos associados {\`a} rede urbana. Classificado como NP-Dif{\i}́cil, algoritmos heur{\i}́sticos s{\~a}o eficazes para atingir solu{\c c}{\~o}es de qualidade, uma vez que obter a melhor solu{\c c}{\~a}o exige grande esfor{\c c}o computacional. Este artigo apresenta o algoritmo de pesquisa em vizinhan{\c c}a vari{\'a}vel General Variable Neighborhood Search (GVNS) para a resolu{\c c}{\~a}o do SNOP, bem como as estrat{\'e}gias utilizadas. Os resultados obtidos indicam que o GVNS {\'e} eficiente em tempo e qualidade de solu{\c c}{\~a}o quando comparado com outras abordagens aproximadas e exata para o problema.},
	url = {https://proceedings.science/sbpo-2019/papers/algoritmo-de-pesquisa-em-vizinhanca-variavel-aplicado-ao-problema-de-orientacao-de-redes-fortemente-conexas?lang=pt-br},
	author = {Diego Perdig{\~a}o Martino and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Matheus de Ara{\'u}jo Butinholi}
}
@conference {17774,
	title = {Dimensionamento de lotes com sele{\c c}{\~a}o de fornecedores e possibilidades de desconto no custo fixo},
	booktitle = {LI SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	volume = {2},
	year = {2019},
	pages = {108200},
	address = {Limeira, SP},
	abstract = {
	A natureza delicada das atividades hospitalares e a necessidade de manter altos n{\'\i}veis de servi{\c c}o exigem uma eficiente gest{\~a}o dos estoques de medicamentos, uma vez que eles possuem demanda derivada do tratamento de pacientes. Neste contexto, o presente trabalho apresenta uma metodologia para encontrar limites inferiores de um modelo matem{\'a}tico de dimensionamento de lote com sele{\c c}{\~a}o de fornecedores em uma farm{\'a}cia hospitalar. {\'E} proposta a implementa{\c c}{\~a}o da decomposi{\c c}{\~a}o de Dantzig-Wolfe com um m{\'e}todo de gera{\c c}{\~a}o de colunas para o modelo. Analisando os resultados obtidos pela metodologia empregada, verifica-se a obten{\c c}{\~a}o de limites inferiores melhores do que a relaxa{\c c}{\~a}o linear.

},
	url = {https://proceedings.science/sbpo-2019/papers/dimensionamento-de-lotes-com-selecao-de-fornecedores-e-possibilidades-de-desconto-no-custo-fixo?lang=pt-br},
	author = {Robson Vieira de Oliveira and Mauricio Cardoso de Souza and Thiago Augusto de Oliveira Silva}
}
@presentation {17809,
	title = {GVNS for the Strong Network Orientation Problem},
	year = {2019},
	pages = {10-11},
	abstract = {
	The majority of urban centers are experiencing structural problems due to the contrast between the intensive vehicle flow and the lack of appropriated infrastructure to handle such a traffic demand. Reorienting the streets is a possible strategy to try to address these problems. The Strong Network Orientation Problem (SNOP) stands as an alternative to handle this situation in such a way the total travel distance in a network configuration is minimized. Since the problem involves large scale systems and is considered by the literature as NP-Hard, efficient heuristics algorithms are suitable to achieve appropriate solutions. This paper presents a General Variable Neighborhood Search (GVNS) algorithm for the SNOP composed by a systematic use of four neighborhoods structures and its appliance on instances found in the literature and real cases of a city. Its building steps including local search procedures provided by a Randomized Variable Neighborhood Search (RVND) algorithm and results are also presented and discussed. Results indicate that GVNS is an efficient metaheuristic to solve SNOP, both in running time and quality solution when compared with other heuristics approaches and the exact strategy from the optimization software CPLEX for this problem.

},
	url = {https://iclc2019.site/program/book-of-abstracts},
	author = {Diego Perdig{\~a}o Martino and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Matheus de Ara{\'u}jo Butinholi}
}
@conference {18051,
	title = {Linear programming and methods of multivariate regression applied to the prediction of the refractory campaign duration in a steel company},
	booktitle = {LI SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	volume = {2},
	year = {2019},
	pages = {107721},
	address = {Limeira, SP},
	abstract = {
	When it comes to steel processes, it is known that refractory materials are responsible for a significant portion of the steel production costs. For this reason, this work aimed to understand the high variability and the low durability of the refractory campaign that compose a process of continuous casting in a large LD mill in the state of Minas Gerais , identifying the relationship between the process variables so it was possible to make estimates about the duration of its refractory campaign. For the selection of the explanatory factors, a variation of the method Stepwise was used. In each step of the algorithm, a model based on linear programming was responsible for the calculations of the linear regression coefficients. In the end, a prediction model was obtained for the duration of the campaign containing 12 explanatory factors and 97.66\% of statistical significance.

},
	url = {https://proceedings.science/sbpo-2019/papers/linear-programming-and-methods-of-multivariate-regression-applied-to-the-prediction-of-the-refractory-campaign-duration-?lang=pt-br},
	author = {Dalila Rodrigues Baesso and Marco Ant{\^o}nio Bonelli J{\'u}nior and Julio C{\'e}sar Alvarenga}
}
@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}
}
@conference {17771,
	title = {The spatial competition from the perspective of competitive strategy},
	booktitle = {XXXIX ENEGEP - Encontro Nacional de Engenharia de Produ{\c c}{\~a}o},
	year = {2019},
	pages = {1-15},
	address = {Santos, SP},
	abstract = {
	Even though the spatial competition is a crucial aspect of the competitive strategy of firms, it is still little approached in the competitive and marketing strategy literature. As such, the association between formal spatial models and the practice of spatial competition between firms should be approached. Addressing this gap in this article, we propose a more formal view of the spatial competition. Based on the concepts of the value of displacement for the customer and the value of location we present several aspects related to the difference in the location of outlets in a hypothetical city. Several measures such as market share, competitive advantage, and value of location, are calculated in this model. This article opens a new perspective to study the competitive positioning of firms in spatial markets.

},
	url = {http://www.abepro.org.br/publicacoes/artigo.asp?e=enegep\&a=2019\&c=36990},
	author = {S{\'e}rgio Evangelista Silva and Thiago Augusto de Oliveira Silva and Naira Mota Ara{\'u}jo}
}
@inbook {17770,
	title = {A stochastic dynamic model for support of the management of new product development portfolios},
	booktitle = {Pesquisa Operacional e sua Atua{\c c}{\~a}o Multidisciplinar},
	year = {2019},
	pages = {189-204},
	publisher = {Atena Editora},
	organization = {Atena Editora},
	edition = {1},
	address = {Ponta Grossa, Paran{\'a}},
	abstract = {
	New Product Development Processes are, in general, costly for organizations and since they need to coordinate the allocation of resources through several projects of the innovation funnel, the management of product portfolio aiming the the best-expected return is an important challenge. In this context, the present study aims to develop a mathematical model capable of considering, in an integrated manner, the uncertainties and the dynamicity in portfolio management. Also, we propose two heuristic policies and use the developed model as a framework for their comparison through simulation.

},
	url = {https://www.atenaeditora.com.br/arquivos/ebooks/pesquisa-operacional-e-sua-atuacao-multidisciplinar},
	author = {Samuel Martins Drei and Thiago Augusto de Oliveira Silva and Marco Ant{\^o}nio Bonelli J{\'u}nior and Luciana Paula Reis and Matheus Correia Teixeira}
}
@conference {17772,
	title = {Um modelo para an{\'a}lise de estrat{\'e}gias das montadoras atuantes na ind{\'u}stria brasileira de autom{\'o}veis via teoria dos jogos},
	booktitle = {XXXIX ENEGEP - Encontro Nacional de Engenharia de Produ{\c c}{\~a}o},
	year = {2019},
	pages = {1-23},
	address = {Santos, SP},
	abstract = {
	O setor automotivo tem relevante participa{\c c}{\~a}o na estrutura industrial nacional e dado aos seus encadeamentos pode influenciar na produ{\c c}{\~a}o de v{\'a}rios outros setores. Diante disso e da competitividade acirrada entre os concorrentes, {\'e} de extrema necessidade que este setor busque por t{\'a}ticas para garantir sua presen{\c c}a no mercado e sobreviv{\^e}ncia financeira. Assim sendo, o trabalho identificou o perfil estrat{\'e}gico de cada montadora por meio de infer{\^e}ncia estat{\'\i}stica, tendo por objetivo construir cen{\'a}rios de competi{\c c}{\~a}o estrat{\'e}gica via Teoria dos Jogos para um mercado constitu{\'\i}do de seis montadoras, que representam 85\% do mercado de autom{\'o}veis. O jogo foi modelado na categoria sedan segmentando modelos a uma faixa de pre{\c c}o de 75 a 100 mil reais com motores de 1.5 {\`a} 2.4, a fim de trabalhar com modelos que compitam de forma mais direta entre si.

},
	url = {http://www.abepro.org.br/biblioteca/TN_STO_292_1652_37310.pdf},
	author = {Marco Aur{\'e}lio Horta Martins and Matheus Correia Teixeira and Thiago Augusto de Oliveira Silva and S{\'e}rgio Evangelista Silva}
}
@conference {17633,
	title = {Utiliza{\c c}{\~a}o de fluxo m{\'a}ximo para ordena{\c c}{\~a}o de requisi{\c c}{\~a}o do problema de roteamento e aloca{\c c}{\~a}o de comprimentos de onda},
	booktitle = {XIX SPOLM - Simposio de Pesquisa Operacional e Log{\'\i}stica da Marinha},
	year = {2019},
	pages = {1-12},
	address = {Rio de Janeiro, RJ},
	abstract = {A ideia principal da pesquisa {\'e} a implementa{\c c}{\~a}o do algoritmo de fluxo m{\'a}ximo para ordena{\c c}{\~a}o das requisi{\c c}{\~o}es no problema de roteamento e aloca{\c c}{\~a}o decomprimentos de onda Routing and Wavelength Assignment (RWA) . Na literaturao problema consiste em atender as demandas definidas na topologia virtual, sendoposs{\'\i}vel destacar duas abordagens. A primeira variante {\'e} o MIN-RWA, no qual o objetivo geral {\'e} atender as requisi{\c c}{\~o}es com o menor n{\'u}mero de comprimentos deonda e a outra varia{\c c}{\~a}o {\'e} o MAX-RWA, no qual tem a finalidade de maximizar o n{\'u}mero de requisi{\c c}{\~o}e atendidas com um n{\'u}mero fixo de comprimentos de ondas. Neste estudo ser{\'a} considerado o MIN-RWA.},
	url = {https://www.marinha.mil.br/spolm/sites/www.marinha.mil.br.spolm/files/UTILIZA\%C3\%87\%C3\%83O\%20DE\%20FLUXO\%20M\%C3\%81XIMO\%20PARA\%20ORDENA\%C3\%87\%C3\%83O\%20DE\%20REQUISI\%C3\%87\%C3\%83O\%20DO\%20PROBLEMA\%20DE\%20ROTEAMENTO\%20E\%20ALOCA\%C3\%87\%C3\%83O\%20DE\%20COMPRIMENTOS\%2},
	author = {Artur de Alvarenga Silva and Bruna Silva de Morais and Alexandre Xavier Martins and Thiago Augusto de Oliveira Silva}
}
@presentation {17808,
	title = {VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem},
	year = {2019},
	pages = {7},
	abstract = {
	This paper addresses the Uncapacitated Single Allocation p-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the p-hubs within a node network in order to maximize the network coverage. We proposed a search strategy-based heuristic VNS (Variable Neighborhood Search [7]) to solve the problem. Two different sets of literature test instances, Civil Aeronautics Board (CAB) and Australian Post (AP), were used to evaluate the performance of VNS and compare it to the Tabu Search metaheuristic (TS) proposed by [11]. As a result, the VNS presented equal or slightly smaller bounds for large-scale AP instances, as well as a similar behavior was shown regarding the quality of the solutions for CAB instances. In addition, it was observed that VNS performs better than the TS algorithm in CPU running times for both CAB and AP instances.

},
	url = {https://iclc2019.site/program/book-of-abstracts},
	author = {Matheus de Ara{\'u}jo Butinholi and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Diego Perdig{\~a}o Martino}
}
@conference {17773,
	title = {Apresenta{\c c}{\~a}o de um modelo de jogos para sele{\c c}{\~a}o do portf{\'o}lio de produtos na ind{\'u}stria brasileira de caminh{\~o}es},
	booktitle = {XIX SPOLM - Simp{\'o}sio de Pesquisa Operacional e Log{\'\i}stica da Marinha},
	year = {2019},
	pages = {1-12},
	address = {Rio de Janeiro, RJ},
	abstract = {O mercado brasileiro de caminh{\~o}es {\'e} um mercado din{\^a}mico e oligopolizado e, portanto, o desenvolvimento de a{\c c}{\~o}es estrat{\'e}gicas se faz necess{\'a}rio para que a empresa se estabele{\c c}a com melhor posi{\c c}{\~a}o no mercado. Consequentemente, torna-se significativo entender melhor estrutura do mercado a partir das necessidades dos consumidores. Nesse contexto, este estudo objetiva retratar a competi{\c c}{\~a}o existente no mercado de caminh{\~o}es por meio da composi{\c c}{\~a}o de um modelo baseado em Teoriados Jogos, al{\'e}m de analisar o comportamento estrat{\'e}gico de duas montadoras decaminh{\~o}es de acordo com as categorias de produto. Como resultado, obteve-se ummodelo de jogo mais completo do que outros artigos presentes na literatura e que se demonstrou consistente frente {\`a}s suposi{\c c}{\~o}es estabelecidas.},
	url = {https://www.marinha.mil.br/spolm/sites/www.marinha.mil.br.spolm/files/APRESENTA\%C3\%87\%C3\%83O\%20DE\%20UM\%20MODELO\%20DE\%20JOGOS\%20PARA\%20SELE\%C3\%87\%C3\%83O\%20DO\%20PORTIF\%C3\%93LIO\%20DE\%20PRODUTOS\%20NA\%20IND\%C3\%9ASTRIA\%20BRASILEIRA\%20DE\%20CAMINH\%C3\%95ES.pdf},
	author = {Bianca Fialho Silva and Vera L{\'u}cia Santos Castro and Thiago Augusto de Oliveira Silva and S{\'e}rgio Evangelista Silva}
}
@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}
}
@presentation {10985,
	title = {Benders do CPLEX aplicado ao problema de orienta{\c c}{\~a}o de redes fortemente conexas},
	journal = {L Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	year = {2018},
	address = {Rio de Janeiro},
	abstract = {O crescimento demogr{\'a}fico aliado {\`a} intensa utiliza{\c c}{\~a}o de ve{\'\i}culos devido {\`a} necessidade di{\'a}ria de locomo{\c c}{\~a}o por grande parte da popula{\c c}{\~a}o tem acarretado problemas de ordem estrutural nos grandes centros urbanos, uma vez que a maioria das cidades n{\~a}o disp{\~o}e de infraestrutura adequada para controlar o intenso fluxo de tr{\^a}nsito. Uma estrat{\'e}gia para solucionar esses problemas diz respeito {\`a} reconfigura{\c c}{\~a}o das redes urbanas. O Problema da Orienta{\c c}{\~a}o em Redes Fortemente Conexas (Strong Network Orientation Problem {\textendash} SNOP) surge como uma alternativa para a resolu{\c c}{\~a}o do problema, o qual objetiva minimizar os custos associados {\`a}s dist{\^a}ncias entre os n{\'o}s de uma rede urbana por meio do remanejamento das redes j{\'a} existentes, de tal forma a estabelecer uma configura{\c c}{\~a}o de custo m{\'\i}nimo fortemente conexa. Considerando que se trata de um problema de Otimiza{\c c}{\~a}o em Sistemas de Grande Porte, a utiliza{\c c}{\~a}o de algoritmos exatos e/ou heur{\'\i}sticos possibilita a obten{\c c}{\~a}o de solu{\c c}{\~o}es eficientes vi{\'a}veis para problemas reais e fict{\'\i}cios presentes na literatura. Neste sentido, este trabalho prop{\~o}e apresentar e discutir os resultados obtidos atrav{\'e}s da resolu{\c c}{\~a}o de um modelo para o SNOP utilizando o CPLEX 12.8 e comparando seu desempenho com a estrat{\'e}gia de Benders oferecida pelo solver. Os resultados computacionais obtidos mostraram que a utiliza{\c c}{\~a}o do m{\'e}todo de Benders promove a explora{\c c}{\~a}o de um quantitativo de n{\'o}s de Branch-and-Bound e tempo computacional de resolu{\c c}{\~a}o muito superior ao CPLEX via m{\'e}todo SIMPLEX.},
	url = {https://proceedings.science/sbpo/papers/benders-do-cplex-aplicado-ao-problema-de-orientacao-de-redes-fortemente-conexas},
	author = {Diego Perdig{\~a}o Martino and Alexandre Xavier Martins and Paganini Barcellos de Oliveira}
}
@conference {17761,
	title = {Algoritmo multiobjetivo de busca adaptativa em vizinhan{\c c}a de larga escala para o sequenciamento de tarefas em m{\'a}quinas considerando consumo de energia el{\'e}trica},
	booktitle = {XXII CBA - Congresso Brasileiro de Autom{\'a}tica},
	year = {2018},
	pages = {1-8},
	address = {Jo{\~a}o Pessoa, PB},
	abstract = {
	Industries are responsible for much of the world{\textquoteright}s energy consumption and pollutant emissions. There is a growing awareness of society on these issues and the emergence of increasingly rigid laws. Thereby, industries seek ways to improve their industrial processes. This work addresses the unrelated parallel machine scheduling problem with setup times, seeking to minimize the makespan and the total energy consumption. This version of the problem that minimizes the total energy consumption has been recently introduced in the literature and until then only exact methods were employed for its resolution. In this work, we propose an adaptive heuristic algorithm that uses learning techniques to improve the search process. In the computational experiments, we use instances from the literature and the results of an exact method for validation. The results were examined by the hypervolume indicator and graphical analysis. In this experiment environment, the results suggest that the proposed algorithm obtained a good convergence to the Pareto front and showed that it has practical applicability.

},
	url = {https://ssl4799.websiteseguro.com/swge5/PROCEEDINGS/PDF/CBA2018-0559.pdf},
	author = {Luciano Perdig{\~a}o Cota and Frederico Gadelha Guimar{\~a}es and Fernando Bernardes de Oliveira and Marcone Jamilson Freitas Souza and Guilherme Murta Miranda}
}
@conference {17777,
	title = {An{\'a}lise da rela{\c c}{\~a}o entre as vendas das montadoras de caminh{\~o}es e suas estrat{\'e}gias de localiza{\c c}{\~a}o geogr{\'a}fica},
	booktitle = {XXV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	pages = {1-14},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	Nas {\'u}ltimas d{\'e}cadas o brasil se tornou o quinto maior produtor de caminh{\~o}es do mundo, sendo que em 2011 houve um faturamento l{\'\i}quido nesse ramo de noventa e tr{\^e}s bilh{\~o}es de d{\'o}lares e investimento recorde de cinco bilh{\~o}es de d{\'o}lares. O presente trabalho busca analisar o mercado de caminh{\~o}es compreendendo a rela{\c c}{\~a}o da estrat{\'e}gia de localiza{\c c}{\~a}o geogr{\'a}fica e as vendas das seis maiores montadoras realizadas no ano de 2015, a partir de regress{\~o}es lineares m{\'u}ltiplas e m{\'u}ltiplas multivariadas, utilizando dados coletados em sites governamentais e das seis maiores montadoras de caminh{\~o}es no brasil. Desta forma foi poss{\'\i}vel mapear as influ{\^e}ncias das montadoras no faturamento de suas concorrentes e os clusters envolvidos no mercado. Com a an{\'a}lise conclu{\'\i}mos que a estrat{\'e}gia de localiza{\c c}{\~a}o geogr{\'a}fica {\'e} significativa no com{\'e}rcio de caminh{\~o}es e no faturamento das montadoras. Foi desenvolvido um mapa de influ{\^e}ncia para o mercado, percebendo assim qual montadora utiliza melhor as vari{\'a}veis regionais conseguindo vantagem competitiva em um mercado t{\~a}o acirrado.

},
	url = {https://www.simpep.feb.unesp.br/anais_simpep.php?e=13},
	author = {Ykaro C{\'e}sar de Oliveira Matheus and Vera L{\'u}cia Santos Castro and Thiago Augusto de Oliveira Silva and S{\'e}rgio Evangelista Silva}
}
@conference {17637,
	title = {Aplica{\c c}{\~a}o de t{\'e}cnicas de an{\'a}lise cluster no setor imobili{\'a}rio em uma cidade do interior de Minas Gerais},
	booktitle = {VIII ConBRepro - Congresso Brasileiro de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	address = {Ponta Grossa, Paran{\'a}},
	abstract = {Esse trabalho visa investigar e compreender a similaridade entre os diferentes bairros que possuem im{\'o}veis anunciados para venda e aluguel da cidade de Jo{\~a}o Monlevade, Minas Gerais, por meio de an{\'a}lises de clusters. Trata-se de uma t{\'e}cnica de an{\'a}lise multivariada que comp{\~o}em a Engenharia da Qualidade, que {\'e} uma das grandes {\'a}reas de atua{\c c}{\~a}o da Engenharia de Produ{\c c}{\~a}o. As caracter{\'\i}sticas dos im{\'o}veis estudados s{\~a}o: pre{\c c}o; quantidade de quartos, vagas na garagem e ocorr{\^e}ncias criminais; e as dist{\^a}ncias em rela{\c c}{\~a}o ao centro comercial, postos de sa{\'u}de e escolas estaduais mais pr{\'o}ximas. Atrav{\'e}s de uma an{\'a}lise de sensibilidade utilizando-se de tr{\^e}s diferentes graus de similaridade, esse artigo identificou e comparou a forma{\c c}{\~a}o de clusters entre que os bairros com im{\'o}veis para venda e loca{\c c}{\~a}o. Foi poss{\'\i}vel perceber que existe uma maior similaridade entre os bairros com an{\'u}ncios de vendas de im{\'o}veis, quando comparados aos bairros com im{\'o}veis para loca{\c c}{\~a}o, uma vez que menos clusters foram formados.},
	url = {https://www.researchgate.net/publication/333667032_Aplicacao_de_tecnicas_de_analise_cluster_no_setor_imobiliario_em_uma_cidade_do_interior_de_Minas_Gerais},
	author = {Vanessa Silva Rosa and Paganini Barcellos de Oliveira and Rafael Lucas Machado Pinto}
}
@conference {17776,
	title = {Apresenta{\c c}{\~a}o de um prot{\'o}tipo de software para a elabora{\c c}{\~a}o da estrat{\'e}gia competitiva},
	booktitle = {XXV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	pages = {1-14},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	A estrat{\'e}gia competitiva consiste na forma como a empresa se posiciona no mercado de modo a enfrentar seus concorrentes. nota-se que os modelos de estrat{\'e}gia mais conhecidos no mercado, tais como o de estrat{\'e}gia gen{\'e}ricas de Michael Porter,, t{\^e}m como {\'u}nico ponto de an{\'a}lise da estrat{\'e}gia o produto. Todavia, uma an{\'a}lise mais pormenorizada dos aspectos relevantes na estrat{\'e}gia empresarial mostra que existem diversos fatores al{\'e}m do produto que s{\~a}o relevantes para a competitividade da empresa. baseando-se em uma vis{\~a}o da estrat{\'e}gia competitiva a partir das dimens{\~o}es produto, {\'a}rea geogr{\'a}fica de atua{\c c}{\~a}o, tipo de cliente atendido, canais de distribui{\c c}{\~a}o utilizados, canais de comunica{\c c}{\~a}o e conte{\'u}do informativo este artigo apresenta o prot{\'o}tipo de um software para a elabora{\c c}{\~a}o da estrat{\'e}gia competitiva da empresa e a an{\'a}lise das estrat{\'e}gias de seus concorrentes. Utiliza-se como m{\'e}todo a prototipagem de software, cujo prot{\'o}tipo foi elaborado de modo iterativo. Como resultado este artigo aponta para a import{\^a}ncia do desenvolvimento de softwares que facilitem o processo de elabora{\c c}{\~a}o da estrat{\'e}gia competitiva entre empresas e a an{\'a}lise dos mercados em que atuam.

},
	url = {https://www.simpep.feb.unesp.br/anais_simpep.php?e=13},
	author = {Izabela de Oliveira Santos and S{\'e}rgio Evangelista Silva and Thiago Augusto de Oliveira Silva}
}
@conference {17760,
	title = {An Efficient Heuristic For Designing of Hub-and-Spoke Networks with Cycle Topology},
	booktitle = {XIX CLAIO - Latin-Iberoamerican Conference on Operations Research},
	year = {2018},
	pages = {321-328},
	address = {Lima, Peru},
	abstract = {
	The cycle hub location problem is here addressed by a tailored parallel heuristics approach. This is a very important problem with many applications in cargo, passenger and telecommunication systems. There are many variants of this problem in the literature. We focus in the variant in which the fixed cost of hubs are not accounted, and the hub nodes are connected by cycle network and non hubs nodes must be allocated to exactly one hub. The devised solution framework outperforms the known heuristic for the problem on the selected instances, both in time and solutions{\textquoteright} quality.

},
	url = {http://www.sopios.org.pe/static/claio/proceeding.pdf},
	author = {Alexandre Xavier Martins and Rodney Rezende Saldanha}
}
@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}
}
@conference {17638,
	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},
	booktitle = {XXV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	A fim de identificar o que {\'e} mais relevante para o consumidor na escolha de um im{\'o}vel e entender as caracter{\'\i}sticas que impactam no pre{\c c}o final, este artigo visa entender a correla{\c c}{\~a}o entre as vari{\'a}veis estudadas e aplicar modelos de regress{\~a}o m{\'u}ltipla para analisar os pre{\c c}os ofertados de im{\'o}veis residenciais para loca{\c c}{\~a}o e venda na cidade de Jo{\~a}o Monlevade-Minas Gerais. Esse m{\'e}todo utiliza informa{\c c}{\~o}es referentes aos pre{\c c}os ofertados dos im{\'o}veis, juntamente com as suas caracter{\'\i}sticas estruturais e locacionais, sendo elas: quantidade de quartos e vagas na garagem, quantitativo de ocorr{\^e}ncias policiais, proximidade com o centro comercial, postos de sa{\'u}de e escolas estaduais mais pr{\'o}ximas. Como resultado, foi poss{\'\i}vel obter uma rela{\c c}{\~a}o matem{\'a}tica capaz de explicar o pre{\c c}o em fun{\c c}{\~a}o das vari{\'a}veis preditoras, bem como a rela{\c c}{\~a}o entres estas vari{\'a}veis.

},
	url = {https://www.researchgate.net/publication/333666795_Modelos_de_precificacao_para_locacao_e_venda_de_imoveis_residenciais_na_cidade_de_Joao_Monlevade_-_MG_via_regressao_linear_multivariada},
	author = {Vanessa Silva Rosa and Paganini Barcellos de Oliveira and Rafael Lucas Machado Pinto}
}
@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}
}
@inbook {17647,
	title = {A Two-Step Optimization Process for Medical Center Location and Capacity Allocation},
	booktitle = {Operations Management for Social Good. POMS - International Conference on Production and Operations Management Society},
	year = {2018},
	pages = {107-117},
	publisher = {Springer Proceedings in Business and Economics},
	organization = {Springer Proceedings in Business and Economics},
	address = {Cham},
	abstract = {
	This study aims at locating and sizing medical centers and allocating equipment to meet the community secondary care needs, since the specialized care on public Brazilian national health system is critical and chronically underfunded. Therefore, we develop a two-step optimization system and Web-based interface to provide scientific-based results to health system managers.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-030-23816-2_11},
	author = {Jo{\~a}o Fl{\'a}vio de Freitas Almeida and Luiz Ricardo Pinto and Samuel Vieira Concei{\c c}{\~a}o and Francisco Carlos Cardoso de Campos and Gilberto de Miranda J{\'u}nior},
	editor = {A. Leiras and C Gonz{\'a}lez-Calder{\'o}n and I. de Brito Junior and S. Villa and H. Yoshizaki}
}
@conference {17779,
	title = {Um modelo de jogos para a an{\'a}lise da competi{\c c}{\~a}o entre duas montadoras em um segmento ind{\'u}stria brasileira de caminh{\~o}es},
	booktitle = {XXV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	pages = {1-14},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	O mercado de caminh{\~o}es {\'e} caracterizado pelo seu alto n{\'\i}vel de competitividade e consequentemente sua alta import{\^a}ncia no cen{\'a}rio industrial brasileiro. {\`A} vista disso, entender com clareza as estrat{\'e}gias definidas por cada montadora torna-se e um ato de extrema import{\^a}ncia para perceber a conex{\~a}o entre a ind{\'u}stria e o consumidor. de modo a alcan{\c c}ar tal espectro, aplica-se uma constru{\c c}{\~a}o de cen{\'a}rio modelado de acordo com a teoria dos jogos, firmada pelas ideias da estrat{\'e}gia competitiva. apesar das aproxima{\c c}{\~o}es, foi poss{\'\i}vel perceber que o mercado a situa{\c c}{\~a}o corrente n{\~a}o representa um equil{\'\i}brio e que as empresas poderiam melhorar sua situa{\c c}{\~a}o.

},
	url = {https://www.simpep.feb.unesp.br/anais_simpep.php?e=13},
	author = {Bianca Fialho Silva and Thiago Augusto de Oliveira Silva and S{\'e}rgio Evangelista Silva}
}
@conference {17781,
	title = {Um modelo din{\^a}mico estoc{\'a}stico para o suporte {\`a} gest{\~a}o de portf{\'o}lios de projetos de desenvolvimento de novos produtos},
	booktitle = {L SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	volume = {1},
	year = {2018},
	pages = {1-12},
	address = {Rio de Janeiro, RJ},
	abstract = {
	Processos de desenvolvimento de novos produtos s{\~a}o , em geral, custosos para as organiza{\c c}{\~o}es e uma vez que estas necessitam de coordenar a aloca{\c c}{\~a}o de recursos entre v{\'a}rios projetos dentro do funil de inova{\c c}{\~a}o, a gest{\~a}o do portf{\'o}lio de produtos objetivando o melhor retorno esperado {\'e} um importante desafio. Neste contexto, o presente trabalho tem como objetivo desenvolver um modelo matem{\'a}tico capaz de considerar, de forma integrada, as incertezas e a dinamicidade na gest{\~a}o de portf{\'o}lios. Ademais, propusemos tamb{\'e}m duas pol{\'\i}ticas heur{\'\i}sticas e utilizamos o modelo como um framework para compara{\c c}{\~a}o atrav{\'e}s de simula{\c c}{\~a}o.

},
	url = {https://proceedings.science/sbpo/papers/um-modelo-dinamico-estocastico-para-o-suporte-a-gestao-de-portfolios-de-projetos-de-desenvolvimento-de-novos-produtos},
	author = {Samuel Martins Drei and Thiago Augusto de Oliveira Silva and Marco Ant{\^o}nio Bonelli J{\'u}nior and Luciana Paula Reis and Matheus Correia Teixeira}
}
@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}
}
@conference {12374,
	title = {Proposed Solutions to the Tripper Car Positioning Problem},
	booktitle = {XX ICEIS - International Conference on Enterprise Information Systems},
	year = {2018},
	pages = {344-352},
	type = {Disserta{\c c}{\~a}o de Mestrado},
	edition = {1},
	address = {Funchal, Madeira - Portugal},
	abstract = {The trippers are equipments often found in mineral processing plants. Their role is to distribute ore coming from past stages of process in a silo with several hoppers. Positioning trippers is a scheduling problem defined by position determination of the equipment through the bins and along time. The system silo-tripper was modeled as a combinatorial linear optimization program aiming to get the optimal tripper positioning. Two paradigms were used to find out an exact solution: mixed integer linear programming and dynamic programming.},
	url = {https://www.scitepress.org/Papers/2018/68063/68063.pdf},
	author = {Felipe Novaes Caldas and Alexandre Xavier Martins and Marcone Jamilson Freitas Souza}
}
@conference {17775,
	title = {Proposta de um m{\'e}todo para an{\'a}lise da rivalidade entre empresas baseado nas estrat{\'e}gias de produto e geogr{\'a}fica},
	booktitle = {XXV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2018},
	pages = {1-13},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {A competi{\c c}{\~a}o entre empresas {\'e} um fen{\^o}meno h{\'a} muito tempo estudado na {\'a}rea de estrat{\'e}gia. A priori, assume-se que empresas que atuam em uma mesma ind{\'u}stria, ou seja, fabricam produtos que s{\~a}o classificados sob uma mesma categoria, s{\~a}o competidoras entre si. Todavia, para um melhor entendimento do que realmente significa a competi{\c c}{\~a}o, {\'e} necess{\'a}rio que se lance m{\~a}o de fatores que v{\~a}o al{\'e}m do produto, como {\'e} o caso da {\'a}rea geogr{\'a}fica em que uma empresa atua. {\`A} luz do conceito de estrat{\'e}gia competitiva este artigo prop{\~o}e um m{\'e}todo para o mapeamento e an{\'a}lise do n{\'\i}vel de rivalidade entre duas empresas. O modelo {\'e} validado por meio da an{\'a}lise da rivalidade entre os principais fabricantes de caminh{\~o}es que atuam no mercado brasileiro. A principal contribui{\c c}{\~a}o deste artigo {\'e} propor um m{\'e}todo que torna fact{\'\i}vel o mapeamento e a an{\'a}lise da competi{\c c}{\~a}o entre empresas que atuam em uma mesma ind{\'u}stria, permitindo uma vis{\~a}o mais profunda sobre a maneira como ocorre a rivalidade entre empresas.},
	url = {https://www.simpep.feb.unesp.br/anais_simpep.php?e=13},
	author = {S{\'e}rgio Evangelista Silva and Thiago Augusto de Oliveira Silva and Wagner Ragi Curi Filho}
}
@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}
}
@magazinearticle {5522,
	title = {Modelo matem{\'a}tico para resolver o problema de aloca{\c c}{\~a}o de turnos de funcion{\'a}rios: um caso real\&nbsp;},
	journal = {Proceeding Series of the XXXVI International Sodebras Congress},
	volume = {12},
	number = {135},
	year = {2017},
	pages = {265-270},
	abstract = {O desafio de se escalar pessoas em turnos flex{\'\i}veis em uma empresa consiste na elabora{\c c}{\~a}o de um cronograma para aloca{\c c}{\~a}o de recursos necess{\'a}rios para executar uma atividade em um determinado per{\'\i}odo de tempo. Este trabalho tem o objetivo de propor uma otimiza{\c c}{\~a}o na programa{\c c}{\~a}o de hor{\'a}rios de turnos das faxineiras de um supermercado, atrav{\'e}s de um modelo matem{\'a}tico baseado no m{\'e}todo de Programa{\c c}{\~a}o Linear Inteira Mista, atendendo {\`a}s restri{\c c}{\~o}es do Departamento de Recursos Humanos e {\`a}s leis trabalhistas (CLT). O modelo foi desenvolvido no Lingo em interface com o MS Excel 2013. Os dados de entrada foram iterados no Lingo at{\'e} que uma solu{\c c}{\~a}o {\'o}tima fosse encontrada. A solu{\c c}{\~a}o obtida pelo modelo apresentou um resultado satisfat{\'o}rio para o supermercado, pois minimizou a varia{\c c}{\~a}o de horas trabalhadas durante a semana e distribuiu as funcion{\'a}rias de maneira uniforme nas escalas de hor{\'a}rio.},
	url = {http://sodebras.com.br/edicoes/N135.pdf},
	author = {MAYARA ALVES BARREL and RAFAEL CORREIA MOREIRA and Alexandre Xavier Martins}
}
@conference {17758,
	title = {An adaptive large neighborhood search with learning automata for the unrelated parallel machine scheduling problem},
	booktitle = {IEEE Congress on Evolutionary Computation},
	year = {2017},
	pages = {185-192},
	publisher = {IEEE},
	organization = {IEEE},
	address = {San Sebastian, Spain},
	abstract = {
	This work deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times, with the objective of minimizing the makespan. It is proposed an Adaptive Large Neighborhood Search (ALNS) metaheuristic using Learning Automata (LA) to adapt the probabilities of using removal and insertion heuristics and methods. A computable function in the LA updates the probability vector for selecting the actions, corresponding to six removal and six insertion methods. We also propose a new insertion method based on Hungarian algorithm, which is applied to solve subproblems optimally. Computational experiments are performed to verify the performance of the proposed method. A set of instances available in the literature with problems up to 150 jobs and 10 machines is employed in the experiments. The proposed LA-ALNS is compared against three other algorithms from the literature. The results suggest that our algorithm has better performance in most of cases (88\%) under the defined conditions of experiments. Statistical tests also suggest that LA-ALNS is better than the other algorithms from the literature. The proposed method is able to automatically choose the most suitable heuristics for the instance of the problem, through adaptation and learning in the Learning Automata.

},
	url = {https://ieeexplore.ieee.org/abstract/document/7969312},
	author = {Luciano Perdig{\~a}o Cota and Frederico Gadelha Guimar{\~a}es and Fernando Bernardes de Oliveira and Marcone Jamilson Freitas Souza}
}
@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}
}
@conference {17639,
	title = {Estudo de vari{\'a}veis que impactam na forma{\c c}{\~a}o dos pre{\c c}os de compra, venda e alugu{\'e}is residenciais em Jo{\~a}o Monlevade-MG},
	booktitle = {XXII CBE - Congresso Brasileiro de Economia},
	year = {2017},
	address = {Belo Horizonte, Minas Gerais},
	abstract = {
	Este trabalho objetiva descrever e apresentar algumas das vari{\'a}veis determinantes para a forma{\c c}{\~a}o dos pre{\c c}os praticados no mercado imobili{\'a}rio de compra, venda e alugu{\'e}is residenciais da cidade de Jo{\~a}o Monlevade-MG. Trata-se de uma pesquisa baseada em dados reais do ano de 2016 obtidos por meio de pesquisas em websites e visitas de campo em locais p{\'u}blicos e privados. Os dados da oferta e da demanda foram coletados e organizados em planilhas eletr{\^o}nicas, a partir de crit{\'e}rios: (i) estruturais, por tipo de im{\'o}vel (apartamento ou casa) e quantidade de c{\^o}modos; (ii) geogr{\'a}ficos, atrav{\'e}s da divis{\~a}o por bairros e suas vias de acesso; e (iii) geradores de informa{\c c}{\~a}o, pelas diferentes fontes de coleta; resultando em uma an{\'a}lise estat{\'\i}stica descritiva do mercado. Para justificar os resultados obtidos na an{\'a}lise estat{\'\i}stica foram levantados dados referentes {\`a} infraestrutura de saneamento b{\'a}sico e ao acesso a servi{\c c}os de utilidade p{\'u}blica (sa{\'u}de, educa{\c c}{\~a}o, transporte, com{\'e}rcio e seguran{\c c}a), que poderiam influenciar na decis{\~a}o de escolha dos consumidores. Fatores como a viol{\^e}ncia e a localiza{\c c}{\~a}o dos bairros em rela{\c c}{\~a}o ao centro comercial foram elementos de maior impacto na forma{\c c}{\~a}o dos pre{\c c}os.

},
	url = {https://www.researchgate.net/publication/333666926_Estudo_de_variaveis_que_impactam_na_formacao_dos_precos_de_compra_venda_e_alugueis_residenciais_em_Joao_Monlevade-MG},
	author = {Williane Cristina Ribeiro and Vanessa Silva Rosa and Paganini Barcellos de Oliveira}
}
@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}
}
@conference {17787,
	title = {The ontology of the brazilian truck industry: a product perspective},
	booktitle = {XXXVII ENEGEP - Encontro Nacional de Engenharia de Produ{\c c}{\~a}o},
	year = {2017},
	pages = {1-13},
	address = {Joinvile, SC},
	abstract = {
	This paper portrays the Braziliam truck industry from the perspective of the products (trucks) offered by the main truck assembler of this market. For this purpose it is used the concept of product ontology, where all products of this industry are grouped in a single hierarchical structure, where it is outlined their common aspects, as well as, their singularities. For attain this goal it was used the archival method, whereas it was identified all product lines of trucks offered for the six main manufactures, where together are responsible for more than 95\% of sales in this market. The use of the ontology concept to map all trucks offered in this industry, allowed to present a comprehensive and deep view, where it was possible to identify the dynamic of this industry, as well as, the strategic positioning of each assembler, according to this product portfolio.

},
	url = {http://www.abepro.org.br/biblioteca/TI_ST_244_416_31239.pdf},
	author = {S{\'e}rgio Evangelista Silva and Cl{\'a}udia Pinheiros dos Santos Francisco and Thiago Augusto de Oliveira Silva and Wagner Ragi Curi Filho}
}
@conference {17754,
	title = {Problema de localizac{\~a}o e alocac{\~a}o de centros de especialidades medicas no estado de Minas Gerais},
	booktitle = {XLIX SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	year = {2017},
	pages = {1-12},
	address = {Blumenau, SC},
	abstract = {
	This study focused on public health in the State of Minas Gerais, related to the attendance of medical specialties demands. The authors proposed a mathematical location and allocation optimization model of specialized medical centers (hospitals of medium complexity) in Minas Gerais. The model was adapted from the classic Maximal Covering Location Problem proposed in the Operational Research. The results were characterized as an analysis tool and decision support for the multidisciplinary research team, formed by engineers, physicians and government. From the results were approached also, analyzes considering the current scenario of economic crisis for resources optimization in the public health planning.

},
	url = {http://www.sbpo2017.iltc.br/pdf/168959.pdf},
	author = {T. M Sathler and S. V. Concei{\c c}{\~a}o and J. F. Almeida and Luiz Ricardo Pinto and F. C. C. Campos and Gilberto de Miranda J{\'u}nior}
}
@conference {17788,
	title = {Problema de Roteamento de Ve{\'\i}culos com M{\'u}ltiplos Dep{\'o}sitos, M{\'u}ltiplos Produtos, M{\'u}ltiplas Visitas, Coleta e Entrega Simult{\^a}nea e Divis{\~o}es de Coleta e Entrega: Um Estudo de Caso em uma Empresa do Ramo da Constru{\c c}o Civil},
	booktitle = {XLIX SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	year = {2017},
	pages = {1-12},
	address = {Blumenau, SC},
	abstract = {
	Neste problema de roteamento de ve{\'\i}culos considera-se um conjunto de recursos que ser{\~a}o compartilhados por um conjunto de canteiros de obras. A distribui{\c c}{\~a}o destes recursos {\'e} feita atrav{\'e}s de um conjunto de ve{\'\i}culos capacitados. Para cada ve{\'\i}culo h{\'a} um dep{\'o}sito distinto de onde dever{\'a} sair e para onde dever{\'a} retornar ao final da rota. Cada canteiro pode ser visitado mais deuma vez. Os recursos podem ser discretizados em itens e assim tanto coleta e entrega podem ser divis{\'\i}veis. O objetivo do problema {\'e} atender as requisi{\c c}{\~o}es com custo m{\'\i}nimo. Duas heur{\'\i}sticas construtivas foram propostas para solu{\c c}{\~a}o do problema as quais foram testadas em inst{\^a}ncias reais e em inst{\^a}ncias de testes. Resultados mostram que as heur{\'\i}sticas fornecem resultados melhores queos obtidos atualmente pela empresa, dentro de um tempo computacional fact{\'\i}vel com o horizonte de tomada de decis{\~a}o operacional.

},
	url = {http://www.sbpo2017.iltc.br/pdf/168996.pdf},
	author = {Lucas D. S. Barbosa and Thiago Augusto de Oliveira Silva and Mauricio Cardoso de Souza}
}
@conference {17757,
	title = {Um m{\'e}todo baseado em Adaptive Large Neighborhood Search para resolu{\c c}{\~a}o de um problema de sequenciamento em m{\'a}quinas paralelas},
	booktitle = {XLIX SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	year = {2017},
	pages = {1352-1363},
	address = {Blumenau, SC},
	abstract = {
	This work deals with the unrelated parallel machine scheduling problem with sequencedependent setup times, with the objective of minimizing the makespan. This problem appears in different industries as textile and chemicals, and its resolution is challenging due to its complexity. It was proposed for its resolution an algorithm based on the Adaptive Large Neighborhood Search method with learning automata to adapt the probabilities of using removal and insertion methods. One of the main insertion methods is inspired on the Hungarian algorithm, that is able to solve subproblems optimally. In the computational experiments were used a subset of instances of literature. The results were compared with two other algorithms of literature. For the experimental context the results suggest that the proposed algorithm found the best results in 93\% of cases. This can indicate the efficiency of the proposed algorithm to the established conditions.

},
	url = {http://www.sbpo2017.iltc.br/pdf/169320.pdf},
	author = {L. P. Cota and Fernando Bernardes de Oliveira and F. G. Guimar{\~a}es and M. J. F. Souza}
}
@conference {17756,
	title = {Um m{\'e}todo baseado em Estrat{\'e}gia Evolutiva para a resolu{\c c}{\~a}o do Problema de Agendamento em Competi{\c c}{\~o}es Esportivas},
	booktitle = {XLIX SBPO - Simp{\'o}sio Brasileiro de Pesquisa Operacional},
	year = {2017},
	pages = {2523-2534},
	address = {Blumenau, SC},
	abstract = {There are several factors related to Sports Competitions Problems, as economic interesting, competitiveness of teams, besides the sponsor gains. This work proposes a metaheuristic based on Evolution Strategy to deal with this class of problem. The objective is to minimize the average time spent for teams during competition. The Brazilian Football Championship was studied because of its properties and addition to the national interest to that issue. Some operators were defined to respect constraints imposed by the Brazilian Football Confederation. For the experimental context, the results suggest the proposed algorithm has a good performance. When it was compared with official tables from 2014, 2015 and 2016, the method found a smaller total travel time for teams.},
	url = {http://www.sbpo2017.iltc.br/pdf/169327.pdf},
	author = {A. J. T. Maciel Filho and Fernando Bernardes de Oliveira and Rafael Frederico Alexandre}
}
@conference {17749,
	title = {Utiliza{\c c}{\~a}o da metaheur{\'\i}stica simulated annealing para a otimiza{\c c}{\~a}o da programa{\c c}{\~a}o de turnos em uma loja varejista},
	booktitle = {XXIV SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2017},
	pages = {1-16},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	Scheduling is more present in our daily lives than we can perceive and one of its main aspects is the employees{\textquoteright} scheduling, which is this paper object of study. The objective is to develop an automated method for the employees scheduling of a retail store that meets the labor laws, the preferences of employees and the internal rules of the organization. the study is justified by the difficulty and delay in the manual construction of these schedules as they are currently made in the company under study. In addition, a balanced roster ensures greater worker satisfaction, which affects positively on their productivity, and helps to reduce costs in the organization, which no more works with missing or overstaffed. The technique used was the metaheuristic simulated annealing and the results obtained were faced with an exact method previously used in solving the problem.

},
	url = {https://simpep.feb.unesp.br/anais_simpep.php?e=12},
	author = {Izabel Cristina Vilela Santos and MAYARA ALVES BARREL and Alexandre Xavier Martins}
}
@conference {5521,
	title = {A parallel heuristics for the single allocation hub location problem},
	booktitle = {IEEE},
	year = {2017},
	pages = { 1278 - 1285},
	publisher = {IEEE Latin America Transactions },
	organization = {IEEE Latin America Transactions },
	abstract = {This paper introduces a cooperative parallel heuristic for the uncapacitated single allocation hub location problem. The proposed heuristic consists in combining multiple parallel ILS-RVND local search and Path-Relinking, cooperating through asynchronously exchanging solutions in a shared pool. This method as devised to tackle large scale instances up to 3038 nodes. Generally, papers in the literature solve problems up to 400 nodes. The combination of efficient methods of search allowed the proposed heuristic to explore efficiently the space of search, and outperformed four well known heuristics of the literature for the select instances.},
	url = {http://ieeexplore.ieee.org/document/7959347/?reload=true},
	author = {Rodrigo de Carvalho and Ricardo Saraiva de Camargo and Alexandre Xavier Martins}
}
@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}
}
@conference {17747,
	title = {An{\'a}lise e aplica{\c c}{\~a}o de t{\'e}cnicas e ferramentas para otimizar o processo de distribui{\c c}{\~a}o log{\'\i}stica de uma empresa do ramo aliment{\'\i}cio},
	booktitle = {XXIII SIMPEP - Simp{\'o}sio de Engenharia de Produ{\c c}{\~a}o},
	year = {2016},
	pages = {1-12},
	address = {Bauru, S{\~a}o Paulo},
	abstract = {
	The fast globalization in which we operate has led companies to seek and to rethink the various techniques available in the market to remain competitive. Hence, in this scenario classic problems such as location and vehicle routing is constantly increasing its relevance when it comes to quality services. In this context, this article seeks to identify the best place to install a warehouse and what are the best routes. the is company located in Leeds, UK, which operates in the ingredients market {\textquotedblleft}clean label{\textquotedblright} and than compare with the current model used by the company. thus, this paper seeks to merge classical concepts of production engineering with the expertise of a food company to create high value content for the studied company. Therefore, through the sweep algorithm were generated 39 routes totaling 18,297 km, the results also showed that with the new location suggested the company would obtain a 5\% reduction in costs per year with distribution of its products.

},
	url = {https://simpep.feb.unesp.br/anais_simpep.php?e=11},
	author = {F. C. Sales and Alexandre Xavier Martins}
}
@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}
}
@conference {13305,
	title = {Allocation of power quality monitors by Clonal Algorithm},
	booktitle = {17th International Conference on Harmonics and Quality of Power (ICHQP)},
	year = {2016},
	pages = {980-985},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper presents the application of Clonal Algorithm technique for detection of Voltage Sags and Swells with few meters, in order to monitor short-circuit conditions occurring in the electrical network. It is considered possible conditions of symmetry. These conditions make the problem even more complicated. All the proposed method steps are described, from the construction of the antibodies, cloning, mutation of clones, maturation, to the selection of novel antibodies. The algorithm starts with a large number of monitors, and then decrease this number to find a configuration with a minimum number of monitors that ensure monitoring of all short-circuit conditions. The evaluation of the methodology performance for the 63-buses network is presented.},
	url = { 10.1109/ICHQP.2016.7783392},
	author = {Paulo Estev{\~a}o Teixeira Martins and Wilingthon Guerra Zvietcovich and Thiago Augusto de Oliveira Silva and Belmir Jos{\'e} de Jesus}
}
@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}
}
@proceedings {17622,
	title = {Modelling and Solving University Course TimetablingProblems Through XHSTT},
	journal = {XI PATAT - International Confenference on Practice and Theory of Auto-mated Timetabling},
	year = {2016},
	pages = {127-138},
	address = {Udine, Italy},
	abstract = {The XHSTT was proposed as a standard format to express a wide rangeof School Timetabling problems. Although the format is powerful to represent dif-ferent timetabling features, its application to University Course Timetabling (UCT)problems was not formally studied. The goal of this work is to present encodingsfrom Curriculum-Based Course Timetabling (CB-CTT) and Post-Enrolment CourseTimetabling (PE-CTT) to XHSTT and to evaluate how a state-of-art XHSTT solverperforms on these problems. Computational experiments performed suggested that thisapproach is suitable for dealing with UCT: XHSTT solver would be ranked as fourth inCB-CTT track of the Second International Timetabling Competition (ITC2007) andit achieved feasible solutions for most PE-CTT instances within one hour. Althoughthe results do not outperform the best known approaches for these problems, XHSTTsolvers were designed to handle a wide range of features and constraints beyond the ones present in these models, making it able to fit the specific requirements of several universities.},
	url = {https://www.patatconference.org/patat2016/files/proceedings/paper_12.pdf},
	author = {George H. G. Fonseca and Haroldo G. Santos and Eduardo G. Carrano and Thomas J. R. Stidsen}
}
@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}
}
@magazinearticle {5524,
	title = {An Efficient Genetic Algorithm for the Design of Hub-and-Spoke Networks},
	volume = {17},
	number = {4},
	year = {2013},
	abstract = {We propose an efficient genetic algorithm (GA) for the design of hub-and-spoke networks with single allocation. The creation of the initial population is based on the greedy randomized search procedure, which provides high quality individuals. Furthermore, new crossover and mutation operators were implemented in order to improve the solution over the evolutionary process. Additionally, a local search procedure is applied in the best individuals. The adapted GA is tested in the Australian Post (AP) and Civil Aeronautics Board (CAB) data sets and clearly outperforms four other evolutionary algorithms of the literature, both in solution quality and CPU time.},
	url = {http://ieeexplore.ieee.org/document/6511530/},
	author = {Bruno N. Gomes and Alexandre X. Martins and Ricardo S. de Camargo}
}
@conference {5525,
	title = {GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery},
	booktitle = {Elsevier	 Electronic Notes in Discrete Mathematics Volume 39, 1 December 2012, Pages 217-224},
	volume = {39},
	year = {2012},
	pages = {217-224},
	abstract = {This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). Due to its complexity, we propose a heuristic algorithm for solving it, so-called GENVNS-TS-CL-PR. This algorithm combines the heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (PR). The first three procedures aim to obtain an good initial solution, and the VND and TS are used as local search methods for VNS. TS is called after some iterations without any improvement through of the VND. The PR procedure is called after each VNS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm uses an strategy based on Candidate List to reduce the number of solutions evaluated in the solution space. The algorithm was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.},
	url = {http://www.sciencedirect.com/science/article/pii/S1571065312000303},
	author = {Cruz R. C. and Silva T. C. B. and Souza M. J. F. and Coelho V. N. and Mine M. T. and Martins A. X.}
}
@conference {5526,
	title = {Variable neighborhood descent with iterated local search for routing and wavelength assignment},
	booktitle = {Elsevier},
	volume = {39},
	year = {2012},
	pages = {2133-2141},
	publisher = {Elsevier},
	organization = {Elsevier},
	edition = {9},
	abstract = {In this work we treat the Routing and Wavelength Assignment (RWA) with focus on minimizing the number of wavelengths to route demand requests. Lightpaths are used to carry the traffic optically between origin-destination pairs. The RWA is subjected to wavelength continuity constraints, and a particular wavelength cannot be assigned to two different lightpaths sharing a common physical link. We develop a Variable Neighborhood Descent (VND) with Iterated Local Search (ILS) for the problem. In a VND phase we try to rearrange requests between subgraphs associated to subsets of a partition of the set of lightpath requests. In a feasible solution, lightpaths belonging to a subset can be routed with the same wavelength. Thus, the purpose is to eliminate one subset of the partition. When VND fails, we perform a ILS phase to disturb the requests distribution among the subsets of the partition. An iteration of the algorithm alternates between a VND phase and a ILS phase. We report computational experiments that show VND-ILS was able to improve results upon powerful methods proposed in the literature.},
	url = {http://www.sciencedirect.com/science/article/pii/S0305054811003108},
	author = {Alexandre X. Martins and Christophe Duhamel and Philippe Mahey and Rodney R. Saldanha and Mauricio C.de Souzae}
}
@conference {5528,
	title = {A Multi-Objective Evolutionary Algorithm Based on Decomposition for Optimal Design of Yagi-Uda Antennas},
	booktitle = { IEEE Transactions on Magnetics},
	volume = {48},
	year = {2012},
	pages = {2012},
	publisher = {IEEE},
	organization = {IEEE},
	edition = {2},
	abstract = {This paper presents a multi-objective evolutionary algorithm based on decomposition (MOEA/D) to design broadband optimal Yagi-Uda antennas. A multi-objective problem is formulated to achieve maximum directivity, minimum voltage standing wave ratio and maximum front-to-back ratio. The algorithm was applied to the design of optimal 3 to 10 elements Yagi-Uda antennas, whose optimal Pareto fronts are provided in a single picture. The multi-objective problem is decomposed by Chebyshev decomposition, and it is solved by differential evolution (DE) and Gaussian mutation operators in order to provide a better approximation of the Pareto front. The results show that the implemented MOEA/D is efficient for designing Yagi-Uda antennas.}
}
@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}
}
@magazinearticle {5603,
	title = {Um modelo de programa{\c c}{\~a}o matem{\'a}tica para otimizar a composi{\c c}{\~a}o de lotes de min{\'e}rio de ferro da mina Cau{\^e} da CVRD },
	journal = {Revista Escola de Minas},
	volume = {59},
	number = {3},
	year = {2006},
	abstract = {Esse trabalho tem seu enfoque no problema de blendagem de produtos de min{\'e}rio de ferro, estocados nos p{\'a}tios da mina Cau{\^e}, da Companhia Vale do Rio Doce, em Itabira, Minas Gerais, para a composi{\c c}{\~a}o de lotes. Prop{\~o}e-se um modelo de programa{\c c}{\~a}o linear por metas que visa a determinar os locais de retomada dos produtos estocados, de tal forma que a mistura atenda aos limites de especifica{\c c}{\~o}es de qualidade e quantidade preestabelecidos pelo cliente e satisfa{\c c}a as restri{\c c}{\~o}es operacionais dos p{\'a}tios. O modelo de programa{\c c}{\~a}o matem{\'a}tica desenvolvido foi implementado no modelador e otimizador LINGO 9.0, interfaceando com planilhas do EXCEL 2000, possibilitando a utiliza{\c c}{\~a}o e exporta{\c c}{\~a}o de dados em um ambiente familiar {\`a} empresa de minera{\c c}{\~a}o. O sistema desenvolvido foi validado comparando-se os resultados obtidos com os produzidos manualmente pela empresa. Os resultados computacionais apresentados comprovaram que {\'e} poss{\'\i}vel prover uma melhora na composi{\c c}{\~a}o dos lotes atrav{\'e}s do modelo proposto.},
	url = {http://www.scielo.br/scielo.php?script=sci_arttext\&pid=S0370-44672006000300008},
	author = {Edilaila Fernandes Moraes and Jos{\'e} Maria do Carmo Bento Alves and Marcone Jamilson Freitas Souza and Ivo Eyer Cabral and Alexandre Xavier Martins}
}
@conference {5518,
	title = {Um Algoritmo Simulated Annealing Eficiente para o Problema de Roteamento de Ve{\'\i}culos com Janela de Tempo},
	booktitle = {XXV Encontro Nac. de Eng. de Produ{\c c}{\~a}o},
	year = {2005},
	abstract = {Este trabalho apresenta um algoritmo eficiente, baseado na metaheur{\'\i}stica Simulated Annealing (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 dentro de um intervalo de tempo determinado, chamado janela de tempo. A metodologia proposta, denominada SA-RAI, incorpora ao algoritmo Simulated Annealing 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. Ainda 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 inst{\^a}ncias-teste da literatura e 13 novos melhores resultados foram encontrados.},
	url = {http://www.abepro.org.br/biblioteca/enegep2005_enegep0608_0902.pdf},
	author = {Alo{\'\i}sio de Castro Gomes J{\'u}nior and Marcone Jamilson Freitas Souza and Alexandre Xavier Martins}
}
@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}
}
