One of the problems of real-life production scheduling is dynamics of manufacturing environments with new production demands and breaking machines during the schedule execution. Simple rescheduling from scratch in response to unexpected events occurring on the shop floor may require excessive computation time. Moreover, the recovered schedule may be prohibitively deviated from the ongoing schedule. This thesis reviews existing approaches in the field of dynamic scheduling and proposes techniques how to modify a schedule to accommodate disturbances such as resource failure, hot order arrival or order cancellation. The importance is put on the speed of suggested procedures as well as on a minimum modification from the original schedule. The scheduling model is motivated by the FlowOpt project, which is based on the Temporal Networks with Alternatives. The algorithms are written in the C# language.

Submitted by Nara Lays Domingues Viana Oliveira (naradv) on 2015-07-16T15:53:35Z No. of bitstreams: 1 LUCAS.pdf: 1303250 bytes, checksum: 9f822df40e01702f7d665e6b6a631bf2 (MD5) / Made available in DSpace on 2015-07-16T15:53:35Z (GMT). No. of bitstreams: 1 LUCAS.pdf: 1303250 bytes, checksum: 9f822df40e01702f7d665e6b6a631bf2 (MD5) Previous issue date: 2012 / Nenhuma / Migração de processos é um pertinente mecanismo para oferecer balanceamento dinâmico de carga, principalmente em ambientes dinâmicos e heterogêneos. Em especial, esse tópico é importante para aplicações BSP (Bulk Synchronous Parallel) uma vez que elas compreendem execuções em fases, onde o tempo de cada superetapa é determinado pelo processo mais lento. Nesse contexto, esse trabalho apresenta o sistema jMigBSP. Ele permite a escrita de aplicações BSP em Java e seu diferencial diz respeito às facilidades de reescalonamento de objetos em duas maneiras: (i) usando diretivas de migração no código da aplicação e; (ii) através do balanceamento de carga automático em nível de middleware. Além das abordagens de reescalonamento, jMigBSP facilita a interação entre os objetos através de métodos para comunicação assíncrona e one-sided. O desenvolvimento de jMigBSP foi guiado pelas ideias de eficiência e flexibilidade. Em primeiro lugar, a eficiência é marcada pela preocupação com o seu desempenho se comparado com linguagens compiladas, bem como no próprio algoritmo de reescalonamento. Além disso, a flexibilidade está presente no tratamento do reescalonamento automático de objetos. A avaliação de jMigBSP compreendeu o desenvolvimento e a execução de duas aplicações BSP em um ambiente multicluster: (i) transformada rápida de Fourier e; (ii) compressão de imagens. Duas heurísticas para a seleção dos objetos candidatos à migração foram aplicadas na avaliação. A primeira seleciona um objeto BSP com o maior valor de PM (Potencial de Migração). A segunda escolhe uma percentagem de objetos baseado no maior PM. Os resultados mostram que jMigBSP oferece a oportunidade de ganhos de desempenho sem alterações no código da aplicação. jMigBSP torna possível ganhos de desempenho na casa de 29%, bem como produz uma baixa sobrecarga quando comparado com uma biblioteca de código nativo. Além disso, uma sobrecarga média de 5,52% foi observada no algoritmo de reescalonamento. Em geral, os resultados obtidos mostram na prática a teoria da migração de processos, onde aplicações computacionalmente intensivas (CPU-bound) são mais beneficiadas com a transferência de entidades (processos, tarefas, objetos etc.) para processadores mais rápidos. Considerando que a seleção de uma percentagem de objetos para migração se mostrou uma heurística eficiente, trabalhos futuros compreendem o desenvolvimento de outras que selecionam uma coleção de objetos sem a necessidade de parâmetros particulares para o reescalonador. / Process migration is an useful mechanism for runtime load balancing, mainly in heterogeneous and dynamic environments. In particular, this technique is important for Bulk Synchronous Parallel (BSP) applications. This kind of application is based in rounds, or supersteps, where the time of each superstep is determined by the slowest process. In this context, this work presents the jMigBSP system. It was designed to act over BSP-based Java applications and its differential approach concerns the offering of the rescheduling facility in two ways: (i) by using migration directives in the application code directly and; (ii) through automatic load balancing at middleware level. In addition, the presented library makes the object interaction easier by providing one-sided asynchronous communication. The development of jMigBSP was guided by the following ideas: efficiency and flexibility. First of all, the efficiency topic involves the performance relation with compiled languages (native code), as well as the time spent in the rescheduling algorithm itself. Moreover, the flexibility is present in the treatment of automatic object rescheduling. The evaluation of jMigBSP comprised the development and execution of two BSP applications in a multicluster environment: (i) fast Fourier transform and; (ii) Fractal image compression. Two heuristics were used for selecting the candidate objects for migration in the evaluation. The first heuristic chooses the BSP object that presents the highest PM (Potential of Migration) value. The second heuristic selects a percentage of objects based on the highest PM value. The results showed that jMigBSP offers an opportunity to get performance in an effortless manner to the programmer since its does not need modifications in the application code. jMigBSP makes possible gains of performance up to 29% as well as produces a low overhead when compared with a C-based library. Furthermore, an average overhead of 5,52% was observed in the rescheduling algorithm. In general, the results demonstrate in practice the theory of process migration, where computationally intensive applications (CPU-bound) are most benefited by the entities transferring (processes, tasks or objects) to faster processors. Considering that the selection of a percentage of objects for migration showed an efficient heuristic, future work includes the development of new mechanisms that select a collection of objects without the need to setup particular parameters to the rescheduler.

