Dans cette thèse, nous considérons le problème du séquencement sur une ligne de montage multi-modèles de véhicules industriels. Pour équilibrer au mieux la charge dynamique des opérateurs, la minimisation de la somme des retards à l’issue de chaque véhicule est proposée.Deux approches peuvent être utilisées pour optimiser le lissage de charge dans un problème de séquencement : l’utilisation directe des temps opératoires ou le respect de règles. La plupart des travaux appliqués à l’industrie automobile utilisent l’approche de respect de règles. Une originalité de ce travail est d’utiliser l’approche de la prise en compte directe des temps opératoires.L’étude de la littérature de ce problème a dévoilé deux lacunes dans les travaux précédents : l’essentiel des travaux modélisent un seul type d’opérateurs d’une part, et proposent des heuristiques ou des métaheuristiques pour résoudre ces problèmes, d’autre part. L’originalité de ce travail est de tester des méthodes exactes pour des instances industrielles et de modéliser le fonctionnement de trois différents types d’opérateurs spécifiques au cas industriel.Deux méthodes exactes sont développées : la programmation linéaire mixte et la programmation dynamique. Une étude expérimentale des facteurs de complexité sur des instances académiques des deux modèles est développée. Les modèles sont aussi testés sur des instances du cas d’étude.Par ailleurs, le problème est traité par deux méthodes approchées : une heuristique basée sur la programmation dynamique d’une part, et des métaheuristiques (algorithme génétique, recuit simulé et un couplage des deux) d’autre part. Les deux approches sont testées sur des instances académiques et des instances du cas d’étude.Ce travail a permis d’apporter une solution intéressante d’un point de vue industriel puisqu’il prend en compte les caractéristiques de la ligne de montage (opérateurs spécifiques) et améliore significativement la qualité du séquencement en un temps de calcul raisonnable. / In this thesis, the problem of sequencing mixed model assembly lines (MMAL) is considered. Our goal is to determine the sequence of products to minimize the work overload. This problem is known as the mixed model assembly line sequencing problem with work overload minimization (MMSP-W). This work is based on an industrial case study of a truck assembly line.Two approaches can be used to minimize the work overload: the use of task operation times or the respect of sequencing rules. Most of the earlier works applied in car industry use the latter approach. The originality of this work is to employ the task operation times for the generation of the product sequence in a MMAL.The literature review has highlighted two main gaps in previous works: most of the papers consider a single type of operators, and propose heuristics or metaheuristics to solve the problem. The originality of this work is to test exact methods for industrial case instances and to model three different types of operators.Two exact methods are developed: the mixed integer linear programming and dynamic programming. The models are tested on industrial case study instances. An experimental study is developed for both approaches in order to understand the complexity factors.Moreover, the problem is treated by two approximate methods: a heuristic based on dynamic programming and metaheuristics (genetic algorithm, simulated annealing and a hybrid method based on both genetic algorithm and simulated annealing). All approaches are tested on academic instances and on real data from the industrial case study.

