<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Rachid Benmansour</style></author><author><style face="normal" font="default" size="100%">Angelo Sifaleras</style></author><author><style face="normal" font="default" size="100%">Nenad Mladenović</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Variable Neighborhood Search</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-44932-2_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">126-138</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;This paper addresses the Uncapacitated Single Allocation &lt;/span&gt;&lt;/span&gt;&lt;em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;p&lt;/span&gt;&lt;/span&gt;&lt;/em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the &lt;/span&gt;&lt;/span&gt;&lt;em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;p&lt;/span&gt;&lt;/span&gt;&lt;/em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;-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.&lt;/span&gt;&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Ivan Contreras</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A comparison of separation routines for benders optimality cuts for two-level facility location problems</style></title><secondary-title><style face="normal" font="default" size="100%">Expert Systems with Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0957417419306463</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">141</style></volume><pages><style face="normal" font="default" size="100%">112928</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Mauricio Cardoso de Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Surgical scheduling under uncertainty by approximate dynamic programming</style></title><secondary-title><style face="normal" font="default" size="100%">Omega</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.omega.2019.05.002</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">95</style></volume><pages><style face="normal" font="default" size="100%">102066</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luciano Perdigão Cota</style></author><author><style face="normal" font="default" size="100%">Frederico Gadelha Guimarães</style></author><author><style face="normal" font="default" size="100%">Roberto G. Ribeiro</style></author><author><style face="normal" font="default" size="100%">Ivan R. Meneghini</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Patrick Siarry</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem</style></title><secondary-title><style face="normal" font="default" size="100%">Swarm and Evolutionary Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.swevo.2019.100601</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">51</style></volume><pages><style face="normal" font="default" size="100%">100601</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom: 0.28cm; text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Algoritmo de descida em vizinhança variável aplicado ao problema de cobertura máxima de p-eixos não capacitados com alocação simples</style></title><secondary-title><style face="normal" font="default" size="100%">LI SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Limeira, SP</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">107798</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;O presente artigo aborda o problema de cobertura máxima de p-eixos não capacitados com alocação simples (Uncapacitated Single Allocation p-hub Maximal Covering Problem - USApHMCP), que objetiva maximizar a cobertura de um conjunto de nós de uma rede através de p-eixos. Uma heurística baseada na estratégia de busca em descida com vizinhança variável (Variable Neighborhood Descent - VND) foi desenvolvida para o problema. Dois diferentes conjuntos de instâncias, Civil Aeronautics Board (CAB) e Australian Post (AP), são utilizados para avaliar e comparar o desempenho do VND à metaheurística Busca Tabu (Tabu Search - TS) encontrada na literatura. Como resultado, o VND apresentou limites superiores melhores para instâncias de grande porte (AP), bem como um desempenho médio ligeiramente superior em tempo computacional de resolução para as instâncias CAB, de menor porte.&lt;/span&gt;&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Algoritmo de pesquisa em vizinhança variável aplicado ao problema de orientação de redes fortemente conexas</style></title><secondary-title><style face="normal" font="default" size="100%">LI SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://proceedings.science/sbpo-2019/papers/algoritmo-de-pesquisa-em-vizinhanca-variavel-aplicado-ao-problema-de-orientacao-de-redes-fortemente-conexas?lang=pt-br</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Limeira, SP</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">107799</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;A infraestrutura inadequada e o intenso fluxo de pessoas e veı́culos resultam em problemas associados às vias urbanas no mundo. O Problema de Orientação de Redes Fortemente Conexas (Strong Network Orientation Problem – SNOP) é uma alternativa para amenizar esse cenário na medida em que objetiva minimizar a soma das distâncias percorridas a partir de cada ponto de interseção entre vias, tendo em vista os custos associados à rede urbana. Classificado como NP-Difı́cil, algoritmos heurı́sticos são eficazes para atingir soluções de qualidade, uma vez que obter a melhor solução exige grande esforço computacional. Este artigo apresenta o algoritmo de pesquisa em vizinhança variável General Variable Neighborhood Search (GVNS) para a resolução do SNOP, bem como as estratégias utilizadas. Os resultados obtidos indicam que o GVNS é eficiente em tempo e qualidade de solução quando comparado com outras abordagens aproximadas e exata para o problema.&lt;/span&gt;&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Robson Vieira de Oliveira</style></author><author><style face="normal" font="default" size="100%">Mauricio Cardoso de Souza</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dimensionamento de lotes com seleção de fornecedores e possibilidades de desconto no custo fixo</style></title><secondary-title><style face="normal" font="default" size="100%">LI SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://proceedings.science/sbpo-2019/papers/dimensionamento-de-lotes-com-selecao-de-fornecedores-e-possibilidades-de-desconto-no-custo-fixo?lang=pt-br</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Limeira, SP</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">108200</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;A natureza delicada das atividades hospitalares e a necessidade de manter altos níveis de serviço exigem uma eficiente gestã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ático de dimensionamento de lote com seleção de fornecedores em uma farmácia hospitalar. É proposta a implementação da decomposição de Dantzig-Wolfe com um método de geração de colunas para o modelo. Analisando os resultados obtidos pela metodologia empregada, verifica-se a obtenção de limites inferiores melhores do que a relaxação linear.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GVNS for the Strong Network Orientation Problem</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://iclc2019.site/program/book-of-abstracts</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">10-11</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;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&lt;/span&gt;.
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dalila Rodrigues Baesso</style></author><author><style face="normal" font="default" size="100%">Marco Antônio Bonelli Júnior</style></author><author><style face="normal" font="default" size="100%">Julio César Alvarenga</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Linear programming and methods of multivariate regression applied to the prediction of the refractory campaign duration in a steel company</style></title><secondary-title><style face="normal" font="default" size="100%">LI SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Limeira, SP</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">107721</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:14px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vanessa Silva Rosa</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Rafael Lucas Machado Pinto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modelos de precificação para locação e venda de imóveis residenciais na cidade de João Monlevade-MG via regressão linear multivariada</style></title><secondary-title><style face="normal" font="default" size="100%">Revista GEPROS - Gestão da Produção, Operações e Sistemas</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://revista.feb.unesp.br/index.php/gepros/article/view/2614</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">14</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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 “price” 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ã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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Samuel Martins Drei</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A multi-criteria Approach to the Problem of Managing the new Product Development Project Portfolio</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Advanced Engineering Research and Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ijaers.com/detail/a-multi-criteria-approach-to-the-problem-of-managing-the-new-product-development-project-portfolio/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">257-264</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">8</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paulo Estevão Teixeira Martins</style></author><author><style face="normal" font="default" size="100%">Wilingthon Guerra Zvietcovich</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multi-objective Approach for Power Quality Monitor Allocation with Symmetry in Short-Duration Voltage Variations</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Power Delivery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">10.1109/TPWRD.2018.2890233</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">430 - 437</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Naira Mota Araújo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The spatial competition from the perspective of competitive strategy</style></title><secondary-title><style face="normal" font="default" size="100%">XXXIX ENEGEP - Encontro Nacional de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.abepro.org.br/publicacoes/artigo.asp?e=enegep&amp;a=2019&amp;c=36990</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Santos, SP</style></pub-location><pages><style face="normal" font="default" size="100%">1-15</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Samuel Martins Drei</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Marco Antônio Bonelli Júnior</style></author><author><style face="normal" font="default" size="100%">Luciana Paula Reis</style></author><author><style face="normal" font="default" size="100%">Matheus Correia Teixeira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A stochastic dynamic model for support of the management of new product development portfolios</style></title><secondary-title><style face="normal" font="default" size="100%">Pesquisa Operacional e sua Atuação Multidisciplinar</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.atenaeditora.com.br/arquivos/ebooks/pesquisa-operacional-e-sua-atuacao-multidisciplinar</style></url></web-urls></urls><edition><style face="normal" font="default" size="100%">1</style></edition><publisher><style face="normal" font="default" size="100%">Atena Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Ponta Grossa, Paraná</style></pub-location><pages><style face="normal" font="default" size="100%">189-204</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;t m0 xd h3 y1d ff2 fs1 fc0 sc0 ls0 ws2&quot; style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;span class=&quot;_ _1&quot;&gt; &lt;/span&gt;Also, we propose two heuristic policies and use the developed model as a framework for their comparison through simulation.&lt;/span&gt;&lt;/span&gt;
&lt;/div&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marco Aurélio Horta Martins</style></author><author><style face="normal" font="default" size="100%">Matheus Correia Teixeira</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um modelo para análise de estratégias das montadoras atuantes na indústria brasileira de automóveis via teoria dos jogos</style></title><secondary-title><style face="normal" font="default" size="100%">XXXIX ENEGEP - Encontro Nacional de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.abepro.org.br/biblioteca/TN_STO_292_1652_37310.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Santos, SP</style></pub-location><pages><style face="normal" font="default" size="100%">1-23</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;O setor automotivo tem relevante participação na estrutura industrial nacional e dado aos seus encadeamentos pode influenciar na produção de vários outros setores. Diante disso e da competitividade acirrada entre os concorrentes, é de extrema necessidade que este setor busque por táticas para garantir sua presença no mercado e sobrevivência financeira. Assim sendo, o trabalho identificou o perfil estratégico de cada montadora por meio de inferência estatística, tendo por objetivo construir cenários de competição estratégica via Teoria dos Jogos para um mercado constituído de seis montadoras, que representam 85% do mercado de automóveis. O jogo foi modelado na categoria sedan segmentando modelos a uma faixa de preço de 75 a 100 mil reais com motores de 1.5 à 2.4, a fim de trabalhar com modelos que compitam de forma mais direta entre si.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Artur de Alvarenga Silva</style></author><author><style face="normal" font="default" size="100%">Bruna Silva de Morais</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Utilização de fluxo máximo para ordenação de requisição do problema de roteamento e alocação de comprimentos de onda</style></title><secondary-title><style face="normal" font="default" size="100%">XIX SPOLM - Simposio de Pesquisa Operacional e Logística da Marinha</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Rio de Janeiro, RJ</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;left:212.598px;top:938.709px;19.9253px;sans-serif;transform:scaleX(0.808368);&quot;&gt;A ideia principal da pesquisa é a implementação do algoritmo de fluxo&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:962.785px;19.9253px;sans-serif;transform:scaleX(0.812689);&quot;&gt; máximo para ordenação das requisições no problema de roteamento e alocação de&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:986.862px;19.9253px;sans-serif;transform:scaleX(0.841178);&quot;&gt;comprimentos de onda &lt;/span&gt;&lt;span style=&quot;left:342.177px;top:986.862px;19.9253px;sans-serif;transform:scaleX(0.848123);&quot;&gt;Routing and Wavelength Assignment &lt;/span&gt;&lt;span style=&quot;left:659.567px;top:986.862px;19.9253px;sans-serif;transform:scaleX(0.926373);&quot;&gt;(RWA) . Na literatura&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1010.94px;19.9253px;sans-serif;transform:scaleX(0.851751);&quot;&gt;o problema consiste em atender as demandas definidas na topologia virtual, sendo&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1035.01px;19.9253px;sans-serif;transform:scaleX(0.872739);&quot;&gt;possível destacar duas abordagens. A primeira variante é o MIN-RWA, no qual o&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1059.09px;19.9253px;sans-serif;transform:scaleX(0.781319);&quot;&gt; objetivo geral é atender as requisições com o menor número de comprimentos de&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1083.17px;19.9253px;sans-serif;transform:scaleX(0.875981);&quot;&gt;onda e a outra variação é o MAX-RWA, no qual tem a finalidade de maximizar o&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1107.24px;19.9253px;sans-serif;transform:scaleX(0.833709);&quot;&gt; número de requisiçõe atendidas com um número fixo de comprimentos de ondas. &lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1131.32px;19.9253px;sans-serif;transform:scaleX(0.863116);&quot;&gt;Neste estudo será considerado o MIN-RWA.&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://iclc2019.site/program/book-of-abstracts</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">7</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bianca Fialho Silva</style></author><author><style face="normal" font="default" size="100%">Vera Lúcia Santos Castro</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Apresentação de um modelo de jogos para seleção do portfólio de produtos na indústria brasileira de caminhões</style></title><secondary-title><style face="normal" font="default" size="100%">XIX SPOLM - Simpósio de Pesquisa Operacional e Logística da Marinha</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Rio de Janeiro, RJ</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;left:212.598px;top:807.124px;19.9253px;sans-serif;transform:scaleX(0.817679);&quot;&gt;O mercado brasileiro de caminhões é um mercado dinâmico e oligopolizado&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:831.2px;19.9253px;sans-serif;transform:scaleX(0.771117);&quot;&gt; e, portanto, o desenvolvimento de ações estratégicas se faz necessário para que a &lt;/span&gt;&lt;span style=&quot;left:141.732px;top:855.277px;19.9253px;sans-serif;transform:scaleX(0.822107);&quot;&gt;empresa se estabeleça com melhor posição no mercado. Consequentemente, torna-&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:879.354px;19.9253px;sans-serif;transform:scaleX(0.837651);&quot;&gt;se significativo entender melhor estrutura do mercado a partir das necessidades dos&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:903.43px;19.9253px;sans-serif;transform:scaleX(0.825954);&quot;&gt; consumidores. Nesse contexto, este estudo objetiva retratar a competição existente &lt;/span&gt;&lt;span style=&quot;left:141.732px;top:927.505px;19.9253px;sans-serif;transform:scaleX(0.813612);&quot;&gt;no mercado de caminhões por meio da composição de um modelo baseado em Teoria&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:951.582px;19.9253px;sans-serif;transform:scaleX(0.795359);&quot;&gt;dos Jogos, além de analisar o comportamento estratégico de duas montadoras de&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:975.659px;19.9253px;sans-serif;transform:scaleX(0.83964);&quot;&gt;caminhões de acordo com as categorias de produto. Como resultado, obteve-se um&lt;/span&gt;&lt;span style=&quot;left:141.732px;top:999.735px;19.9253px;sans-serif;transform:scaleX(0.834714);&quot;&gt;modelo de jogo mais completo do que outros artigos presentes na literatura e que se &lt;/span&gt;&lt;span style=&quot;left:141.732px;top:1023.81px;19.9253px;sans-serif;transform:scaleX(0.796603);&quot;&gt;demonstrou consistente frente às suposições estabelecidas.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Mauricio C. de Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Surgical scheduling under uncertainty by approximate dynamic programming</style></title><secondary-title><style face="normal" font="default" size="100%">Omega</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.omega.2019.05.002</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">95</style></volume><pages><style face="normal" font="default" size="100%">102066</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Benders do CPLEX aplicado ao problema de orientação de redes fortemente conexas</style></title><secondary-title><style face="normal" font="default" size="100%">L Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://proceedings.science/sbpo/papers/benders-do-cplex-aplicado-ao-problema-de-orientacao-de-redes-fortemente-conexas</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Rio de Janeiro</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">O crescimento demográfico aliado à intensa utilização de veículos devido à necessidade diária de locomoção por grande parte da população tem acarretado problemas de ordem estrutural nos grandes centros urbanos, uma vez que a maioria das cidades não dispõe de infraestrutura adequada para controlar o intenso fluxo de trânsito. Uma estratégia para solucionar esses problemas diz respeito à reconfiguração das redes urbanas. O Problema da Orientação em Redes Fortemente Conexas (Strong Network Orientation Problem – SNOP) surge como uma alternativa para a resolução do problema, o qual objetiva minimizar os custos associados às distâncias entre os nós de uma rede urbana por meio do remanejamento das redes já existentes, de tal forma a estabelecer uma configuração de custo mínimo fortemente conexa. Considerando que se trata de um problema de Otimização em Sistemas de Grande Porte, a utilização de algoritmos exatos e/ou heurísticos possibilita a obtenção de soluções eficientes viáveis para problemas reais e fictícios presentes na literatura. Neste sentido, este trabalho propõe apresentar e discutir os resultados obtidos através da resolução de um modelo para o SNOP utilizando o CPLEX 12.8 e comparando seu desempenho com a estratégia de Benders oferecida pelo solver. Os resultados computacionais obtidos mostraram que a utilização do método de Benders promove a exploração de um quantitativo de nós de Branch-and-Bound e tempo computacional de resolução muito superior ao CPLEX via método SIMPLEX.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luciano Perdigão Cota</style></author><author><style face="normal" font="default" size="100%">Frederico Gadelha Guimarães</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Guilherme Murta Miranda</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Algoritmo multiobjetivo de busca adaptativa em vizinhança de larga escala para o sequenciamento de tarefas em máquinas considerando consumo de energia elétrica</style></title><secondary-title><style face="normal" font="default" size="100%">XXII CBA - Congresso Brasileiro de Automática</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ssl4799.websiteseguro.com/swge5/PROCEEDINGS/PDF/CBA2018-0559.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">João Pessoa, PB</style></pub-location><pages><style face="normal" font="default" size="100%">1-8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;Industries are responsible for much of the world’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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ykaro César de Oliveira Matheus</style></author><author><style face="normal" font="default" size="100%">Vera Lúcia Santos Castro</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Análise da relação entre as vendas das montadoras de caminhões e suas estratégias de localização geográfica</style></title><secondary-title><style face="normal" font="default" size="100%">XXV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.simpep.feb.unesp.br/anais_simpep.php?e=13</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-14</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;h2 class=&quot;western&quot; style=&quot;font-weight: normal; text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;font style=&quot;14pt&quot;&gt;Nas últimas décadas o brasil se tornou o quinto maior produtor de caminhões do mundo, sendo que em 2011 houve um faturamento líquido nesse ramo de noventa e três bilhões de dólares e investimento recorde de cinco bilhões de dólares. O presente trabalho busca analisar o mercado de caminhões compreendendo a relação da estratégia de localização geográfica e as vendas das seis maiores montadoras realizadas no ano de 2015, a partir de regressões lineares múltiplas e múltiplas multivariadas, utilizando dados coletados em sites governamentais e das seis maiores montadoras de caminhões no brasil. Desta forma foi possível mapear as influências das montadoras no faturamento de suas concorrentes e os clusters envolvidos no mercado. Com a análise concluímos que a estratégia de localização geográfica é significativa no comércio de caminhões e no faturamento das montadoras. Foi desenvolvido um mapa de influência para o mercado, percebendo assim qual montadora utiliza melhor as variáveis regionais conseguindo vantagem competitiva em um mercado tão acirrado.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/h2&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vanessa Silva Rosa</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Rafael Lucas Machado Pinto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Aplicação de técnicas de análise cluster no setor imobiliário em uma cidade do interior de Minas Gerais</style></title><secondary-title><style face="normal" font="default" size="100%">VIII ConBRepro - Congresso Brasileiro de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/333667032_Aplicacao_de_tecnicas_de_analise_cluster_no_setor_imobiliario_em_uma_cidade_do_interior_de_Minas_Gerais</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Ponta Grossa, Paraná</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;Esse trabalho visa investigar e compreender a similaridade entre os diferentes bairros que possuem imóveis anunciados para venda e aluguel da cidade de João Monlevade, Minas Gerais, por meio de análises de clusters. Trata-se de uma técnica de análise multivariada que compõem a Engenharia da Qualidade, que é uma das grandes áreas de atuação da Engenharia de Produção. As características dos imóveis estudados são: preço; quantidade de quartos, vagas na garagem e ocorrências criminais; e as distâncias em relação ao centro comercial, postos de saúde e escolas estaduais mais próximas. Através de uma análise de sensibilidade utilizando-se de três diferentes graus de similaridade, esse artigo identificou e comparou a formação de clusters entre que os bairros com imóveis para venda e locação. Foi possível perceber que existe uma maior similaridade entre os bairros com anúncios de vendas de imóveis, quando comparados aos bairros com imóveis para locação, uma vez que menos clusters foram formados.&lt;/span&gt;&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Izabela de Oliveira Santos</style></author><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Apresentação de um protótipo de software para a elaboração da estratégia competitiva</style></title><secondary-title><style face="normal" font="default" size="100%">XXV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.simpep.feb.unesp.br/anais_simpep.php?e=13</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-14</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom: 0cm; text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;font-weight:normal&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;14pt&quot;&gt;A estraté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égia mais conhecidos no mercado, tais como o de estratégia genéricas de Michael Porter,, têm como único ponto de análise da estratégia o produto. Todavia, uma análise mais pormenorizada dos aspectos relevantes na estratégia empresarial mostra que existem diversos fatores além do produto que são relevantes para a competitividade da empresa. baseando-se em uma visão da estratégia competitiva a partir das dimensões produto, área geográfica de atuação, tipo de cliente atendido, canais de distribuição utilizados, canais de comunicação e conteúdo informativo este artigo apresenta o protótipo de um software para a elaboração da estratégia competitiva da empresa e a análise das estratégias de seus concorrentes. Utiliza-se como método a prototipagem de software, cujo protótipo foi elaborado de modo iterativo. Como resultado este artigo aponta para a importância do desenvolvimento de softwares que facilitem o processo de elaboração da estratégia competitiva entre empresas e a análise dos mercados em que atuam.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Rodney Rezende Saldanha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Efficient Heuristic For Designing of Hub-and-Spoke Networks with Cycle Topology</style></title><secondary-title><style face="normal" font="default" size="100%">XIX CLAIO - Latin-Iberoamerican Conference on Operations Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sopios.org.pe/static/claio/proceeding.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Lima, Peru</style></pub-location><pages><style face="normal" font="default" size="100%">321-328</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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’ quality.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jéssica da Silva Soares Cunha</style></author><author><style face="normal" font="default" size="100%">Márbia Fernandes Pereira de Araújo</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Wagner Ragi Curi Filho</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Feira livre de João Monlevade: diagnóstico socioeconômico, estrutural e sistema de governança</style></title><secondary-title><style face="normal" font="default" size="100%">Revista UFG</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.revistas.ufg.br/revistaufg/article/view/51709</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">17</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;A crescente procura por alimentos saudáveis e sem agrotóxico e o ambiente propício para o convívio social atrai pessoas de diferentes perfis às feiras livres. Dessa forma, o objetivo do presente estudo é avaliar os aspectos essenciais referentes à estrutura física, social e econômica da Feira Livre de João Monlevade sob perspectiva de consumidores, não consumidores e feirantes e propor um novo sistema de governança de feira. Para isto, foram utilizados recursos como visitas &lt;/span&gt;&lt;/font&gt;&lt;em&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;in loco,&lt;/span&gt;&lt;/font&gt;&lt;/em&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt; observação, verbalizações estruturais, conversas informais e pesquisas bibliográficas. Neste contexto, esta pesquisa possibilitou o conhecimento mais aprofundado sobre a realidade da Feira Livre de João Monlevade e consequentemente, através do apoio dos órgãos responsáveis locais, será possível realizar reparos adequados que possam torná-la uma importante forma de manifestação cultural na cidade e um local de entretenimento para os diferentes públicos presentes na sociedade.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">21</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luiza Bernardes Real</style></author><author><style face="normal" font="default" size="100%">Morton O'Kelly</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The gateway hub location problem</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Air Transport Management</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0969699717304647</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">73</style></volume><pages><style face="normal" font="default" size="100%">95-112</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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 &lt;/font&gt;&lt;font color=&quot;#0000ff&quot;&gt;&lt;u&gt;&lt;a href=&quot;https://www.sciencedirect.com/topics/social-sciences/integer-programming&quot;&gt;&lt;font color=&quot;#00000a&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;integer programming&lt;/font&gt;&lt;/font&gt;&lt;/a&gt;&lt;/u&gt;&lt;/font&gt;&lt;font style=&quot;12pt&quot;&gt; formulation that exploits these differences to model both the local and global flows. Due to the formulation'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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Josiane da Costa Vieira Rezende</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Vitor Nazário Coelho</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">HMS: A hybrid multi-start algorithm for solving binary linear programs</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Discrete Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.endm.2018.03.002</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">66</style></volume><pages><style face="normal" font="default" size="100%">7-14</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jean Carlos Tibúrcio Campos</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Discrete Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S1571065318300672</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">66</style></volume><pages><style face="normal" font="default" size="100%">159-166</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.42cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Felipo Bacani</style></author><author><style face="normal" font="default" size="100%">Stylianos Dimas</style></author><author><style face="normal" font="default" size="100%">Igor Leite Freire</style></author><author><style face="normal" font="default" size="100%">Norberto Anibal Maidana</style></author><author><style face="normal" font="default" size="100%">Mariano Torrisi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mathematical modelling for the transmission of dengue: Symmetry and travelling wave analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Nonlinear Analysis: Real World Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S1468121817301608</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">41</style></volume><pages><style face="normal" font="default" size="100%">269-287</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;In this paper we propose some mathematical models for the transmission of dengue using a system of reaction–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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vanessa Silva Rosa</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Rafael Lucas Machado Pinto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modelos de precificação para locação e venda de imóveis residenciais na cidade de João Monlevade - MG via regressão linear multivariada</style></title><secondary-title><style face="normal" font="default" size="100%">XXV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;A fim de identificar o que é mais relevante para o consumidor na escolha de um imóvel e entender as características que impactam no preço final, este artigo visa entender a correlação entre as variáveis estudadas e aplicar modelos de regressão múltipla para analisar os preços ofertados de imóveis residenciais para locação e venda na cidade de João Monlevade-Minas Gerais. Esse método utiliza informações referentes aos preços ofertados dos imóveis, juntamente com as suas características estruturais e locacionais, sendo elas: quantidade de quartos e vagas na garagem, quantitativo de ocorrências policiais, proximidade com o centro comercial, postos de saúde e escolas estaduais mais próximas. Como resultado, foi possível obter uma relação matemática capaz de explicar o preço em função das variáveis preditoras, bem como a relação entres estas variáveis.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tatiana Alves Costa</style></author><author><style face="normal" font="default" size="100%">Patrícia N. Pena</style></author><author><style face="normal" font="default" size="100%">Ricardo H. C. Takahashi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sco-concat: a solution to a planning problem in flexible manufacturing systems using supervisory control theory and optimization techniques</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Control, Automation and Electrical Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s40313-018-0386-7</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">500-511</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;This work presents a modified version of the SCO (Supervisory Control and Optimization) methodology, proposed in Pena et al. (Inf Sci 329:491–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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">João Flávio de Freitas Almeida</style></author><author><style face="normal" font="default" size="100%">Luiz Ricardo Pinto</style></author><author><style face="normal" font="default" size="100%">Samuel Vieira Conceição</style></author><author><style face="normal" font="default" size="100%">Francisco Carlos Cardoso de Campos</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">A. Leiras</style></author><author><style face="normal" font="default" size="100%">C González-Calderón</style></author><author><style face="normal" font="default" size="100%">I. de Brito Junior</style></author><author><style face="normal" font="default" size="100%">S. Villa</style></author><author><style face="normal" font="default" size="100%">H. Yoshizaki</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Two-Step Optimization Process for Medical Center Location and Capacity Allocation</style></title><secondary-title><style face="normal" font="default" size="100%">Operations Management for Social Good. POMS - International Conference on Production and Operations Management Society</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-23816-2_11</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Proceedings in Business and Economics</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">107-117</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bianca Fialho Silva</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um modelo de jogos para a análise da competição entre duas montadoras em um segmento indústria brasileira de caminhões</style></title><secondary-title><style face="normal" font="default" size="100%">XXV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.simpep.feb.unesp.br/anais_simpep.php?e=13</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-14</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;h2 class=&quot;western&quot; style=&quot;font-weight: normal; text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;font style=&quot;14pt&quot;&gt;O mercado de caminhões é caracterizado pelo seu alto nível de competitividade e consequentemente sua alta importância no cenário industrial brasileiro. À vista disso, entender com clareza as estratégias definidas por cada montadora torna-se e um ato de extrema importância para perceber a conexão entre a indústria e o consumidor. de modo a alcançar tal espectro, aplica-se uma construção de cenário modelado de acordo com a teoria dos jogos, firmada pelas ideias da estratégia competitiva. apesar das aproximações, foi possível perceber que o mercado a situação corrente não representa um equilíbrio e que as empresas poderiam melhorar sua situação.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/h2&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Samuel Martins Drei</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Marco Antônio Bonelli Júnior</style></author><author><style face="normal" font="default" size="100%">Luciana Paula Reis</style></author><author><style face="normal" font="default" size="100%">Matheus Correia Teixeira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um modelo dinâmico estocástico para o suporte à gestão de portfólios de projetos de desenvolvimento de novos produtos</style></title><secondary-title><style face="normal" font="default" size="100%">L SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://proceedings.science/sbpo/papers/um-modelo-dinamico-estocastico-para-o-suporte-a-gestao-de-portfolios-de-projetos-de-desenvolvimento-de-novos-produtos</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Rio de Janeiro, RJ</style></pub-location><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;Processos de desenvolvimento de novos produtos são , em geral, custosos para as organizações e uma vez que estas necessitam de coordenar a alocação de recursos entre vários projetos dentro do funil de inovação, a gestão do portfólio de produtos objetivando o melhor retorno esperado é um importante desafio. Neste contexto, o presente trabalho tem como objetivo desenvolver um modelo matemático capaz de considerar, de forma integrada, as incertezas e a dinamicidade na gestão de portfólios. Ademais, propusemos também duas políticas heurísticas e utilizamos o modelo como um framework para comparação através de simulação.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">João Flávio de Freitas Almeida</style></author><author><style face="normal" font="default" size="100%">Samuel Vieira Conceição</style></author><author><style face="normal" font="default" size="100%">Luiz Ricardo Pinto</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Flexibility evaluation of multiechelon supply chains</style></title><secondary-title><style face="normal" font="default" size="100%">PLOS ONE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0194050</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">1-27</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sergio Evangelista Silva</style></author><author><style face="normal" font="default" size="100%">Wagner Ragi Curi Filho</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto Oliveira Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Product value dimensions and strategic decisions</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Engineering, Architecture and Technology Innovation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1590/S0101-74382009000300003</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">2-19</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div&gt;&lt;p style=&quot;text-align: justify;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&amp;nbsp;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;/div&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Felipe Novaes Caldas</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proposed Solutions to the Tripper Car Positioning Problem</style></title><secondary-title><style face="normal" font="default" size="100%">XX ICEIS - International Conference on Enterprise Information Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.scitepress.org/Papers/2018/68063/68063.pdf</style></url></web-urls></urls><edition><style face="normal" font="default" size="100%">1</style></edition><pub-location><style face="normal" font="default" size="100%">Funchal, Madeira - Portugal</style></pub-location><pages><style face="normal" font="default" size="100%">344-352</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm; margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;font-size: 12pt&quot;&gt;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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Dissertação de Mestrado</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Wagner Ragi Curi Filho</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proposta de um método para análise da rivalidade entre empresas baseado nas estratégias de produto e geográfica</style></title><secondary-title><style face="normal" font="default" size="100%">XXV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.simpep.feb.unesp.br/anais_simpep.php?e=13</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-13</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;h2 class=&quot;western&quot; style=&quot;text-align: justify;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;font style=&quot;14pt&quot;&gt;A competição entre empresas é um fenômeno há muito&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;font style=&quot;14pt&quot;&gt; tempo estudado na área de estratégia. A priori, assume-se que empresas que atuam em uma mesma indústria, ou seja, fabricam produtos que são classificados sob uma mesma categoria, são competidoras entre si. Todavia, para um melhor entendimento do que realmente significa a competição, é necessário que se lance mão de fatores que vão além do produto, como é o caso da área geográfica em que uma empresa atua. À luz do conceito de estratégia competitiva este artigo propõe um método para o mapeamento e análise do nível de rivalidade entre duas empresas. O modelo é validado por meio da análise da rivalidade entre os principais fabricantes de caminhões que atuam no mercado brasileiro. A principal contribuição deste artigo é propor um método que torna factível o mapeamento e a análise da competição entre empresas que atuam em uma mesma indústria, permitindo uma visão mais profunda sobre a maneira como ocorre a rivalidade entre empresas.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/h2&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Christophe Duhamel</style></author><author><style face="normal" font="default" size="100%">Andréa Cynthia Santos</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A column generation approach for the strong network orientation problem</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Discrete Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S1571065317302524</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">62</style></volume><pages><style face="normal" font="default" size="100%">75-80</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>19</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">MAYARA ALVES BARREL</style></author><author><style face="normal" font="default" size="100%">RAFAEL CORREIA MOREIRA</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modelo matemático para resolver o problema de alocação de turnos de funcionários: um caso real&amp;nbsp;</style></title><secondary-title><style face="normal" font="default" size="100%">Proceeding Series of the XXXVI International Sodebras Congress</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://sodebras.com.br/edicoes/N135.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">265-270</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">O desafio de se escalar pessoas em turnos flexíveis em uma empresa consiste na elaboração de um cronograma para alocação de recursos necessários para executar uma atividade em um determinado período de tempo. Este trabalho tem o objetivo de propor uma otimização na programação de horários de turnos das faxineiras de um supermercado, através de um modelo matemático baseado no método de Programação Linear Inteira Mista, atendendo às restrições do Departamento de Recursos Humanos e à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é que uma solução ótima fosse encontrada. A solução obtida pelo modelo apresentou um resultado satisfatório para o supermercado, pois minimizou a variação de horas trabalhadas durante a semana e distribuiu as funcionárias de maneira uniforme nas escalas de horário.</style></abstract><issue><style face="normal" font="default" size="100%">135</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luciano Perdigão Cota</style></author><author><style face="normal" font="default" size="100%">Frederico Gadelha Guimarães</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An adaptive large neighborhood search with learning automata for the unrelated parallel machine scheduling problem</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/7969312</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">San Sebastian, Spain</style></pub-location><pages><style face="normal" font="default" size="100%">185-192</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom: 0.28cm; text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Felipo Bacani</style></author><author><style face="normal" font="default" size="100%">Laécio C. de Barros</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Application of prediction models using fuzzy sets: a Bayesian inspired approach</style></title><secondary-title><style face="normal" font="default" size="100%">Fuzzy Sets and Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0165011416302792</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">319</style></volume><pages><style face="normal" font="default" size="100%">104-116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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'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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Williane Cristina Ribeiro</style></author><author><style face="normal" font="default" size="100%">Vanessa Silva Rosa</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Estudo de variáveis que impactam na formação dos preços de compra, venda e aluguéis residenciais em João Monlevade-MG</style></title><secondary-title><style face="normal" font="default" size="100%">XXII CBE - Congresso Brasileiro de Economia</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">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</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Belo Horizonte, Minas Gerais</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;Este trabalho objetiva descrever e apresentar algumas das variáveis determinantes para a formação dos preços praticados no mercado imobiliário de compra, venda e aluguéis residenciais da cidade de Joã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úblicos e privados. Os dados da oferta e da demanda foram coletados e organizados em planilhas eletrônicas, a partir de critérios: (i) estruturais, por tipo de imóvel (apartamento ou casa) e quantidade de cômodos; (ii) geográficos, através da divisão por bairros e suas vias de acesso; e (iii) geradores de informação, pelas diferentes fontes de coleta; resultando em uma análise estatística descritiva do mercado. Para justificar os resultados obtidos na análise estatística foram levantados dados referentes à infraestrutura de saneamento básico e ao acesso a serviços de utilidade pública (saúde, educação, transporte, comércio e segurança), que poderiam influenciar na decisão de escolha dos consumidores. Fatores como a violência e a localização dos bairros em relação ao centro comercial foram elementos de maior impacto na formação dos preços.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author><author><style face="normal" font="default" size="100%">Morton E. O’Kelly</style></author><author><style face="normal" font="default" size="100%">James F. Campbell</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Mathematical Modelling</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0307904X17304274</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">51</style></volume><pages><style face="normal" font="default" size="100%">274-301</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;The incomplete hub location problem with and without hop-constraints is modeled using a &lt;/span&gt;&lt;i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;Leontief substitution system&lt;/span&gt;&lt;/i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt; approach. The &lt;/span&gt;&lt;i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;Leontief&lt;/span&gt;&lt;/i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt; 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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">George H. G. Fonseca</style></author><author><style face="normal" font="default" size="100%">Haroldo G. Santos</style></author><author><style face="normal" font="default" size="100%">Eduardo G. Carrano</style></author><author><style face="normal" font="default" size="100%">Thomas J. R. Stidsen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integer programming techniques for educational timetabling</style></title><secondary-title><style face="normal" font="default" size="100%">European Journal of Operational Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0377221717302242</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">262</style></volume><pages><style face="normal" font="default" size="100%">28-39</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rodrigo de Carvalho</style></author><author><style face="normal" font="default" size="100%">Bruno Nonato Gomes</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Rodney Rezende Saldanha</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A multi-start heuristic for the design of hub-and-spoke networks</style></title><secondary-title><style face="normal" font="default" size="100%">Proceeding Series of the Brazilian Society of Computational and Applied Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.5540/03.2017.005.01.0471</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">5</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#fbfbf3&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sérgio Evangelista Silva</style></author><author><style face="normal" font="default" size="100%">Cláudia Pinheiros dos Santos Francisco</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Wagner Ragi Curi Filho</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The ontology of the brazilian truck industry: a product perspective</style></title><secondary-title><style face="normal" font="default" size="100%">XXXVII ENEGEP - Encontro Nacional de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.abepro.org.br/biblioteca/TI_ST_244_416_31239.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Joinvile, SC</style></pub-location><pages><style face="normal" font="default" size="100%">1-13</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;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.&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">T. M Sathler</style></author><author><style face="normal" font="default" size="100%">S. V. Conceição</style></author><author><style face="normal" font="default" size="100%">J. F. Almeida</style></author><author><style face="normal" font="default" size="100%">Luiz Ricardo Pinto</style></author><author><style face="normal" font="default" size="100%">F. C. C. Campos</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Problema de localizacão e alocacão de centros de especialidades medicas no estado de Minas Gerais</style></title><secondary-title><style face="normal" font="default" size="100%">XLIX SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sbpo2017.iltc.br/pdf/168959.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Blumenau, SC</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lucas D. S. Barbosa</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Mauricio Cardoso de Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Problema de Roteamento de Veículos com Múltiplos Depósitos, Múltiplos Produtos, Múltiplas Visitas, Coleta e Entrega Simultânea e Divisões de Coleta e Entrega: Um Estudo de Caso em uma Empresa do Ramo da Construço Civil</style></title><secondary-title><style face="normal" font="default" size="100%">XLIX SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sbpo2017.iltc.br/pdf/168996.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Blumenau, SC</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;left:220.025px;top:525.418px;18.1817px;sans-serif;transform:scaleX(0.811485);&quot;&gt;Neste problema de roteamento de veí&lt;/span&gt;&lt;span style=&quot;left:493.488px;top:525.418px;18.1817px;sans-serif;transform:scaleX(0.829434);&quot;&gt;culos considera-se um conjunto de recursos que&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:548px;18.1817px;sans-serif;transform:scaleX(0.785179);&quot;&gt; serão&lt;/span&gt;&lt;span style=&quot;left:158.208px;top:548px;18.1817px;sans-serif;transform:scaleX(0.809729);&quot;&gt; compartilhados por um conjunto de canteiros de obras. A distribuição&lt;/span&gt;&lt;span style=&quot;left:673.4px;top:548px;18.1817px;sans-serif;transform:scaleX(0.788997);&quot;&gt; destes recursos é&lt;/span&gt;&lt;span style=&quot;left:809.948px;top:548px;18.1817px;sans-serif;transform:scaleX(0.792338);&quot;&gt; feita &lt;/span&gt;&lt;span style=&quot;left:137.008px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.765564);&quot;&gt;através&lt;/span&gt;&lt;span style=&quot;left:172.99px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.79123);&quot;&gt; de um conjunto de veículos&lt;/span&gt;&lt;span style=&quot;left:348.65px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.801737);&quot;&gt; capacitados. Para cada veícul&lt;/span&gt;&lt;span style=&quot;left:582.755px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.846526);&quot;&gt;o há&lt;/span&gt;&lt;span style=&quot;left:632.695px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.782667);&quot;&gt; um depós&lt;/span&gt;&lt;span style=&quot;left:699.228px;top:570.581px;18.1817px;sans-serif;transform:scaleX(0.807718);&quot;&gt;ito distinto de onde&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:593.163px;18.1817px;sans-serif;transform:scaleX(0.777534);&quot;&gt; deverá&lt;/span&gt;&lt;span style=&quot;left:176.662px;top:593.163px;18.1817px;sans-serif;transform:scaleX(0.812447);&quot;&gt; sair e para onde deverá&lt;/span&gt;&lt;span style=&quot;left:354.593px;top:593.163px;18.1817px;sans-serif;transform:scaleX(0.82053);&quot;&gt; retornar ao final da rota. Cada canteiro pode ser visitado mais de&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:615.745px;18.1817px;sans-serif;transform:scaleX(0.808675);&quot;&gt;uma vez. Os recursos podem ser discretizados em itens e assim tanto coleta e entrega podem ser&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:638.328px;18.1817px;sans-serif;transform:scaleX(0.851434);&quot;&gt; divisíveis&lt;/span&gt;&lt;span style=&quot;left:171.917px;top:638.328px;18.1817px;sans-serif;transform:scaleX(0.82868);&quot;&gt;. O objetivo do problema é&lt;/span&gt;&lt;span style=&quot;left:401.383px;top:638.328px;18.1817px;sans-serif;transform:scaleX(0.779551);&quot;&gt; atender as requisições&lt;/span&gt;&lt;span style=&quot;left:552.852px;top:638.328px;18.1817px;sans-serif;transform:scaleX(0.813334);&quot;&gt; com custo mínimo&lt;/span&gt;&lt;span style=&quot;left:678.103px;top:638.328px;18.1817px;sans-serif;transform:scaleX(0.827437);&quot;&gt;. Duas heurísticas &lt;/span&gt;&lt;span style=&quot;left:137.008px;top:660.91px;18.1817px;sans-serif;transform:scaleX(0.788188);&quot;&gt;construtivas foram propostas para solução&lt;/span&gt;&lt;span style=&quot;left:425.702px;top:660.91px;18.1817px;sans-serif;transform:scaleX(0.794715);&quot;&gt; do problema as quais foram testadas em instân&lt;/span&gt;&lt;span style=&quot;left:770.618px;top:660.91px;18.1817px;sans-serif;transform:scaleX(0.797249);&quot;&gt;cias reais &lt;/span&gt;&lt;span style=&quot;left:137.008px;top:683.491px;18.1817px;sans-serif;transform:scaleX(0.773803);&quot;&gt;e em instâ&lt;/span&gt;&lt;span style=&quot;left:202.003px;top:683.491px;18.1817px;sans-serif;transform:scaleX(0.786518);&quot;&gt;ncias de testes. Resultados mostram que as heurísticas&lt;/span&gt;&lt;span style=&quot;left:557.512px;top:683.491px;18.1817px;sans-serif;transform:scaleX(0.797849);&quot;&gt; fornecem resultados melhores que&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:706.073px;18.1817px;sans-serif;transform:scaleX(0.804804);&quot;&gt;os obtidos atualmente pela empresa, dentro de um tempo computacional factí&lt;/span&gt;&lt;span style=&quot;left:702.782px;top:706.073px;18.1817px;sans-serif;transform:scaleX(0.832482);&quot;&gt;vel com o horizonte&lt;/span&gt;&lt;span style=&quot;left:137.008px;top:728.655px;18.1817px;sans-serif;transform:scaleX(0.784483);&quot;&gt; de tomada de decis&lt;/span&gt;&lt;span style=&quot;left:276.87px;top:728.565px;18.1817px;sans-serif;transform:scaleX(1.00908);&quot;&gt;ão&lt;/span&gt;&lt;span style=&quot;left:275.86px;top:728.655px;18.1817px;sans-serif;transform:scaleX(0.804868);&quot;&gt; operacional.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">L. P. Cota</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">F. G. Guimarães</style></author><author><style face="normal" font="default" size="100%">M. J. F. Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um método baseado em Adaptive Large Neighborhood Search para resolução de um problema de sequenciamento em máquinas paralelas</style></title><secondary-title><style face="normal" font="default" size="100%">XLIX SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sbpo2017.iltc.br/pdf/169320.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Blumenau, SC</style></pub-location><pages><style face="normal" font="default" size="100%">1352-1363</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">A. J. T. Maciel Filho</style></author><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">Rafael Frederico Alexandre</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um método baseado em Estratégia Evolutiva para a resolução do Problema de Agendamento em Competições Esportivas</style></title><secondary-title><style face="normal" font="default" size="100%">XLIX SBPO - Simpósio Brasileiro de Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sbpo2017.iltc.br/pdf/169327.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Blumenau, SC</style></pub-location><pages><style face="normal" font="default" size="100%">2523-2534</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Izabel Cristina Vilela Santos</style></author><author><style face="normal" font="default" size="100%">MAYARA ALVES BARREL</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Utilização da metaheurística simulated annealing para a otimização da programação de turnos em uma loja varejista</style></title><secondary-title><style face="normal" font="default" size="100%">XXIV SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://simpep.feb.unesp.br/anais_simpep.php?e=12</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-16</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;S&lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;cheduling is more present in our daily lives than we can perceive and one of its main aspects is the employees’ scheduling, which is this paper object of study. &lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;T&lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;he objective is to develop an automated method for the employees scheduling &lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;of&lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt; 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. &lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;I&lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;n 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. &lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;T&lt;/font&gt;&lt;/font&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;he technique used was the metaheuristic simulated annealing and the results obtained were faced with an exact method previously used in solving the problem.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rodrigo de Carvalho</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A parallel heuristics for the single allocation hub location problem</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/document/7959347/?reload=true</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Latin America Transactions </style></publisher><pages><style face="normal" font="default" size="100%"> 1278 - 1285</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Christophe Duhamel</style></author><author><style face="normal" font="default" size="100%">Philippe Mahey</style></author><author><style face="normal" font="default" size="100%">Alexandre X. Martins</style></author><author><style face="normal" font="default" size="100%">Rodney R. Saldanha</style></author><author><style face="normal" font="default" size="100%">Rodney R. Saldanha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem</style></title><secondary-title><style face="normal" font="default" size="100%">4OR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10288-016-0309-z</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">14</style></volume><pages><style face="normal" font="default" size="100%"> 201–220</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">F. C. Sales</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Análise e aplicação de técnicas e ferramentas para otimizar o processo de distribuição logística de uma empresa do ramo alimentício</style></title><secondary-title><style face="normal" font="default" size="100%">XXIII SIMPEP - Simpósio de Engenharia de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://simpep.feb.unesp.br/anais_simpep.php?e=11</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Bauru, São Paulo</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:0.34cm&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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 “clean label” 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.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Patrícia N. Pena</style></author><author><style face="normal" font="default" size="100%">Tatiana Alves Costa</style></author><author><style face="normal" font="default" size="100%">Regiane S. Silva</style></author><author><style face="normal" font="default" size="100%">Ricardo H. C. Takahashi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Control of Flexible Manufacturing Systems under model uncertainty using Supervisory Control Theory and evolutionary computation schedule synthesis</style></title><secondary-title><style face="normal" font="default" size="100%">Information Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S002002551500691X</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">329</style></volume><pages><style face="normal" font="default" size="100%">491-502</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:108%&quot;&gt;&lt;font color=&quot;#000000&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fernando Bernardes de Oliveira</style></author><author><style face="normal" font="default" size="100%">Rasul Enayatifar</style></author><author><style face="normal" font="default" size="100%">Hossein  Javedani Sadaei</style></author><author><style face="normal" font="default" size="100%">Frederico Gadelha Guimarães</style></author><author><style face="normal" font="default" size="100%">Jean-Yves Potvin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem</style></title><secondary-title><style face="normal" font="default" size="100%">Expert Systems with Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0957417415005771</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">117-130</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font face=&quot;Arial, serif&quot;&gt;&lt;font size=&quot;3&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;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.&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">George Henrique Godim da Fonseca</style></author><author><style face="normal" font="default" size="100%">Haroldo Gambini Santos</style></author><author><style face="normal" font="default" size="100%">Túlio Ângelo Machado Toffolo</style></author><author><style face="normal" font="default" size="100%">Samuel Souza Brito</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GOAL solver: a hybrid local search based solver for high school timetabling</style></title><secondary-title><style face="normal" font="default" size="100%">Annals of Operations Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10479-014-1685-4</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">239</style></volume><pages><style face="normal" font="default" size="100%">77-97</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font face=&quot;Arial, serif&quot;&gt;&lt;font size=&quot;3&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">George H. G. Fonseca</style></author><author><style face="normal" font="default" size="100%">Haroldo G. Santos</style></author><author><style face="normal" font="default" size="100%">Eduardo G. Carrano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Late acceptance hill-climbing for high school timetabling</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Scheduling</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10951-015-0458-5</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">453-465</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font face=&quot;Arial, serif&quot;&gt;&lt;font size=&quot;3&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marina Soares Almeida</style></author><author><style face="normal" font="default" size="100%">Mônica do Amaral</style></author><author><style face="normal" font="default" size="100%">Reinaldo Morabito</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um estudo sobre localização de terminais intermodais na rede de escoamento da soja brasileira</style></title><secondary-title><style face="normal" font="default" size="100%">Production</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.scielo.br/pdf/prod/v26n3/0103-6513-prod-0103-6513144513.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">26</style></volume><pages><style face="normal" font="default" size="100%">562-580</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;A soja é um dos principais produtos agrícolas brasileiros. Do total colhido, aproximadamente 40% é destinado à exportação. Como as lavouras estão concentradas principalmente na região central no país, essa soja percorre, em geral, grandes distâncias até os portos marítimos. Nesse caso, o transporte intermodal pode tornar mais eficiente e econômica a movimentação de grandes volumes por longas distâncias. Analisa-se, neste estudo, a aplicação de um modelo de programação matemática para apoiar decisões de fluxo de soja e localização de terminais intermodais. Com base em dados secundários, foram propostas três redes alternativas de escoamento, com diferentes áreas de abrangência e possibilidade de utilização de ferrovias ainda em construção ou projeto. Foram considerados os principais estados produtores e movimentadores da soja. Experimentos computacionais resultaram em fluxos de escoamento e localização de terminais condizentes com a realidade. Cenários alternativos da rede também foram analisados, evidenciando o potencial de análise dessa ferramenta de otimização.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paulo Estevão Teixeira Martins</style></author><author><style face="normal" font="default" size="100%">Wilingthon Guerra Zvietcovich</style></author><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Belmir José de Jesus</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Allocation of power quality monitors by Clonal Algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">17th International Conference on Harmonics and Quality of Power (ICHQP)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%"> 10.1109/ICHQP.2016.7783392</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pages><style face="normal" font="default" size="100%">980-985</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">George H. G. Fonseca</style></author><author><style face="normal" font="default" size="100%">Haroldo G. Santos</style></author><author><style face="normal" font="default" size="100%">Eduardo G. Carrano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating matheuristics and metaheuristics for timetabling</style></title><secondary-title><style face="normal" font="default" size="100%">Computers &amp; Operations Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0305054816300879</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">74</style></volume><pages><style face="normal" font="default" size="100%">108-117</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font face=&quot;Arial, serif&quot;&gt;&lt;font size=&quot;3&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;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.&lt;/span&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/span&gt;&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">George H. G. Fonseca</style></author><author><style face="normal" font="default" size="100%">Haroldo G. Santos</style></author><author><style face="normal" font="default" size="100%">Eduardo G. Carrano</style></author><author><style face="normal" font="default" size="100%">Thomas J. R. Stidsen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modelling and Solving University Course TimetablingProblems Through XHSTT</style></title><secondary-title><style face="normal" font="default" size="100%">XI PATAT - International Confenference on Practice and Theory of Auto-mated Timetabling</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.patatconference.org/patat2016/files/proceedings/paper_12.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Udine, Italy</style></pub-location><pages><style face="normal" font="default" size="100%">127-138</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;left:195.327px;top:517.284px;14.944px;sans-serif;transform:scaleX(0.922359);&quot;&gt;The XHSTT was proposed as a standard format to express a wide range&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:536.379px;14.944px;sans-serif;transform:scaleX(0.933823);&quot;&gt;of School Timetabling problems. Although the format is powerful to represent dif-&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:555.474px;14.944px;sans-serif;transform:scaleX(0.929297);&quot;&gt;ferent timetabling features, its application to University Course Timetabling (UCT)&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:574.569px;14.944px;sans-serif;transform:scaleX(0.938376);&quot;&gt;problems was not formally studied. The goal of this work is to present encodings&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:593.664px;14.944px;sans-serif;transform:scaleX(0.952355);&quot;&gt;from Curriculum-Based Course Timetabling (CB-CTT) and Post-Enrolment Course&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:612.759px;14.944px;sans-serif;transform:scaleX(0.96512);&quot;&gt;Timetabling (PE-CTT) to XHSTT and to evaluate how a state-of-art XHSTT solver&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:631.854px;14.944px;sans-serif;transform:scaleX(0.854852);&quot;&gt;performs on these problems. Computational experiments performed suggested that this&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:650.949px;14.944px;sans-serif;transform:scaleX(0.898855);&quot;&gt;approach is suitable for dealing with UCT: XHSTT solver would be ranked as fourth in&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:670.044px;14.944px;sans-serif;transform:scaleX(0.941428);&quot;&gt;CB-CTT track of the Second International Timetabling Competition (ITC2007) and&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:689.139px;14.944px;sans-serif;transform:scaleX(0.926312);&quot;&gt;it achieved feasible solutions for most PE-CTT instances within one hour. Although&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:708.234px;14.944px;sans-serif;transform:scaleX(0.88914);&quot;&gt;the results do not outperform the best known approaches for these problems, XHSTT&lt;/span&gt;&lt;span style=&quot;left:120.002px;top:727.329px;14.944px;sans-serif;transform:scaleX(0.886421);&quot;&gt;solvers were designed to handle a wide range of features and constraints beyond the &lt;/span&gt;&lt;span style=&quot;left:120.002px;top:225.345px;14.944px;sans-serif;transform:scaleX(0.872979);&quot;&gt;ones present in these models, making it able to fit the specific requirements of several &lt;/span&gt;&lt;span style=&quot;left:120.002px;top:244.44px;14.944px;sans-serif;transform:scaleX(0.86477);&quot;&gt;universities.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Thiago A.O.Silva</style></author><author><style face="normal" font="default" size="100%">Mauricio C. de Souza</style></author><author><style face="normal" font="default" size="100%">Rodney R. Saldanha</style></author><author><style face="normal" font="default" size="100%">Edmund K.Burke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Surgical scheduling with simultaneous employment of specialised human resources</style></title><secondary-title><style face="normal" font="default" size="100%">European Journal of Operational Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.ejor.2015.04.008</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">245</style></volume><pages><style face="normal" font="default" size="100%">719-730</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>19</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bruno N. Gomes</style></author><author><style face="normal" font="default" size="100%">Alexandre X. Martins</style></author><author><style face="normal" font="default" size="100%">Ricardo S. de Camargo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Efficient Genetic Algorithm for the Design of Hub-and-Spoke Networks</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/document/6511530/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">17</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cruz R. C.</style></author><author><style face="normal" font="default" size="100%">Silva T. C. B.</style></author><author><style face="normal" font="default" size="100%">Souza M. J. F.</style></author><author><style face="normal" font="default" size="100%">Coelho V. N.</style></author><author><style face="normal" font="default" size="100%">Mine M. T.</style></author><author><style face="normal" font="default" size="100%">Martins A. X.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery</style></title><secondary-title><style face="normal" font="default" size="100%">Elsevier	 Electronic Notes in Discrete Mathematics Volume 39, 1 December 2012, Pages 217-224</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S1571065312000303</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">217-224</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre X. Martins</style></author><author><style face="normal" font="default" size="100%">Christophe Duhamel</style></author><author><style face="normal" font="default" size="100%">Philippe Mahey</style></author><author><style face="normal" font="default" size="100%">Rodney R. Saldanha</style></author><author><style face="normal" font="default" size="100%">Mauricio C.de Souzae</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Variable neighborhood descent with iterated local search for routing and wavelength assignment</style></title><secondary-title><style face="normal" font="default" size="100%">Elsevier</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0305054811003108</style></url></web-urls></urls><edition><style face="normal" font="default" size="100%">9</style></edition><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">2133-2141</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">A Multi-Objective Evolutionary Algorithm Based on Decomposition for Optimal Design of Yagi-Uda Antennas</style></title><secondary-title><style face="normal" font="default" size="100%"> IEEE Transactions on Magnetics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><edition><style face="normal" font="default" size="100%">2</style></edition><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">2012</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eduardo Uchoa</style></author><author><style face="normal" font="default" size="100%">Túlio A. M. Toffolo</style></author><author><style face="normal" font="default" size="100%">Mauricio C. de Souza</style></author><author><style face="normal" font="default" size="100%">Alexandre X. Martins</style></author><author><style face="normal" font="default" size="100%">Ricardo Fukasawa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem</style></title><secondary-title><style face="normal" font="default" size="100%">Networks</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://onlinelibrary.wiley.com/doi/10.1002/net.20485/abstract</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Christophe Duhamel</style></author><author><style face="normal" font="default" size="100%">Mauricio Cardoso de Souza</style></author><author><style face="normal" font="default" size="100%">Rodney Rezende Saldanha</style></author><author><style face="normal" font="default" size="100%">Philippe Mahey</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A VND-ILS Heuristic to Solve the RWA Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Network Optimization</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007%2F978-3-642-21527-8_64</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%"> 577-582</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre X. Martins</style></author><author><style face="normal" font="default" size="100%">Mauricio C. de Souza</style></author><author><style face="normal" font="default" size="100%">Marcone J. F. Souza</style></author><author><style face="normal" font="default" size="100%">Túlio A. M. Toffolo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Heuristics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007%2Fs10732-008-9079-x</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">133–151</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Thiago Augusto de Oliveira Silva</style></author><author><style face="normal" font="default" size="100%">Leonardo P. Santiago</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">New product development projects evaluation under time uncertainty</style></title><secondary-title><style face="normal" font="default" size="100%">Pesquisa Operacional</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">517-532</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;span id=&quot;yui_3_14_1_1_1559952871059_153&quot;&gt;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.&lt;/span&gt;</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>19</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Edilaila Fernandes Moraes</style></author><author><style face="normal" font="default" size="100%">José Maria do Carmo Bento Alves</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Ivo Eyer Cabral</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um modelo de programação matemática para otimizar a composição de lotes de minério de ferro da mina Cauê da CVRD </style></title><secondary-title><style face="normal" font="default" size="100%">Revista Escola de Minas</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0370-44672006000300008</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">59</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Esse trabalho tem seu enfoque no problema de blendagem de produtos de minério de ferro, estocados nos pátios da mina Cauê, da Companhia Vale do Rio Doce, em Itabira, Minas Gerais, para a composição de lotes. Propõe-se um modelo de programaçã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ções de qualidade e quantidade preestabelecidos pelo cliente e satisfaça as restrições operacionais dos pátios. O modelo de programação matemática desenvolvido foi implementado no modelador e otimizador LINGO 9.0, interfaceando com planilhas do EXCEL 2000, possibilitando a utilização e exportação de dados em um ambiente familiar à empresa de mineração. O sistema desenvolvido foi validado comparando-se os resultados obtidos com os produzidos manualmente pela empresa. Os resultados computacionais apresentados comprovaram que é possível prover uma melhora na composição dos lotes através do modelo proposto.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aloísio de Castro Gomes Júnior</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Um Algoritmo Simulated Annealing Eficiente para o Problema de Roteamento de Veículos com Janela de Tempo</style></title><secondary-title><style face="normal" font="default" size="100%">XXV Encontro Nac. de Eng. de Produção</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.abepro.org.br/biblioteca/enegep2005_enegep0608_0902.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Este trabalho apresenta um algoritmo eficiente, baseado na metaheurística Simulated Annealing (SA), para resolver o Problema de Roteamento de Veículos com Janela de Tempo. Esse problema tem como objetivo determinar as rotas de custo mínimo para uma frota de veículos de mesma capacidade, atendendo à 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ássico, mecanismos auto-adaptativos para determinação da temperatura inicial e número de iterações em uma mesma temperatura. Ainda nesta metodologia, quando a temperatura atinge um valor limiar, a mesma é reaquecida um certo número de vezes, possibilitando escapar de ótimos locais. Além disso, ela conta com uma fase de intensificação. Sempre que uma melhor solução é encontrada, ela é submetida a um procedimento de refinamento, visando ao seu melhoramento. A metodologia foi aplicada a 168 instâncias-teste da literatura e 13 novos melhores resultados foram encontrados.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aloísio de Castro Gomes Júnior</style></author><author><style face="normal" font="default" size="100%">Marcone Jamilson Freitas Souza</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Simulated annealing aplicado à resolução do problema de roteamento de veículos com janela de tempo</style></title><secondary-title><style face="normal" font="default" size="100%">ANPET - Associação Nacional de Pesquisa e Ensino em Transportes</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.revistatransportes.org.br/anpet/article/view/98</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">13</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Este trabalho apresenta um algoritmo eficiente, baseado na metaheurística&amp;nbsp;&lt;em&gt;Simulated Annealing&amp;nbsp;&lt;/em&gt;(SA), para resolver o Problema de Roteamento de Veículos com Janela de Tempo. Esse problema tem como objetivo determinar as rotas de custo mínimo para uma frota de veículos de mesma capacidade, atendendo à demanda de um conjunto de clientes, para os quais o atendimento somente é possível dentro de um intervalo de tempo determinado, chamado janela de tempo. A metodologia proposta, denominada SA-RAI, incorpora ao algoritmo&amp;nbsp;&lt;em&gt;Simulated Annealing&amp;nbsp;&lt;/em&gt;clássico, mecanismos auto-adaptativos para determinação da temperatura inicial e número de iterações em uma mesma temperatura. Nesta metodologia, quando a temperatura atinge um valor limiar, a mesma é reaquecida um certo número de vezes, possibilitando escapar de ótimos locais. Além disso, ela conta com uma fase de intensificação. Sempre que uma melhor solução é encontrada, ela é 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.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>