Nesta tese, nós apresentamos uma compilação de três artigos de otimização aplicados no contexto de transporte urbano de ônibus. O principal objetivo foi estudar e implementar heurísticas com base em Pesquisa Operacional para otimizar problemas de (re)escalonamento de veículos off-line e on-line considerando várias garagens e frota heterogênea. No primeiro artigo, foi proposta uma abordagem heurística para o problema de escalonamento de veículos múltiplas garagens. Acreditamos que as principais contribuições são o método de geração de colunas para grandes instâncias e as técnicas de redução do espaço de estados para acelerar as soluções. No segundo artigo, adicionamos complexidade ao considerar a frota heterogênea, denotada como multiple depot vehicle type scheduling problem (MDVTSP). Embora a importância e a aplicabilidade do MDVTSP, formulações matemáticas e métodos de solução para isso ainda sejam relativamente inexplorados. A principal contribuição desse trabalho foi o método de geração de colunas para o problema com frota heterogênea, já que nenhuma outra proposta na literatura foi identificada no momento pelos autores. Na terceira parte desta tese, no entanto, nos concentramos no reescalonamento em tempo real para o caso de quebras definitivas de veículos. A principal contribuição é a abordagem eficiente do reescalonamento sob uma quebra. A abordagem com redução de espaço de estados, solução inicial e método de geração de colunas possibilitou uma ação realmente em tempo real. Em menos de cinco minutos, reescalonando todas as viagens restantes. / In this dissetation we presented a three articles compilation in urban bus transportation optimization. The main objective was to study and implement heuristic solutions method based on Operations Research to optimizing offline and online vehicle (re)scheduling problems considering multiple depots and heterogeneous fleet. In the first paper, a fast heuristic approach to deal with the multiple depot vehicle scheduling problem was proposed. We think the main contributions are the column generation framework for large instances and the state-space reduction techniques for accelerating the solutions. In the second paper, we added complexity when considering the heterogeneous fleet, denoted as "the multiple-depot vehicle-type scheduling problem" (MDVTSP). Although the MDVTSP importance and applicability, mathematical formulations and solution methods for it are still relatively unexplored. We think the main contribution is the column generation framework for instances with heterogeneous fleet since no other proposal in the literature has been identified at moment by the authors. In the third part of this dissertation, however, we focused on the real-time schedule recovery for the case of serious vehicle failures. Such vehicle breakdowns require that the remaining passengers from the disabled vehicle, and those expected to become part of the trip, to be picked up. In addition, since the disabled vehicle may have future trips assigned to it, the given schedule may be deteriorated to the extent where the fleet plan may need to be adjusted in real-time depending on the current state of what is certainly a dynamic system. Usually, without the help of a rescheduling algorithm, the dispatcher either cancels the trips that are initially scheduled to be implemented by the disabled vehicle (when there are upcoming future trips planned that could soon serve the expected demand for the canceled trips), or simply dispatches an available vehicle from a depot. In both cases, there may be considerable delays introduced. This manual approach may result in a poor solution. The implementation of new technologies (e.g., automatic vehicle locators, the global positioning system, geographical information systems, and wireless communication) in public transit systems makes it possible to implement real-time vehicle rescheduling algorithms at low cost. The main contribution is the efficient approach to rescheduling under a disruption. The approach with integrated state-space reduction, initial solution, and column generation framework enable a really real-time action. In less than five minutes rescheduling all trips remaining.