Optical WDM network is the suitable transport mechanism for ever increasing bandwidth intensive internet applications. The WDM technique transmits the data over several different wavelengths simultaneously through an opticalfiber and the switching is done at wavelength level. The connection between the source and destination is called the light path. Since the WDM network carries huge amount of tra c, any failure can cause massive data loss. Therefore protecting the network against failure is an important issue. Maintaining high level of service availability is an important aspect of service provider. To provide cost effective service, all-optical network is the suitable choice for the service provider. But in all optical network, the signals are forced to remain in optical domain from source to destination. In the firrst part of the thesis, we deal the physical layer impairments (PLIs) aware shared-path provisioning on a wavelength routed all-optical networks. As the signal travels longer distances, the quality of the signal gets degraded and the receiver may not be able to detect the optical signal properly. Our objective is to establish a light path for both the working path and protection path with acceptable signal quality at the receiver. We propose an impairment aware integer linear programming (ILP) and impairment aware heuristic algorithm that takes into account the PLIs. The ILP provides the optimal solution. It is solved using IBM ILOG CPLEX solver. It is intractable for large size net-work. Therefore we propose the heuristic algorithm for large size network. It is evaluated through discrete-event simulation. But the algorithm provides only the suboptimal solution. To know the performance of this algorithm, the simulation result is compared with the optimal solution. We compute total blocking probability, restoration delay, computation time, and connection setup delay with respect to network load for the heuristic algorithm. We compare the performance of shared-path protection with dedicated-path protection and evaluate the percentage of resource saving of shared-path protection over the dedicated-path protection. In the second and third part of the thesis, we address the issues related to flexible-grid optical networks. In wavelength routed optical network, the bandwidth of each wavelength is fixed and rigid. It supports coarse grained tra c grooming and leads to ancient spectrum utilization. To overcome this, flexible-grid optical networks are proposed. It supports flexible bandwidth, and ne grained tra c groom In the second part of the thesis, we address the routing and spectrum allocation (RSA) algorithm for variable-bit-rate data tra c for flexible-grid optical networks. The RSA problem is NP-complete. Therefore a two-step heuristic approach (routing and spectrum allocation) is proposed to solve the RSA problem. The first step is solved by using a classical shortest path algorithm. For the second step we propose two heuristic schemes for frequency-slot allocation: (i) largest number of free frequency-slot allocation scheme and (ii) largest number of free frequency-slot maintaining scheme. As the network load increases, the spectrum is highly fragmented. To mitigate the fragmentation of the spectrum, we propose a xed-path least-fragmentation heuristic algorithm which fragments the spectrum minimally. It also supports varying-bit-rate tra c and also supports dynamic arrival connection requests. Through extensive simulations the proposed algorithms have been evaluated. Our simulation results show that the algorithms perform better in terms of spectrum utilization, blocking probability, and fraction of fragmentation of the spectrum. The spectrum utilization can reach up to a maximum of 92% and that only 71% of the spectrum is fragmented under maximum network load condition. Finally in the third part of the thesis, we discuss PLIs-aware RSA for the transparent exible-grid optical network. In this network, not only the optical signal expected to travel longer distance, but also to support higher line rates, i.e., data rate is increased up to 1 Tb/s. In such a high data rate, the optical signals are more prone to impairments and noises. As the transmission distance increases, optical signals are subject to tra-verse over many bandwidth-variable wavelength cross connects (BV-WXC) and multiple fibber spans due to which the PLIs get accumulated and are added to the optical signal. These accumulated impairments degrades the signal quality to an unacceptable level at the receiver, the quality of transmission falls below the acceptable threshold value, and the receiver may not be able to detect the signal properly. Therefore our objective is to develop an impairment aware RSA algorithm which establishes the QoT satisfied empathy based on the available resources and the quality of the signal available at the receiver. We formulate the PLIs-RSA problem as an ILP that provides an optimal solution. The optimal solution is obtained by solving the ILP using IBM ILOG CPLEX optimization solver. Since ILP is not efficient for large-size networks, we propose a heuristic algorithm for such a large-size networks. The signal power is measured at the receiver and the connection is established only when the signal power lies above the threshold value. The heuristic algorithm is evaluated through discrete-event simulation. It gives the sub-optimal solution. The simulation result is compared with optimal solution. The result shows that heuristic algorithm performs closer to the ILP. We compute the total blocking probability versus the network load for different spectrum allocation schemes. Total blocking probability is the sum of frequency-slot blocking probability and QoT blocking probability. We compute spectrum efficiency for the proposed algorithm. We also compare our algorithm with the existing routing and spectrum allocation algorithm, and the result shows that our algorithm outperforms the existing algorithms in terms of blocking probability and spectrum utilization.

