Neste mestrado estudamos o problema integrado de produção e distribuição (PIPD). Ao resolver o PIPD, tenta-se obter de maneira integrada as decisões de produção, controle de estoque, distribuição e roteamento de veículos. Neste tipo de problema, em cada período, um único ou múltiplos itens são produzidos e distribuídos para os clientes com o objetivo de atender uma determinada demanda a um custo total mínimo. Ou seja, no PIPD deve-se decidir quando e quanto produzir de cada item e as rotas e distribuições de cada veículo tal que o custo final, que inclui custos de produção, estoque e distribuição, seja mínimo. Estudamos o problema e modelo matemático considerado em Armentano et al. (2011). Para tratar o PIPD propomos heurísticas baseadas em programação matemática e geramos instâncias com múltiplos itens para testar o desempenho destas heurísticas. Comparamos os resultados obtidos pelas heurísticas com o solver comercial Cplex. Os resultados mostram que algumas das abordagens propostas obtiveram soluções de boa qualidade considerando as instâncias geradas. / In this work, the integrated production and vehicle routing problem (IPVRP) was studied. IPRP is solved by deciding on a integrated way the production, inventory control, distribution and vehicle routing decisions. In this type of problem, in each period, a single or multiple items are produced and distributed to costumers in order to meet a certain demand while minimizing the total cost, i.e., decide when and how much to produce of each item and the routes and distribution for each vehicle such that the final cost, which includes production, inventory and distribution costs is minimal. We considered the problem and mathematical model studied in Armentano et al. (2011). In order to deal with IPRP, heuristics based on mathematical programming were proposed together with multiple items instances to test the performance of those heuristics. We compare their results with the comercial solver Cplex. Results showed that some proposed heuristics obtained good quality solutions considering the generated instances.

The division of resources between a group of people may cause con- flicts: Individuals with varying roles and responsibilities will claim different shares of the surplus to be divided. In this dissertation, we analyze how the decision to form a group will influence the bargaining behaviour of the members of that group. People will act collectively as certain tasks may require the participation of a specific number of individuals before it can be completed. We examine whether certain mechanisms can efficiently promote group formation for the sake of surplus production, and then, what will be the effect of these mechanisms on the behaviour of the group members. For these reasons, we constructed a novel surplus production and distribution interaction which we call the Anticipation Game (AG). The AG can be played between only two players (pairwise interaction) or among more then two players (group interaction). In our study we will analyze both the pairwise AG and the group version of AG, first by obtaining our own empirical data and then by performing a stochastic evolutionary analysis. We aim to provide answers on: i) how will a reputation based partner approval mechanism influence the surplus distribution in both the pairwise and the group AG, ii) will then limitations in obtaining the reputation of a potential partner alter the results of the pairwise AG? iii) will we notice any effect on the behaviour of players when they can repeatedly cooperate with the same partners in group interactions, iv) how natural selection may have shaped the behaviour of players in group formation interactions (both pairwise and group AG evolutionary analysis). / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Neste mestrado estudamos o problema integrado de produção e distribuição (PIPD). Ao resolver o PIPD, tenta-se obter de maneira integrada as decisões de produção, controle de estoque, distribuição e roteamento de veículos. Neste tipo de problema, em cada período, um único ou múltiplos itens são produzidos e distribuídos para os clientes com o objetivo de atender uma determinada demanda a um custo total mínimo. Ou seja, no PIPD deve-se decidir quando e quanto produzir de cada item e as rotas e distribuições de cada veículo tal que o custo final, que inclui custos de produção, estoque e distribuição, seja mínimo. Estudamos o problema e modelo matemático considerado em Armentano et al. (2011). Para tratar o PIPD propomos heurísticas baseadas em programação matemática e geramos instâncias com múltiplos itens para testar o desempenho destas heurísticas. Comparamos os resultados obtidos pelas heurísticas com o solver comercial Cplex. Os resultados mostram que algumas das abordagens propostas obtiveram soluções de boa qualidade considerando as instâncias geradas. / In this work, the integrated production and vehicle routing problem (IPVRP) was studied. IPRP is solved by deciding on a integrated way the production, inventory control, distribution and vehicle routing decisions. In this type of problem, in each period, a single or multiple items are produced and distributed to costumers in order to meet a certain demand while minimizing the total cost, i.e., decide when and how much to produce of each item and the routes and distribution for each vehicle such that the final cost, which includes production, inventory and distribution costs is minimal. We considered the problem and mathematical model studied in Armentano et al. (2011). In order to deal with IPRP, heuristics based on mathematical programming were proposed together with multiple items instances to test the performance of those heuristics. We compare their results with the comercial solver Cplex. Results showed that some proposed heuristics obtained good quality solutions considering the generated instances.