Sammanfattning Titel:                           Utökad möjlighet till skuldsanering för enskilda näringsidkare – Effekterna av lagändringen i skuldsaneringslagen (2006:548) Datum:                        2011-06-09 Lärosäte:                     Mälardalens Högskola, Västerås Institution:                  Akademin för hållbar samhälls- och teknikutveckling Nivå:                           Magisteruppsats i företagsekonomi, 15 hp Författare:                   Sandra Kohlin och Lina Lindberg Handledare:                Leif Carlsson Examinator:                Cecilia Lindh Problemformulering:   Kommer lagändringen i skuldsaneringslagen att uppfylla sitt syfte? Vilka effekter kommer förändringen i skuldsaneringslagen att medföra för enskilda näringsidkare? Syfte:                          Syftet med magisteruppsatsen är att beskriva den kommande lagändringen i skuldsaneringslagen (2006:548) rörande näringsidkare. Syftet är vidare att undersöka om lagändringen kommer att uppfylla sitt syfte samt att belysa och undersöka de troliga effekterna av dessa förändringar. Metod:                        En kvalitativ metod valdes till uppsatsen för att få en mer djupgående förståelse av ämnesområdet. Personliga intervjuer har genomförts för att samla in det empiriska materialet. För att komma fram till uppsatsens slutsats har referensramen och empirin jämförts med varandra. Slutsats:                      Syftet med lagändringen är att utöka möjligheten för näringsidkare att antingen starta upp igen efter ett misslyckande eller att fortsätta bedriva verksamhet. Den första delen av lagändringens syfte kommer att uppfyllas i och med att det kommer bli lättare för en näringsidkare att starta om efter ett misslyckat företagande. Den andra delen av syftet kommer inte att uppfyllas helt då endast ett fåtal aktiva näringsidkare kommer bli beviljade skuldsanering. Effekter som lagändringen kan medföra är att ansökningar om skuldsanering ökar, aktiva näringsidkare kan beviljas skuldsanering, fler överklagar skuldsaneringsbeslut, kostnaden för olika instanser ökar, trycket på kommunernas budget- och skuldrådgivare kan öka, fordringsägare kan erhålla mer betalt vid en skuldsanering än vid en konkurs och osunda företag kan lämna marknaden fortare. Nyckelord:                  Insolvenslagstiftning, risker och företagande, skuldsaneringslag, enskilda näringsidkare.

In this thesis, we consider a rescheduling problem on non-identical parallel machines with controllable processing times. A period of unavailability occurs on one of the machines due to a machine failure, material shortage or broken tool. These disruptions may cause the original schedule to become inecient and sometimes infeasible. In order to generate a new and feasible schedule, we are dealing with two conflicting measures called the eciency and stability measures simultaneously. The eciency measure evaluates the satisfaction of a desired objective function value and the stability measure evaluates the amount of change between the schedule before and after the disruption. In this study, we measure stability by the number of disrupted jobs. In this thesis, the job is referred as a disrupted job if it completes processing after its planned completion time in the original schedule. The eciency is measured by the additional manufacturing cost of jobs. Decreasing number of disrupted jobs requires compressing the processing time of a job which cause an increase in its additional manufacturing cost. For that reason we cannot minimize these objectives at the same time. In order to handle this, we developed a mixed integer programming model for the considered problem by applying the epsilon-constraint approach. This approach makes focusing on the single objective possible to get efficient solutions. Therefore, we studied the problem of minimizing additional manufacturing cost subject to a limit on the number of disrupted jobs. We also considered a convex compression cost function for each job and solved a cost minimization problem by applying conic quadratic reformulation for the model. The convexity of cost functions is a major source of diculty in finding optimal integer solutions in this problem, but applying strengthened conic reformulation has eliminated this diculty. In addition, we prepare an improvement search algorithm in order to find good solution in reasonable CPU times. We use our heuristic procedure on optimality properties we showed for a single machine subproblem. We made computational experiments on small and medium scale test problems. Afterwards, we compare the performance of the improvement search algorithm and mathematical model for their solution quality and durations.