[pt] Na indústria do petróleo e gás, uma das atividades de maior importância é a intervenção em poços para serviços de manutenção, a qual é necessária para garantir a produção de petróleo. Estas intervenções são realizadas por sondas workover que são disponibilizadas para atender uma grande quantidade de poços segundo um itinerário. Nesta tese são propostos três modelos de programação linear inteira para abordar eficientemente o problema de intervenção em poços terrestres de petróleo. O primeiro modelo determina o itinerário de um conjunto de sondas homogêneas, visando minimizar a perda total de produção. Este modelo é um aprimoramento do modelo proposto por Costa e Ferreira Filho (2004). O segundo modelo é uma extensão do anterior e considera também o dimensionamento de uma frota de sondas heterogênea, procurando minimizar o custo de perda de produção e o custo de aluguel de sondas. O terceiro modelo é uma abordagem estocástica que estende o segundo modelo e consiste em dimensionar uma frota de sondas considerando o tempo de intervenção incerto. A incerteza do tempo de intervenção é representada mediante a geração de cenários, usando para este fim os métodos de Monte Carlo, Redução de Cenários e Quasi-Monte Carlo. Os testes de estabilidade propostos por Kaut e Wallace (2003) são aplicados para avaliar os métodos de geração de cenários e estabelecer o número de cenários adequados para resolver o problema. Para avaliar o desempenho dos modelos propostos, diversos experimentos computacionais foram realizados em instâncias de pequeno, médio e grande porte. Todas as instâncias são baseadas em casos reais no Brasil. Os resultados mostram que os modelos propostos foram capazes de resolver todas as instâncias utilizadas, inclusive aquelas de grande porte, demonstrando serem eficientes quando comparadas com várias metaheurísticas, pois produzem soluções exatas em um curto tempo computacional. Uma análise do impacto nas soluções quando ocorre uma mudança no preço de petróleo e no horizonte de planejamento também é realizada. A metodologia de resolução empregada no terceiro modelo mostrou que o método Quasi-Monte Carlo proporcionou os melhores cenários para representar a incerteza e também o potencial do modelo para resolver problemas de grande porte. / [en] In the oil and gas industry, one of the most important activities is the intervention in wells for maintenance services, which is necessary to ensure the production of oil. These interventions are performed by workover rigs that are available to serve a large number of wells according to a schedule. In this thesis, we proposed three integer linear programming models to efficiently address the problem of intervention in onshore oil wells. The first model determines the schedule of a set of homogeneous rigs, with the objective of minimizing the total production loss. This model is an improvement of the model proposed by Costa and Ferreira Filho (2004). The second model is an extension of the previous one and also considers the sizing of a heterogeneous rig fleet, with the objective of minimizing the production loss cost and the rig rental cost. The third model is a stochastic approach that extends the second model and consists of sizing a rig fleet considering the uncertainty in the intervention time. The uncertainty in the intervention time is represented by the generation of scenarios, using for this purpose the Monte Carlo, Scenario Reduction, and Quasi-Monte Carlo methods. The stability tests proposed by Kaut and Wallace (2003) are applied to evaluate the scenario generation methods and to establish the number of appropriate scenarios to solve the problem. To evaluate the performance of the proposed models, several computational experiments were performed in small, medium and large instances. All instances are based on real cases in Brazil. The results show that the proposed models were able to solve all of the instances considered, including the large instances, proving to be efficient when compared to various metaheuristics, as they produce exact solutions in small computational time. An analysis of the impact on the solutions when there is a change in the oil price and the planning horizon is also carried out. The resolution methodology employed in the third model showed that the Quasi-Monte Carlo method provided the best scenarios to represent the uncertainty and also the potential of the model to solve large-scale problems.

[pt] O presente trabalho desenvolve um novo modelo para um problema logístico de remanejamento de placas entre pilhas em um Pátio de Placas de uma Laminação, típico da indústria siderúrgica. Esta abordagem inclui uma nova característica que indica o destino das placas remanejadas. Uma nova metodologia de decisão altera sensivelmente o escopo do problema e traz um novo conceito: o balanço entre a escolha ótima das placas e o possível destino das placas remanejadas, ou seja, deve-se pesar a escolha da placa a ser laminada juntamente com a possibilidade de um bom remanejamento das placas que estão acima da mesma. Esse modelo não linear é linearizado por técnicas de linearização e resolvido através de programação linear inteira. Com isso, o estudo apresenta uma redução no tempo médio de manuseio de placas (TMM) de 5 minutos por placa laminada encontrado na literatura existente, para menos de 4 minutos. Finalmente o modelo proposto incentiva a construção de uma ferramenta de gestão que possa resolver o problema SSS em situações práticas do dia-a-dia através de redução de custo de operação como forma de viabilizar o investimento nesta ferramenta. / [en] This work develops a new model for a typical logistic problem in the steel industry known as slab stack shuffling problem inside a Slab Yard of a Rolling Mill. This new approach includes a new feature that indicates the destination stacks of shuffled slabs. A new decision methodology changes significantly thescope of the problem and introduces a new concept: the balance between optimal choice of the rolled slabs and possible destinations for shuffled slabs which means it must weigh the choice of the slab to be rolled engaged with a low cost shuffle operation for the slabs that are above the chosen slab. This nonlinear model is linearized through specific modeling techniques and solved by integer linear programming. Thus, this work shows a reduction in average handling time (TMM) from 5 minutes per rolled slab found in the literature, to less than 4 minutes. Finally, the proposed model encourages the construction of a management tool that can solve the SSS problem in practical daily situations through operating costs reduction as a payback of investment in this tool.