No description available.

L'augmentation de la concurrence économique internationale et les attentes accrues des clients ont imposé aux entreprises de prendre en compte non seulement le prix ou la qualité du produit, mais également la fiabilité et la rapidité des livraisons. Dans les industries ayant une composante manufacturière dominante telles que l'automobile et l'électronique, la distribution et les coûts de stockage constituent les deuxième et troisième catégories de coûts les plus importantes après les coûts de production. Par conséquent, les entreprises industrielles et de logistique recherchent continuellement des méthodes pour réduire le niveau des stocks et les coûts de distribution. Cette tendance a créé une interaction plus forte entre les différentes étapes de la chaîne logistique, et augmente de ce fait l'utilité pratique des modèles intégrés.Cette thèse considère deux catégories de problèmes d'ordonnancement intégré. La première catégorie est l'ordonnancement intégré de la production, distribution et stockage (Integrated Scheduling of Production-Distribution-Inventory, ISPDI) et la deuxième est l'ordonnancement intégré de la production, stockage, distribution et stockage (Integrated Scheduling of Production-Inventory-Distribution-Inventory, ISPIDI). Au niveau de la production, les tâches à réaliser sont traitées sur une seule machine et regroupées par lot de production, ce qui nécessite un coût et un temps de réglage. Elles doivent ensuite être livrées à un client prédéfini par un transporteur à capacité limitée, avant des dates dues données. Chaque aller-retour du transporteur entre l'usine et le client implique un coût de livraison et des délais de livraison. De plus, on suppose que les tâches qui sont terminées avant leur date de départ ou qui sont livrées au client avant leur date due entraînent un coût de stockage supplémentaire. Notre objectif est de minimiser le coût total comprenant les coûts de reglage, de stockage et de transport, tout en garantissant un niveau de service donné pour le client.Pour les problèmes ISPDI, nous avons d'abord fourni un modèle de programmation mixte entière pour le problème multi-produits, à un seul niveau, et avons développé un algorithme génétique amélioré pour le résoudre. Puis, nous avons modifié ce modèle pour prendre en compte le cas mono-produit, multi-niveau, et avons proposé deux méthodes, un algorithme hybride et un algorithme génétique, pour le résoudre. Pour les problèmes ISPIDI, nous avons établi un modèle général non-linéaire dans le cas mono-produit, et avons traité un cas spécifique du cas général. Puis nous avons démontré une propriété d'optimalité qui lie les ordonnancements de production et de livraison dans le cas particulier, pour finalement proposer une approche heuristique pour le résoudre. Pour chaque problème étudié et afin d'évaluer la performance des algorithmes proposés, des limites inférieures intéressantes sur les fonctions objectifs correspondantes ont été établies selon des méthodes différentes telles que la méthode de relaxation lagrangienne ou des méthodes basées sur les bornes inférieures du problème de bin packing. Les résultats des expérimentations montrent l'efficacité des modèles et algorithmes proposés en termes de qualité de la solution et de temps d'exécution. / Increasing global competition in the business world and heightened expectations of customers have forced companies to consider not only the pricing or product quality, but reliability and timeliness of the deliveries as well. In manufacturing-centric industries such as automotive and electronics, distribution and inventory costs constitute the second and third largest cost components following the production costs. Therefore, industrial and logistics companies need to continuously search for ways to lower the inventory level and distribution cost. This trend has created a closer interaction between the different stages of a supply chain, and increased the practical usefulness of the integrated models.This thesis considers two categories of integrated scheduling problems. One is Integrated Scheduling of Production-Distribution-Inventory problems (ISPDI problems) and the other is Integrated Scheduling of Production-Inventory-Distribution-Inventory problems (ISPIDI problems). Jobs are first processed on a single machine in the production stage, and then delivered to a pre-specified customer by a capacitated transporter. Each job has a distinct due date, and must be delivered to customer before this due date. Each production batch requires a setup cost and a setup time before the first job of this batch is processed. Each round trip between the factory and customer requires a delivery cost as well as a delivery time. Moreover, it is assumed that a job which is completed before its departure date or delivered to the customer before its due date will incur a corresponding inventory cost. Our objective is to minimize the total cost involving setup, inventory and delivery costs while guaranteeing a certain customer service level.For ISPDI problems, we firstly provide a mixed integer programming model for the case of multi-product, single-stage situation, and develop an improved Genetic algorithm (GA) for solving it. Then, we extend this model to a single-product, multi-stage model, and provide two methods, dominance-related greedy algorithm and GA, for solving it. For ISPIDI problems, we establish a general non-linear model for the case of single-product situation and devise a special case from the general model. Then we provide an optimality property between the production and delivery schedules for the special case. Finally, a heuristic approach is developed for solving it. For each problem under study, in order to evaluate the performance of the proposed algorithms, some interesting lower bounds on the corresponding objective functions are established according to different methods such as Lagrangian relaxation method, classical bin-packing based method. Computational results show the efficiency of the proposed models and algorithms in terms of solution quality and running time.