Bakgrund Regeringen ansåg trots införandet av 1994 års Skuldsaneringslag (1994:334) att man behövde en lösning på problemet att enskilda näringsidkare varken kunde bli beviljade skuldsanering eller företagsrekonstruktion för att på så sätt ha möjlighet att fortsätta bedriva sin verksamhet om de hamnat i ekonomiskt obestånd. 2007 tillsattes därför en särskild utredare som skulle utreda och lämna förslag om skuldnedsättning för enskilda näringsidkare. Denna utredning låg till grund för regeringens proposition som riksdagen oktober 2010 fattade beslut om. Problemformulering Vilka effekter har den nya Skuldsaneringslagen medfört för näringsidkare såväl som borgenärer? Syfte Vårt syfte med kandidatuppsatsen är att undersöka om införandet av den nya Skuldsaneringslagen (2006:548) gjort att de förväntade effekterna uppnåtts, samt om det inneburit att andra effekter uppstått. Metod Studiens syfte besvaras genom en personlig intervju samt flertalet enkäteter som har samlats in för det empiriska materialet. Bearbetningen av det empiriska materialet gjordes med en kvalitativ metod. Även remisser och propositioner har används för att hjälpa till att besvara kandidatuppsatsens syfte då referensramen och slutsatsen ställts mot varandra. Slutsats De faktiska effekter som den nya Skuldsaneringslagen (2006:548) inneburit är att enskilda näringsidkare kan skuldsanera om obeståndet beror på att denne inte kunnat arbeta under en längre period och därför hamnat i ekonomiskt trångmål. Vid ett ekonomiskt trångmål beaktas inte skuldernas ålder på samma sätt som tidigare vilket gjort att en gäldenär kan ansöka om skuldsanering i ett tidigare stadie. Att detta skulle bidra till försämrad betalningsmoral och förhöjda räntor visar sig oförändrad. Vid förändring av rekvisit såsom skuldernas ålder syns en tydlig effekt på antalet skuldsaneringsärenden. / Background The Government considered despite the introduction of the 1994 debt rescheduling act (1994:334) that a solution was needed to the problem that individual traders neither could be granted debt relief or corporate restructuring to thus be able to continue operations if they got into financial insolvency. Therefore in 2007 a special investigator was added to investigate and make proposals for debt relief for individual traders. This study was the basis for the Government bill that the Parliament in October 2010 decided upon. The main issue What impact has the new debt rescheduling act meant for traders as well as creditors? Purpose Our purpose of the bachelor thesis is to explore if the new debt rescheduling act (2006:548) has achieved the expected goals, the study will also investigate if the new debt rescheduling act has resulted in any other effects. Method The study's purpose is answered by a personal interview and several questionnaires that have been collected for the empirical material. The processing of the empirical material was made by a qualitative method. Referrals and propositions have also been used to help answer the bachelor thesis purpose, when the reference frame and the conclusion were set against each other. Conclusion The actual impact of the new debt rescheduling act (2006:548) is that individual traders can get debt relief if the insolvency was because the trader could not work for a long period of time and therefore ended up in financial trouble. In an insolvency situation the age of the debts are not considered in the same way as before, which meant that a debtor can apply for debt relief in an earlier stage. That this would contribute to deterioration in payment behavior and elevated interest rates appears unchanged. At the change of a criterion such as the age of the debt, a clear effect on the number of debt applications can be seen.