[pt] No seu planejamento plurianual de investimentos, as organizações do setor de Exploração e Produção (EeP) estruturam alternativas de projetos de produção de petróleo e gás natural, sujeitas a diversas restrições e a incertezas técnicas e econômicas. Como não há como assegurar que os resultados dos projetos ocorram conforme o previsto, é possível que seu retorno seja inferior ao esperado, o que, dependendo da relevância, pode provocar um efeito adverso no resultado operacional e nas condições financeiras da companhia. Nesse mérito, a dissertação apresenta e aplica um modelo de programação estocástica linear inteira mista para seleção de portfólio de projetos que permita a maximização dos resultados, com restrição de risco. A aplicação considerou dados realistas do segmento de upstream de uma empresa do setor. Para representar os cenários econômicos, optou-se pela utilização da simulação de Monte Carlo do modelo Movimento Geométrico Browniano. Com o Valor Presente Líquido como retorno e Conditional Value-at-Risk representando a medida de risco, foi possível estabelecer a fronteira eficiente do risco-retorno, com a qual o decisor pode definir uma solução de portfólio, conforme sua aversão ao risco. / [en] In their multi-annual investment planning, oil and gas companies consider alternatives of production projects, subject to a variety of constraints, and technical and economic uncertainties. Considering that it is not possible to guarantee that these projects will perform as predicted, the return can be less than expected and can lead to a significant adverse effect to the operational results and to financial conditions of a given organization. Therefore, this dissertation proposes a mixed integer linear stochastic programming model for project portfolio selection that maximizes the return with risk constraint. The application considered realistic data from the upstream segment of an oil and gas company. Monte Carlo simulation of the Geometric Brownian Motion model was considered to represent the economic scenarios. Using the Net Present Value as the function and Conditional Value-at-Risk as a risk measure, it was possible to establish the efficient frontier of risk-return, which can assist the decision-maker to define the project portfolio according to their risk aversion.

Submitted by Izabel Franco (izabel-franco@ufscar.br) on 2016-10-06T17:59:08Z No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-20T13:51:08Z (GMT) No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-20T13:51:14Z (GMT) No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5) / Made available in DSpace on 2016-10-20T13:51:20Z (GMT). No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5) Previous issue date: 2016-03-21 / Não recebi financiamento / Vehicle routing problems occur in many practical situations where the pickup and/or delivery of goods is required. In this context, the present research aims to contribute to the study of logistic operations that arise in companies that deliver products on a regular basis to customers in densely populated urban areas. The problem consists in designing minimal cost daily routes serving the maximal number of customers. To this end, the crew of each vehicle comprise multiple deliverymen as means to reduce service times. Based on a case study in a drinks producer and distributor in the state of São Paulo, it is proposed a mixed integer linear programming model that comprise costs with own and chartered vehicles and the number of deliverymen, and various operational constraints such as time windows in customers, multiple daily trips, time limitations for the circulation of some vehicle types in specific areas, compatibility between vehicles and customers, maximum load in each vehicle, maximum route time and minimum load for the realization of a second trip. Results obtained by solving the model with real instances through exact (branch&cut), heuristic (constructive, local search, GRASP and Simulated Annealing) and hybrid (GRASP and branch&cut) approaches demonstrate the good quality of the generated solutions, and indicate the potential of application of some of these methods in practice. / Problemas de roteamento de veículos ocorrem em diversas situações práticas onde se faz necessária a distribuição e/ou coleta de produtos. Nesse contexto, a presente pesquisa visa o estudo das operações logísticas presentes em empresas que entregam produtos em base regular a clientes localizados em áreas urbanas de alta densidade demográfica. O problema consiste na obtenção de rotas de mínimo custo visando o atendimento do maior número de clientes da carteira diária. Para tal, a tripulação de cada veículo pode contemplar múltiplos entregadores para redução dos tempos de serviço. Com base em um estudo de caso em uma distribuidora de bebidas do interior do Estado de São Paulo, é proposto um modelo de programação linear inteira mista que considera custos com frota própria e fretada e com o número de entregadores, e diversas restrições operacionais, tais como janelas de tempo em clientes, múltiplas viagens diárias, limitações de horários de circulação de tipos de veículos, compatibilidade entre veículos e clientes, capacidade máxima de carga a ser transportada em cada veículo, tempo máximo de rota e carga mínima para realização da segunda viagem. Resultados da resolução do modelo para instâncias reais por meio de abordagens exatas (branch&cut), heurísticas (construtiva, busca local, GRASP e Simulated Annealing) e híbrida (GRASP e branch&cut), demonstram a boa qualidade das soluções geradas, e evidenciam o potencial de uso dessas metodologias na prática.