The thesis is aimed at creating a real business plan for setting up a business in the production and distribution of breakfast for the selected location. Theoretical starting points for the work include basic concepts related to focusing on the carrier idea of the plan, the creation of the business model, the composition of the business plan, in particular the analytical-research methods used in the planning. The analysis section deals with the validation of the business idea and includes the identification of key factors in the wider context of the environment, the summary of which is then followed by a suitable strategy for a start-up in this area. The draft part describes the chosen strategy for the start-up business, including the business model, and their development into parts of the business plan structure.

L'objectif poursuivi par la Commission européenne à travers la réglementation de la concurrence consiste en l'intégration des marchés nationaux en un marché communautaire unique. À cet effet, l'exécutif européen a très tôt érigé le secteur automobile en vecteur privilégié de cette unification, établissant un régime concurrentiel des restrictions verticales insérées dans les accords de production et de distribution automobile plus efficient que ne l'est le régime général des restrictions verticales. Désireuse, dans un premier temps, d'appréhender toujours plus finement les réalités économiques du secteur, la Commission a par la suite pris conscience de l'importance des services après-vente dans le processus concurrentiel. Il y a alors là les deux pans du régime automobile. D'une part, une appréhension de la conjoncture économique du secteur, d'autre part une prise en compte de la nature complexe du bien automobile. Cette dernière, commune à tous les biens intégrant des droits intellectuels et auxquels sont intrinsèquement liés des services après-vente, justifie donc des règles de concurrence particulières ne bénéficiant pourtant qu'au seul bien automobile. L'objectif de ce travail de recherche s'est alors axé sur la distinction des deux pans du régime automobile afin d'identifier les dispositions commandées par la nature complexe, pour ensuite proposer leur application à l'ensemble des biens complexes. / The European Commission's object through the regulations of the competition consists of the integration of the national markets within a unique community market. For that purpose, the European executive did present as soon as possible the car industry as a privileged vector of this unification, setting up a competitive system of the vertical limitations within the agreements of production and distribution more efficient than is the overall system. Willing, at first, to arrest always shrewdly the economic realities of the sector, the Commission came around the importance of after-sales services in the competitive process afterward. Here are then both sections of the car industry system. On one hand, an apprehension of the economic situation of the sector, on the other hand a consideration of the complex nature of the car goods. This last one, as for all the goods including intellectual rights and to whom are intrinsically linked after-sales services, justifies therefore particular rules of competition and yet benefiting the car industry only. The goal of this research work was then focused on the distinction of both sections of the car industry system, to identify the rules commanded by the complex nature in order to propose their application to the whole of the complex goods thereafter.

Increasing global competition in the business world and heightened expectations of customers have forced companies to consider not only the pricing or product quality, but reliability and timeliness of the deliveries as well. In manufacturing-centric industries such as automotive and electronics, distribution and inventory costs constitute the second and third largest cost components following the production costs. Therefore, industrial and logistics companies need to continuously search for ways to lower the inventory level and distribution cost. This trend has created a closer interaction between the different stages of a supply chain, and increased the practical usefulness of the integrated models.This thesis considers two categories of integrated scheduling problems. One is Integrated Scheduling of Production-Distribution-Inventory problems (ISPDI problems) and the other is Integrated Scheduling of Production-Inventory-Distribution-Inventory problems (ISPIDI problems). Jobs are first processed on a single machine in the production stage, and then delivered to a pre-specified customer by a capacitated transporter. Each job has a distinct due date, and must be delivered to customer before this due date. Each production batch requires a setup cost and a setup time before the first job of this batch is processed. Each round trip between the factory and customer requires a delivery cost as well as a delivery time. Moreover, it is assumed that a job which is completed before its departure date or delivered to the customer before its due date will incur a corresponding inventory cost. Our objective is to minimize the total cost involving setup, inventory and delivery costs while guaranteeing a certain customer service level.For ISPDI problems, we firstly provide a mixed integer programming model for the case of multi-product, single-stage situation, and develop an improved Genetic algorithm (GA) for solving it. Then, we extend this model to a single-product, multi-stage model, and provide two methods, dominance-related greedy algorithm and GA, for solving it. For ISPIDI problems, we establish a general non-linear model for the case of single-product situation and devise a special case from the general model. Then we provide an optimality property between the production and delivery schedules for the special case. Finally, a heuristic approach is developed for solving it. For each problem under study, in order to evaluate the performance of the proposed algorithms, some interesting lower bounds on the corresponding objective functions are established according to different methods such as Lagrangian relaxation method, classical bin-packing based method. Computational results show the efficiency of the proposed models and algorithms in terms of solution quality and running time.