Nesta tese, nós apresentamos uma compilação de três artigos de otimização aplicados no contexto de transporte urbano de ônibus. O principal objetivo foi estudar e implementar heurísticas com base em Pesquisa Operacional para otimizar problemas de (re)escalonamento de veículos off-line e on-line considerando várias garagens e frota heterogênea. No primeiro artigo, foi proposta uma abordagem heurística para o problema de escalonamento de veículos múltiplas garagens. Acreditamos que as principais contribuições são o método de geração de colunas para grandes instâncias e as técnicas de redução do espaço de estados para acelerar as soluções. No segundo artigo, adicionamos complexidade ao considerar a frota heterogênea, denotada como multiple depot vehicle type scheduling problem (MDVTSP). Embora a importância e a aplicabilidade do MDVTSP, formulações matemáticas e métodos de solução para isso ainda sejam relativamente inexplorados. A principal contribuição desse trabalho foi o método de geração de colunas para o problema com frota heterogênea, já que nenhuma outra proposta na literatura foi identificada no momento pelos autores. Na terceira parte desta tese, no entanto, nos concentramos no reescalonamento em tempo real para o caso de quebras definitivas de veículos. A principal contribuição é a abordagem eficiente do reescalonamento sob uma quebra. A abordagem com redução de espaço de estados, solução inicial e método de geração de colunas possibilitou uma ação realmente em tempo real. Em menos de cinco minutos, reescalonando todas as viagens restantes. / In this dissetation we presented a three articles compilation in urban bus transportation optimization. The main objective was to study and implement heuristic solutions method based on Operations Research to optimizing offline and online vehicle (re)scheduling problems considering multiple depots and heterogeneous fleet. In the first paper, a fast heuristic approach to deal with the multiple depot vehicle scheduling problem was proposed. We think the main contributions are the column generation framework for large instances and the state-space reduction techniques for accelerating the solutions. In the second paper, we added complexity when considering the heterogeneous fleet, denoted as "the multiple-depot vehicle-type scheduling problem" (MDVTSP). Although the MDVTSP importance and applicability, mathematical formulations and solution methods for it are still relatively unexplored. We think the main contribution is the column generation framework for instances with heterogeneous fleet since no other proposal in the literature has been identified at moment by the authors. In the third part of this dissertation, however, we focused on the real-time schedule recovery for the case of serious vehicle failures. Such vehicle breakdowns require that the remaining passengers from the disabled vehicle, and those expected to become part of the trip, to be picked up. In addition, since the disabled vehicle may have future trips assigned to it, the given schedule may be deteriorated to the extent where the fleet plan may need to be adjusted in real-time depending on the current state of what is certainly a dynamic system. Usually, without the help of a rescheduling algorithm, the dispatcher either cancels the trips that are initially scheduled to be implemented by the disabled vehicle (when there are upcoming future trips planned that could soon serve the expected demand for the canceled trips), or simply dispatches an available vehicle from a depot. In both cases, there may be considerable delays introduced. This manual approach may result in a poor solution. The implementation of new technologies (e.g., automatic vehicle locators, the global positioning system, geographical information systems, and wireless communication) in public transit systems makes it possible to implement real-time vehicle rescheduling algorithms at low cost. The main contribution is the efficient approach to rescheduling under a disruption. The approach with integrated state-space reduction, initial solution, and column generation framework enable a really real-time action. In less than five minutes rescheduling all trips remaining.