Made available in DSpace on 2016-06-02T19:51:48Z (GMT). No. of bitstreams: 1 3491.pdf: 1251165 bytes, checksum: 650dd47d0fec8bae05ba378f445f91dc (MD5) Previous issue date: 2011-02-11 / Universidade Federal de Sao Carlos / The aim of this work was to develop and apply a mathematical optimization model to support some key decisions in the steam production operation system with multiple industrial boilers. In the food industry, key decisions into this system are, normally, taken based on people experience, not through decision support tools based on operations research. The proposed model approaches the fuel replenishment decisions, fuel transportation and fuel inventory management. The model also determines the start-up and shutdown moments for each boiler, as well as, which of them will produce steam. An algebraic modeling language was used to implement computationally the model, which was solved by an optimization software. The adjustments and model validation were performed through a case study carried out in a large scale food industry localized in Goiania (GO). In computational experiments conducted with company s data, the results obtained by the model showed better economic performance than those from the company. In face of the good outcomes obtained by applying the model and the lack of protocols or decision tools for the studied system, this model presents itself as a feasible alternative to be considered to support some key-decisions in the steam production system with industrial boilers. / O objetivo deste trabalho foi desenvolver e aplicar um modelo matemático de otimização para apoiar algumas das principais decisões na operação de produção de vapor em múltiplas caldeiras industriais. Em indústrias de alimentos, essas decisões, em geral, são tomadas com base na experiência dos envolvidos e não com ferramentas de auxílio à tomada de decisão apoiadas pela pesquisa operacional. O modelo proposto contempla as decisões de aquisições de combustíveis dos fornecedores, o transporte para fábrica e o gerenciamento dos estoques dos combustíveis adquiridos no sistema. O modelo também determina os momentos de acionamento e desligamento das caldeiras, bem como em quais delas haverá produção de vapor. Uma linguagem de modelagem algébrica foi utilizada para implementar computacionalmente o modelo, que foi resolvido por meio de um software de otimização. Os ajustes e a validação do modelo ocorreram por meio de um estudo de caso realizado em uma indústria de alimentos de grande porte localizada em Goiânia (GO). Nos experimentos realizados com os dados fornecidos pela empresa, os resultados obtidos com o modelo apresentaram melhores desempenhos econômicos do que aqueles praticados pela operação real. Diante dos bons resultados alcançados na aplicação do modelo em situações reais e da ausência de protocolos ou ferramentas para apoiar as decisões no sistema estudado, o modelo proposto apresenta-se como uma alternativa viável para apoiar algumas das principais decisões na operação de produção de vapor em caldeiras industriais.