Dans cette thèse, nous étudions trois problèmes d'ordonnancement de la chaîne logistique dans le modèle de production à la demande. Le premier problème est un problème d'ordonnancement de production et de distribution intermédiaire dans une chaîne logistique avec un producteur et un prestataire logistique. Le deuxième problème est un problème d'ordonnancement de production et de distribution aval avec des dates de début au plus tôt et des dates limites de livraison dans une chaîne logistique avec un producteur, un prestataire logistique et un client. Le troisième problème est un problème d'ordonnancement de production et de distribution aval avec des temps de réglage et des fenêtres de temps de livraison dans une chaîne logistique avec un producteur, un prestataire logistique et plusieurs clients. Pour les trois problèmes, nous étudions les problèmes d'ordonnancement individuels et les problèmes d'ordonnancement coordonnés. Nous proposons des algorithmes polynomiaux ou prouvons la NP-Complétude de ces problèmes, et développons des algorithmes exacts ou heuristiques pour résoudre les problèmes NP-Difficiles. Nous proposons des mécanismes de coordination et évaluons le bénéfice de la coordination. / In this dissertation, we aim at investigating three supply chain scheduling problems in the make-To-Order business model. The first problem is a production and interstage distribution scheduling problem in a supply chain with a manufacturer and a third-Party logistics (3PL) provider. The second problem is a production and outbound distribution scheduling problem with release dates and deadlines in a supply chain with a manufacturer, a 3PL provider and a customer. The third problem is a production and outbound distribution scheduling problem with setup times and delivery time windows in a supply chain with a manufacturer, a 3PL provider and several customers. For the three problems, we study their individual scheduling problems and coordinated scheduling problems: we propose polynomial-Time algorithms or prove the intractability of these problems, and develop exact algorithms or heuristics to solve the NP-Hard problems. We establish mechanisms of coordination and evaluate the benefits of coordination.

Operational performance of grid-connected microgrid with integrated solar photovoltaic (PV) electricity production and battery energy storage (BES) is investigated.  These distributed energy resources (DERs) have the potential to reduce conventionally produced electrical power and contribute to reduction of greenhouse gas emissions.  This investigation is based upon the DER’s techno-economic specifications and theoretical performance, consumer load data and electrical utility retail and distribution data.  Available literature provides the basis for DER specification and performance.  Actual consumer load profile data is available for residential and commercial consumer sector customers.  The electrical utility data is obtained from Mälarenergi, AB.  The aim is to investigate how to use simulations to specify a grid connected microgrid with DERs (PV production and a BES system) for two consumer sectors considering a range of objectives.  An open-source, MATLAB-based simulation tool called Opti-CE has successfully been utilized.  This package employs a genetic algorithm for multi-objective optimization.  To support attainment of one of the objectives, peak shaving of the consumer load, a battery operational strategy algorithm has been developed for the simulation.  With respect to balancing peak shaving and self-consumption one of the simulations supports specification of a commercial sector application with 117 kWp PV power rating paired with a lithium ion battery with 41.1 kWh capacity.  The simulation of this system predicts the possibility to shave the customer load profile peaks for the month of April by 20%.  The corresponding self-consumption ratio is 88%.  Differences in the relationship between the load profiles and the system performance have been qualitatively noted.  Furthermore, simulation results for lead-acid, lithium-ion and vanadium-redox flow battery systems are compared to reveal that lithium ion delivers the best balance between total annualized cost and peak shaving performance for both residential and commercial applications.