Nesta tese, nós apresentamos uma compilação de três artigos de otimização aplicados no contexto de transporte urbano de ônibus. O principal objetivo foi estudar e implementar heurísticas com base em Pesquisa Operacional para otimizar problemas de (re)escalonamento de veículos off-line e on-line considerando várias garagens e frota heterogênea. No primeiro artigo, foi proposta uma abordagem heurística para o problema de escalonamento de veículos múltiplas garagens. Acreditamos que as principais contribuições são o método de geração de colunas para grandes instâncias e as técnicas de redução do espaço de estados para acelerar as soluções. No segundo artigo, adicionamos complexidade ao considerar a frota heterogênea, denotada como multiple depot vehicle type scheduling problem (MDVTSP). Embora a importância e a aplicabilidade do MDVTSP, formulações matemáticas e métodos de solução para isso ainda sejam relativamente inexplorados. A principal contribuição desse trabalho foi o método de geração de colunas para o problema com frota heterogênea, já que nenhuma outra proposta na literatura foi identificada no momento pelos autores. Na terceira parte desta tese, no entanto, nos concentramos no reescalonamento em tempo real para o caso de quebras definitivas de veículos. A principal contribuição é a abordagem eficiente do reescalonamento sob uma quebra. A abordagem com redução de espaço de estados, solução inicial e método de geração de colunas possibilitou uma ação realmente em tempo real. Em menos de cinco minutos, reescalonando todas as viagens restantes. / In this dissetation we presented a three articles compilation in urban bus transportation optimization. The main objective was to study and implement heuristic solutions method based on Operations Research to optimizing offline and online vehicle (re)scheduling problems considering multiple depots and heterogeneous fleet. In the first paper, a fast heuristic approach to deal with the multiple depot vehicle scheduling problem was proposed. We think the main contributions are the column generation framework for large instances and the state-space reduction techniques for accelerating the solutions. In the second paper, we added complexity when considering the heterogeneous fleet, denoted as "the multiple-depot vehicle-type scheduling problem" (MDVTSP). Although the MDVTSP importance and applicability, mathematical formulations and solution methods for it are still relatively unexplored. We think the main contribution is the column generation framework for instances with heterogeneous fleet since no other proposal in the literature has been identified at moment by the authors. In the third part of this dissertation, however, we focused on the real-time schedule recovery for the case of serious vehicle failures. Such vehicle breakdowns require that the remaining passengers from the disabled vehicle, and those expected to become part of the trip, to be picked up. In addition, since the disabled vehicle may have future trips assigned to it, the given schedule may be deteriorated to the extent where the fleet plan may need to be adjusted in real-time depending on the current state of what is certainly a dynamic system. Usually, without the help of a rescheduling algorithm, the dispatcher either cancels the trips that are initially scheduled to be implemented by the disabled vehicle (when there are upcoming future trips planned that could soon serve the expected demand for the canceled trips), or simply dispatches an available vehicle from a depot. In both cases, there may be considerable delays introduced. This manual approach may result in a poor solution. The implementation of new technologies (e.g., automatic vehicle locators, the global positioning system, geographical information systems, and wireless communication) in public transit systems makes it possible to implement real-time vehicle rescheduling algorithms at low cost. The main contribution is the efficient approach to rescheduling under a disruption. The approach with integrated state-space reduction, initial solution, and column generation framework enable a really real-time action. In less than five minutes rescheduling all trips remaining.

This study considers bicriteria approaches to the minimum cost network flow problem and a rescheduling problem where those approaches find their applications. For the bicriteria integer minimum cost network flow problem, we generate all efficient solutions in two phases. The first phase generates the extreme supported efficient points that are the extreme points of the objective space of the continuous bicriteria network flow problem. In the second phase, we generate the nonextreme supported and unsupported efficient points by Integer Programming Based approaches. Our rescheduling problem considers parallel unrelated machine environments. The criteria are the total flow time as an efficiency measure and the total reassignment cost as a stability measure. We show that the problems that address linear functions of the two criteria can be represented by bicriteria network flow models. To generate all efficient solutions, we use a Classical Approach that is based on the optimal solutions of the singly constrained network flow problem and provide a Branch and Bound approach that starts with extreme supported efficient set and uses powerful bounds. To find an optimal solution to any nonlinear function of the two criteria, we provide a Branch and Bound approach and an Integer Programming Based approach that eliminates some portions of the efficient set that cannot provide improved solutions. We contribute both to the network flow and scheduling literature by proposing algorithms to the bicriteria network flow models and applying them to a rescheduling problem that is bicriteria in nature. The results of our extensive computations with up to 100 jobs and 12 machines have revealed that, the Branch and Bound algorithm finds the efficient set in less computational effort compared to the classical approach. In minimizing a nonlinear function of the two criteria both IP Based approach and Branch and Bound algorithm perform quite satisfactory.