Made available in DSpace on 2016-06-02T19:53:34Z (GMT). No. of bitstreams: 1 STARK_Felipe_2015.pdf: 2619946 bytes, checksum: 296213b74067cc59aea0beae2cf8f165 (MD5) Previous issue date: 2015-03-20 / Universidade Federal de Minas Gerais / The increase in the municipal and industrial waste generation has caused enviromental and public health problems and as a consequence laws exist to address the issue. In Brazil, with the Federal Law No. 12,350 / 10 about the Política Nacional de Resíduos Sólidos reverse logistics (RL) of some products has become mandatory, including waste tires. However, RL of waste tires has been structured since environmental government agency resolutions propose treatment for tires disposal incorrectly in the environment and new generation of waste tires. Currently, the reverse network is managed by the tire manufacturers and importers associations, and destinations are commonly used are co-processing in cement kilns, and the recovery of rubber and steel as secondary products, by processes such as scrapping or lamination. Increasing transportation and operation costs in the logistics network make the network design critical for the full compliance with the legal goal. This network design is aligned with a planning that considers the financial issues like the minimization of costs or the maximization of profit, while meets the requirements of environmental government agencies. So it involves key strategic decisions, as the location of facilities and material flows, taking into account many parameters simultaneously. The objective of this study is to propose a model for waste tires reverse logistics considering: (i) flows from the output of the collection points (called ecopontos ) to the destination companies; (ii) the possibility of processes as the sorting of used tires in usable condition or not; (iii) the grinding process as an intermediate phase and for which type of destination the tire would be sent. Still are considered fixed costs for the installation of storage centers, for sorting used tires, and intermediary companies, for grinding and separation of components, in addition to the variable operating costs, transportation and potential revenues generated from the substitution of raw materials or fuel in destination companies. The model is a mixed integer linear problem (MILP) with multiple time periods. Experiments are done with a single and multiple periods, finally were present some sensitivity analysis. Other financial constraints as the annual budget and an approach that includes the carbon footprint (CO2) in the transport and processing are explored. The results showed configurations that meet the goal and have a small profit, indicating that storage centers are preferred in places far from destination points and low demand, while the pre-processing companies have opposite behavior. When using the carbon footprint, it was found that the sorting of used tires gain more importance in the view of reducing emissions, because there is less emission in the reuse or refurbishment compared to the manufacturing of new tires. / O aumento na geração de resíduos urbanos e industriais tem ocasionado problemas de ordem ambiental e de saúde pública, e, como consequência, legislações específicas surgiram para tratar do assunto. No Brasil, a Lei Federal nº 12.350/10, da Política Nacional de Resíduos Sólidos, tornou obrigatória a logística reversa (LR) de alguns produtos, entre os quais o pneu usado sem condição de rodagem (inservível). Entratanto, a LR de pneus inservíveis já se apresentava em fase de estruturação, uma vez que resoluções ambientais propunham o tratamento do passivo deixado por anos de descarte incorreto dos pneus no meio ambiente. Atualmente, a rede reversa de pneus é administrada por associações de fabricantes e importadores, e as destinações comumente utilizadas são o coprocessamento, em fornos de cimenteira, e a recuperação da borracha e do aço como subprodutos, por meio de processos como a granulação ou a laminação. Os crescentes custos do transporte terrestre e as proposições de melhorias na rede logística tornam a configuração da rede de logística reversa de pneus como uma proposta para o total cumprimento da meta, alinhados ao planejamento que considere as questões financeiras como a minimização de custos logísticos ou maximização do lucro, enquanto cumprem as exigências dos órgãos ambientais. Esta configuração envolve decisões estratégicas essenciais, como a localização de instalações e determinação dos fluxos de materiais, sendo que muitos parâmetros estão presentes simultaneamente. O objetivo deste estudo é propor um modelo de configuração de rede logística reversa de pneus inservíveis considerando: (i) fluxos a partir da saída dos pontos de coleta (ecopontos) até as empresas destinadoras; (ii) processos como a possibilidade da triagem dos pneus usados em servíveis e inservíveis; (iii) a trituração como fase intermediária e para qual tipo de destinação enviar. São considerados ainda custos fixos para instalação de centros de armazenamento, para triagem dos pneus usados, e empresas intermediárias, para trituração e separação de componentes, além dos custos variáveis de operação, transporte e as possíveis rendas geradas com a substituição da matéria-prima ou combustível nas empresas destinadoras. O modelo apresenta formulação linear inteira mista (MILP) com múltiplos períodos. São feitos experimentos com único período, e com a variação de parâmetros. Posteriormente são estudadas restrições financeiras como orçamento anual e uma abordagem que inclui a pegada de carbono (CO2) no transporte e processamento. Os resultados encontrados apresentaram configurações que cumprem a meta e apresentam um pequeno lucro, indicando que os centros de armazenamento são preferíveis em locais afastados das destinadoras e com baixa demanda, enquanto as empresas intermediárias apresentam comportamento oposto. Quando se utilizou a pegada de carbono, verificou-se que a triagem de pneus ganha mais importância, dada a redução nas emissões do reuso ou reforma dos pneus em relação à fabricação de novos pneus.