O requisito de continuidade de fornecimento de energia elétrica tem sido crescente na medida em que a sociedade de modo geral e os processos industriais em particular apresentam forte dependência desse insumo que assegura a todos satisfação e conforto. O consumidor é um agente econômico e ele faz parte do sistema elétrico (carga). No âmbito da análise de sistemas de potência são abordados temas, desde modelos de representação da rede e da carga até conceitos de custo da continuidade e técnicas de otimização da aplicação de investimentos para priorizar aqueles que trazem maior benefício tanto para o consumidor como para o controlador da concessão. No entanto, as técnicas usuais e convencionais de Planejamento podem conduzir a soluções pouco econômicas, porquanto consideram apenas a otimização dos investimentos em obras, ou seja, reforços da rede para atender a condição normal e em emergência (critério n-1), respeitando, naturalmente, critérios técnicos (limites de tensão, sobrecargas etc). Não raro estas instalações recomendadas pela técnica convencional serem utilizadas apenas em algumas contingências, algumas com baixa probabilidade de ocorrência. Esta pesquisa desenvolve como alternativa às soluções convencionais, um modelo que considera a otimização dos investimentos, lançando mão de recursos operativos como: corte de carga, despacho ou modificações topológicas por meio de chaveamentos, quando operando em contingência. O modelo proposto prevê que a representação da geração inclua funções que relacionam a intensidade de despacho com seus custos, bem como funções que associam custo à intensidade e duração do corte de carga a cada barra do sistema. O modelo também permite a reconfiguração da rede quando operando em contingências, por meio de alterações do estado das chaves, mudando a topologia. As funções de custo do corte de carga também são modeladas neste trabalho, considerando métodos analíticos e agregados para o cálculo do prejuízo sócio-econômico resultante da interrupção. A busca da solução ótima, que pode envolver corte de carga, despachos de geração e reconfiguração da rede, substituindo reforços realizados por obra, é obtida por um algoritmo genético evolutivo. Os procedimentos do modelo proposto representam um avanço do processo de planejamento convencional, porquanto introduz a componente continuidade de serviço de forma quantitativa, caracterizando o atendimento dos requisitos de sensibilidade das cargas de cada barra do sistema, lançando mão de recursos operativos, através de possíveis despachos e alterações topológicas. Um estudo de caso ilustra a aplicação do modelo proposto. / The need for reliable electrical energy supply continuity, the industrial demand and its dependence has been growing worldwide. Besides, it also concerns society and assures satisfaction and comfort of consumers. The consumer is the economic agent since he takes part in the system. On analyzing an electrical system, models are needed to represent the network and the load and optimization frameworks in order to make better investments and prioritize those which can benefit the consumer and the concession holder. The usual Planning Models commonly provide us with uneconomical solutions since the optimization is carried out through active investments or network reinforcements to attend the normal and the emergency condition (n-1 criteria), based on technical criteria, like voltage and overload . Frequently, these techniques recommended by the conventional analysis can be applied only in some contingencies, some of them with a small probability of occurrence.. This research develops an alternative to the conventional solutions, considering the investment optimization and using operative resources, such as: load shedding, generation rescheduling or network change operation (circuit breaker, e.g.) when operating in contingency. In this model, the generation is represented by a function that relates the intensity rescheduling and its costs and functions that relates load shedding cost, the intensity and duration of curtailment on each system bus. The model sets a network contingency reconfiguration, changing the circuit break situation (open or closed) and altering the topology. The calculation of cost of load discontinuity or social cost functions (damage cost) is shown in this thesis, considering analytical and aggregating methods. The search for an optimized solution can involve load shedding, generation rescheduling and topology changes as substitutes for network reinforcements, and may be obtained by genetic- evolutive algorithm. The procedures of the proposed model represent an advancement over the conventional Planning Process as it introduces, quantitatively, the consumer service continuity, meeting the sensibility criteria of the load characterization of each consumer class connected to the system bus, through operative resources, rescheduling, load shedding and topology changes. A case study illustrates the application of the proposed model.