Submitted by CRISTIAM VICTOR VILLAJUAN MONTES (cvillajuanm@gmail.com) on 2016-08-15T21:31:33Z No. of bitstreams: 1 Cristiam Villajuan Montes_UNESP (1) ULTIMO.pdf: 4084141 bytes, checksum: ca80d95f9d6b055991ca9609f4c832a4 (MD5) / Approved for entry into archive by Ana Paula Grisoto (grisotoana@reitoria.unesp.br) on 2016-08-17T13:34:56Z (GMT) No. of bitstreams: 1 villajuanmontes_cv_me_ilha.pdf: 4084141 bytes, checksum: ca80d95f9d6b055991ca9609f4c832a4 (MD5) / Made available in DSpace on 2016-08-17T13:34:56Z (GMT). No. of bitstreams: 1 villajuanmontes_cv_me_ilha.pdf: 4084141 bytes, checksum: ca80d95f9d6b055991ca9609f4c832a4 (MD5) Previous issue date: 2016-02-19 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Os problemas de planejamento da expansão de sistemas de transmissão e de fluxo de potência ótimo são de grande importância na área de sistemas de transmissão de energia elétrica. O primeiro consiste em determinar a expansão ótima do sistema, que deve ocorrer com o menor gasto monetário possível. No problema fluxo de potência ótimo deve-se encontrar o estado de operação do sistema de forma a minimizar um objetivo, no caso, os custos de geração. Ambos problemas possuem modelos de programação não-linear inteira mista. Além disto, o resultado ótimo de ambos deve cumprir com restrições operacionais, como o limite de tensão nas barras, os limites de fluxos nos ramos e os limites dos geradores. Para resolver os problemas citados, neste trabalho são apresentados modelos matemáticos de programação linear inteiro misto, aproximados, baseados em um modelo linearizado de fluxo de carga AC, que considera a presença da potência reativa, das perdas no sistema e magnitudes de tensões nas barras diferentes do valor nominal. Todos os modelos foram escritos na linguagem de modelagem matemática AMPL e resolvidos com o solver comercial CPLEX. Os modelos propostos foram testados com os sistemas IEEE de 14, 30, 57, 118 e 300 barras e com o sistema Garver para o planejamento da expansão de sistemas de transmissão. Os resultados foram comparados utilizando-se um fluxo de carga não linear, para verificar-se a precisão dos modelos propostos. / The transmission network expansion planning and the optimal power flow problems are of great importance in the field of electricity transmission systems. The first consists in determining the optimal expansion of the system, which must be done with the least possible investment. In the optimal power flow problem it must found the operating status of the system in order to minimize an objective, in this case, generation costs. Both problems have mixed-integer nonlinear programming models. In addition, the optimal solution of both must comply with operating constraints, such as the voltage limit on buses, the limits flows in branches and the limits of the generators. To solve the problems cited, in this work are presented approximate mixed integer linear programming models based on a linearized AC load flow model, which considers the presence of reactive power, the losses in the system and of nominal bus voltage magnitudes. All models were written in mathematical modeling language AMPL and solved with the commercial solver CPLEX. The proposed models were tested with the IEEE systems of 14, 30, 57, 118 and 300 buses and with the Garver system for transmission network expansion planning. Results were compared using a nonlinear load flow model, to verify the accuracy of the proposed models.

Made available in DSpace on 2015-05-14T12:36:37Z (GMT). No. of bitstreams: 1 ArquivoTotalWagner.pdf: 1537495 bytes, checksum: 24391c06b84eb789a63789d66472a304 (MD5) Previous issue date: 2013-08-12 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The Dynamic Allocation Problem Spaces (DSAP) is recent literature, and was inspired by the need to minimize the distances between requested resources for the execution of activities in nuclear power plants. There are similarities of the problem with projects in which the movement of resources generates costs for the final planning, or in cases where congestion of these resources is not advisable, as in large buildings or works in mining. It is necessary, the use of these approximation methods considered to be NP hard. For this, a new constructive heuristic is proposed using integer linear programming model based on activity streams that incorporate information from the graph of dependencies between activities, and then an application of the hybrid GRASP meta-heuristic is discussed. The computational results show that this approach is able to obtain high-quality solutions. / O Problema da Alocação Dinâmica de Espaços (PADE) foi inspirado na necessidade de otimização da distância percorrida por recursos requeridos para realização de atividades na ocorrência de desligamentos planejados em centrais de energia elétrica. Em geral, o problema apresenta aplicações potenciais em projetos nos quais movimentar um recurso é uma tarefa difícil ou cara, ou nos quais o congestionamento desses recursos é indesejável,como em atividades de mineração.Este problema é computacionalmente difícil de se resolvido, logo obter uma solução ótima para instâncias de elevadas dimensões justica o uso de métodos aproximativos. Este trabalho propõe a utilização da metaheurística GRASP para a resolução do PADE.