Spelling suggestions: "subject:"cocation problem"" "subject:"borocation problem""
21 |
Reliable p-hub location problems and protection models for hub network designKim, Hyun 11 September 2008 (has links)
No description available.
|
22 |
Otimização do problema de localização de instalações aplicado ao comércio e distribuição de combustíveis / An algorithm for the plant location problem optimization applied to oil and gas Logistics.Thiago Soares Pinheiro 11 March 2015 (has links)
Um dos problemas mais relevantes em organizações de grande porte é a escolha de locais para instalação de plantas industriais, centros de distribuição ou mesmo pontos comerciais. Esse problema logístico é uma decisão estratégica que pode causar um impacto significativo no custo total do produto comercializado. Existem na literatura diversos trabalhos que abordam esse problema. Assim, o objetivo desse trabalho é analisar o problema da localização de instalações proposto por diferentes autores e definir um
modelo que seja o mais adequado possível ao mercado de distribuição de combustíveis no Brasil. Para isso, foi realizada uma análise do fluxo de refino e distribuição praticado neste segmento e da formação do respectivo custo de transporte. Foram consideradas restrições como capacidade de estoque, gama de produtos ofertados e níveis da hierarquia de distribuição. A partir dessa análise, foi definido um modelo matemático aplicado à
redução dos custos de frete considerando-se a carga tributária. O modelo matemático foi implementado, em linguagem C, e permite simular o problema. Foram aplicadas técnicas de computação paralela visando reduzir o tempo de execução do algoritmo. Os resultados obtidos com o modelo Single Uncapacited Facility Location Problem (SUFLP) simulado
nas duas versões do programa, sequencial e paralela, demonstram ganhos de até 5% em economia de custos e redução do tempo de execução em mais de 50%. / One of the most relevant problems at large organizations is the choice of locations
for estabilishing facilities, distribution centers or retail stores. This logistics issue is an
strategic decision which may cause signicant impact at the eective cost of the product.
There are several papers tackling this issue. The objective of this dissertation is to analyze
the Facility Location Problem previously developed by other authors and to dene the
most applicable model to the fuel distribution industry in Brazil. It started from the
analyzis of the upstream and downstream
ow in practice at this segment and from the
respective transportation cost formation. Some constraints were considered like stock
capacity, multicommodity oer and distribution hierarchy levels so it could be possible to
dene a mathematical model applied to freight economy considering the incident taxes.
The dissertation also has the objective of creating a program using the C language which
could simulate the problem. It were applied parallel computing techniques to reduce
runtime of the algorithm. The results obtained from the Single Uncapacited Facility
Location Problem (SUFLP) executed in both program versions, sequential and parallel,
demonstrate up to 5% of eective costs gain and reduction of more than 50% in execution
time.
|
23 |
Bi-objective Facility Location Problems In The Presence Of Partial CoverageSilav, Ahmet 01 June 2009 (has links) (PDF)
In this study, we propose a bi-objective facility location model that considers both partial coverage and service to uncovered demands. In this model, it is assumed that the demand nodes within the predefined distance of opened facilities are fully covered and after that distance the coverage level linearly decreases. The objectives are the maximization of the sum of full and partial coverage the minimization of the maximum distance between uncovered demand nodes and their closest opened facilities. We apply two existing Multi Objective Genetic Algorithms (MOGAs),
NSGA-II and SPEA-II to the problem. We determine the drawbacks of these MOGAs and develop a new MOGA called modified SPEA-II (mSPEA-II) to avoid the drawbacks. In this method, the fitness function of SPEA-II is modified and the
crowding distance calculation of NSGA-II is used. The performance of mSPEA-II is tested on randomly generated problems of different sizes. The results are compared
with the solutions resulting from NSGA-II and SPEA-II. Our experiments show that mSPEA-II outperforms both NSGA-II and SPEA-II.
|
24 |
Ιεραρχική ανάλυση αποφάσεων (AHP) : ένα μοντέλο λήψης αποφάσεων σε συνθήκες πολλαπλών κριτηρίωνΚόλλια, Ηλιάνα 17 September 2012 (has links)
Η παρούσα εργασία σκοπεύει στην παρουσίαση και ανάλυση μιας μεθόδου Λήψης Αποφάσεων η οποία διαχειρίζεται αποφάσεις πολυσταδιακές ως προς τα κριτήρια. Πρόκειται για αποφάσεις οι οποίες έχουν συγκεκριμένες εναλλακτικές επιλογές και πολλαπλά κριτήρια. Αποφάσεις σαν αυτές συνδέονται με κάθε επιστημονικό κλάδο αλλά τις συναντάμε και στην καθημερινότητα μας, γεγονός που καθιστά τον αποτελεσματικό χειρισμό τους σημαντικό.
Η μέθοδος με την οποία θα ασχοληθούμε ονομάζεται Αναλυτική Ιεραρχική Διαδικασία (Analytic Hierarchy Process – AHP), δημιουργός της είναι ο Thomas L. Saaty και χρονολογείται μέσα στην δεκαετία του 1970. Η AHP βασίζεται στις σχετικές συγκρίσεις ανάμεσα στους παράγοντες που προσδιορίζουν την εκάστοτε απόφαση. Οι συγκρίσεις πραγματοποιούνται με κοινή βάση την θεμελιώδη κλίμακα του Saaty. Στο πρώτο κεφάλαιο όπου παρουσιάζεται το θεωρητικό υπόβαθρο της μεθόδου, θα δούμε ότι με τον τρόπο αυτό η AHP καθιστά τα πάντα μετρήσιμα. Σκοπός είναι μέσω της ιεραρχική δόμησης του προβλήματος να προσδιοριστεί η καλύτερη από τις εναλλακτικές.
Η AHP προσεγγίζει με απλότητα την πολυπλοκότητα των αποφάσεων, γεγονός που κάνει την εννοιολογικά απλή προσέγγιση της μεθόδου εξαιρετικά ισχυρή. Στην πορεία της εργασίας θα παρουσιάσουμε το μαθηματικό υπόβαθρο της μεθόδου μέσα από την αξιωματική θεμελίωση όπως δόθηκε από τον Thomas L. Saaty. Τέλος, θα αναλύσουμε προβλήματα επιλογής τοποθεσίας σε διεθνές επίπεδο και θα ολοκληρώσουμε με την υλοποίηση ενός τέτοιου προβλήματος στο Expert Choice. / This paper intends to present and analyze a method of multi-criteria decision making. In these decisions the alternatives have been predetermined and there are multiple criteria affecting them. Decisions like these are linked with many areas of science, but there are in everyone’s daily lives too, fact that makes the effective handling really important. The present study is been dealing with a method called Analytic Hierarchy Process (AHP), invented by Thomas L. Saaty in seventies. The AHP is based on pairwise comparisons among the factors that determine the decision. The Saaty’s fundamental scale of absolute numbers is used in making paired comparison judgments. In the first chapter of the study where the theoretical base of the method is represented, will be seen that AHP with the relative comparisons makes everything measurable. AHP intends through hierarchical structuring of the problem to determine the best of the alternatives. The AHP approach with simplicity to the complexity of decisions makes the method conceptually simple and extremely powerful. Later in this paper will be presented the mathematical background of the method through the axiomatic foundation as given by Thomas L. Saaty. Finally, will be dealt with problems of location selection decisions in international operations and the paper will be completed with the implementation of such a problem in Expert Choice.
|
25 |
Otimização do problema de localização de instalações aplicado ao comércio e distribuição de combustíveis / An algorithm for the plant location problem optimization applied to oil and gas Logistics.Thiago Soares Pinheiro 11 March 2015 (has links)
Um dos problemas mais relevantes em organizações de grande porte é a escolha de locais para instalação de plantas industriais, centros de distribuição ou mesmo pontos comerciais. Esse problema logístico é uma decisão estratégica que pode causar um impacto significativo no custo total do produto comercializado. Existem na literatura diversos trabalhos que abordam esse problema. Assim, o objetivo desse trabalho é analisar o problema da localização de instalações proposto por diferentes autores e definir um
modelo que seja o mais adequado possível ao mercado de distribuição de combustíveis no Brasil. Para isso, foi realizada uma análise do fluxo de refino e distribuição praticado neste segmento e da formação do respectivo custo de transporte. Foram consideradas restrições como capacidade de estoque, gama de produtos ofertados e níveis da hierarquia de distribuição. A partir dessa análise, foi definido um modelo matemático aplicado à
redução dos custos de frete considerando-se a carga tributária. O modelo matemático foi implementado, em linguagem C, e permite simular o problema. Foram aplicadas técnicas de computação paralela visando reduzir o tempo de execução do algoritmo. Os resultados obtidos com o modelo Single Uncapacited Facility Location Problem (SUFLP) simulado
nas duas versões do programa, sequencial e paralela, demonstram ganhos de até 5% em economia de custos e redução do tempo de execução em mais de 50%. / One of the most relevant problems at large organizations is the choice of locations
for estabilishing facilities, distribution centers or retail stores. This logistics issue is an
strategic decision which may cause signicant impact at the eective cost of the product.
There are several papers tackling this issue. The objective of this dissertation is to analyze
the Facility Location Problem previously developed by other authors and to dene the
most applicable model to the fuel distribution industry in Brazil. It started from the
analyzis of the upstream and downstream
ow in practice at this segment and from the
respective transportation cost formation. Some constraints were considered like stock
capacity, multicommodity oer and distribution hierarchy levels so it could be possible to
dene a mathematical model applied to freight economy considering the incident taxes.
The dissertation also has the objective of creating a program using the C language which
could simulate the problem. It were applied parallel computing techniques to reduce
runtime of the algorithm. The results obtained from the Single Uncapacited Facility
Location Problem (SUFLP) executed in both program versions, sequential and parallel,
demonstrate up to 5% of eective costs gain and reduction of more than 50% in execution
time.
|
26 |
Location planning for electric charging stations and wireless facilities in the era of autonomous vehicle operationsAmir Davatgari (10724118) 29 April 2021 (has links)
This thesis proposes a planning framework for Autonomous Electric Vehicle (AEV) charging. The
framework is intended to help transportation decision-makers determine Electric Vehicle (EV) charging facility locations and capacities for the mixed fleet of Autonomous Vehicle (AV) and Human-driven Vehicle (HDV). The
bi-level nature of the framework captures the decision-making processes of the
transportation agency decision-makers and travelers, thereby providing solid
theoretical and practical foundations for the EV charging network design. At
the upper level, the decision-makers seek to determine the locations and
operating capacities of the EV charging facilities, in a manner that minimizes
total travel time and construction costs subject to budgetary limitations. In
addition, the transportation decision-makers provide AV-exclusive lanes to
encourage AV users to reduce travel time, particularly at wireless-charging
lanes, as well as other reasons, including safety. At the lower level, the
travelers seek to minimize their travel time by selecting their preferred
vehicle type (AV vs. HDV) and route. In measuring the users delay costs, the
thesis considered network user equilibrium because the framework is designed
for urban networks where travelers route choice affects their travel time. The
bi-level model is solved using the Non-Dominated Sorting Genetic Algorithm
(NSGA-II) algorithm.
|
27 |
Configuração de uma rede de distribuição capacitada com restrição de cobertura. / Configuring a capacitated distribution network with coverage constraint.Pires, Thiago 05 May 2006 (has links)
O presente estudo trata da configuração de uma rede de distribuição capacitada com restrição de cobertura. O objetivo é determinar quais cidades, dentre um conjunto de candidatas, devem atuar como centrais de desconsolidação de carga, de forma a minimizar o custo total de transporte (transferência e distribuição) para uma determinada demanda, atendendo às restrições operacionais e de distância de cobertura. A partir da pesquisa na literatura sobre o assunto, foi preparado um modelo de programação linear inteira para encontrar a solução ótima para o problema. Esse modelo é baseado nos clássicos problemas de localização, com modificação na função objetivo para retratar melhor a estrutura de custos de transporte, além da inclusão de restrições de cobertura e restrições de atendimento mínimas e máximas em cada central. O modelo foi implementado utilizando o suplemento Solver da planilha eletrônica Excel. Um outro enfoque de solução baseado na metaheurística Busca Tabu (Tabu Search) foi elaborado, com dois objetivos: permitir a análise de problemas quando não se tem disponível uma ferramenta para solução de modelos de programação linear; e analisar o comportamento da metaheurística quando utilizada na solução desse tipo de problema. O procedimento foi implementado a partir da construção de macros em linguagem Visual Basic for Application (VBA), também em Excel. O modelo de programação linear e a metaheurística Busca Tabu foram aplicados a alguns cenários de um problema real. Resultados, comparações e conclusões dessas aplicações são apresentados neste trabalho. / The present study deals with configuring a capacitated distribution network with coverage constraint. The objective consists of determining which cities, among a set of candidates, should act as load deconsolidation centers, aiming to minimize transportation total costs to attend a given demand, and obeying all operational constraints and coverage distances. Based on a literature review, an integer linear programming model was formulated to find the problem optimal solution. The model is based on classical location problems, but includes changes in the objective function to incorporate the transportation costs structure, besides coverage constraints and minimum and maximum central capacity constraints. The model was implemented using Excels Solver add-in. Another solution approach based on the Tabu Search metaheuristic was proposed, with two objectives: to permit problem analysis when linear programming tools are not available; and to learn on metaheuristic behavior when used to solve this type of problem. The Tabu Search procedure was implemented using Excel macro language in Visual Basic for Applications (VBA). Both integer linear programming and metaheuristic models were applied to some scenarios of a real-world problem. Applications results, comparisons and conclusions are presented in this work.
|
28 |
Problème d'implantation de plateformes de logistiques durables en milieu urbain / Location problem of sustainable logistics platforms in urban areasNdhaief, Nadia 09 March 2018 (has links)
L’environnement urbain est fortement ancré dans la gestion des flux logistiques. La mutualisation de ces différents flux apporte alors une solution qualitative répondant aux critères environnementaux, économiques et sociétaux. Cette thèse propose une approche pour la mise en place des centres de distribution urbains (CDU) en combinant la logistique de distribution avec la logistique inverse (flux montants et flux descendants). L’objectif principal de ces CDU est d'assurer un développement durable dans les villes modernes. L’hétérogénéité des pratiques de la logistique de distribution et de la logistique inverse constitue le principal verrou scientifique. La mutualisation de ces différents flux apporte alors une solution qualitative et durable dès lors qu’elle répond aux critères attendus : environnementaux, économiques et sociétaux. Dans un contexte de logistique globale, nous nous sommes basés sur les problèmes de localisation de plateformes HLP « Hub Location Problem » afin de formuler le problème de localisation des CDU selon un critère de maximisation du profit par le choix du meilleur emplacement parmi ceux disponibles. Nous avons calculé les localisations partiellement possibles, tout en garantissant le traitement des flux retournés (collecte, tri, revente) et aussi en tenant compte des coûts socio-environnementaux. Par la suite, nous avons utilisé des outils de résolution du modèle proposé via des algorithmes d’optimisation. L’efficacité de ces algorithmes a été confirmée par un ensemble de jeux de données et de rapports d’analyse d’impacts. La dynamique liée à la fiabilité des CDU dans l’exécution du service par la prise en compte d’une politique de coordination inter-CDU fait aussi partie de notre étude. Nous nous sommes intéressés à l’aspect de disponibilité pour garantir les livraisons à temps. En effet, l’indisponibilité du système peut être due aux pannes aléatoires, aux actions de maintenance préventive planifiées, etc. Par conséquent, nous présentons une solution qui permet de satisfaire la demande journalière de manière ponctuelle par l’intégration d’une approche collaborative entre les différents sites. Il s’agit d’un modèle d’optimisation de la politique de coordination inter-CDU avec une stratégie de sous-traitance des livraisons en cas d’indisponibilité / The urban environment is strongly involved in the management of logistics flows. The pooling of these different flows provides a qualitative solution ensuring environmental, economic and societal criteria. The thesis objectives aim at supporting Urban Distribution Centers (CDU) by combining distribution logistics with reverse logistics (upstream flows and downstream flows), thereby ensuring sustainable development in modern cities. The heterogeneity of the distribution logistics practices and the reverse logistics define the core of this thesis. Sharing these different flows provides a qualitative and sustainable solution as long as it meets the aforementioned criteria (environment, economy and society). Our approach is based on the Hub Location Problem to formulate the location problem of UDC while maximizing the profit and choosing the best available location. We proceed by identifying potential available locations, while guaranteeing returned flows management (collection, sorting, resale, etc.) and reducing pollution impact. Moreover, we simulate our optimised model with simulation tools using optimization algorithms. The effectiveness of these algorithms are validated based on generated outputs (set of data) inspired by real world scenarios. Reliability is a part of this work when dealing with UDC deployment. The unavailability of the system may be due to random failures, planned preventive maintenance actions, etc. Therefore, we present a solution supporting daily demands by integrating a collaborative approach between different sites. This approach is based on inter-CDU coordination policy with a strategy of subcontracting deliveries dealing with unavailability
|
29 |
Uma aplicação do SIG para a localização e alocação de terminais logísticos em áreas urbanas congestionadas / An application of the SIG for the location and allocation of logistics terminals in congested urban areasCarrara, Camilla Miguel 17 August 2007 (has links)
O presente trabalho a partir da caracterização da problemática dos transportes na área central de Uberlândia (MG), e com a utilização das ferramentas do software TransCAD (SIG-T), como problema de localização de instalações e roteirização de veículos, buscou-se propor uma alternativa que contribuísse para a distribuição urbana de cargas, principalmente nas áreas centrais urbanas, com foco na minimização dos custos de transporte e considerando a realidade brasileira e as atuais discussões sobre alternativas de inovações operacionais e tecnológicas. O método escolhido para o estudo de caso baseou-se nos dados georeferenciados da rede viária urbana e de movimentação de cargas na área central da cidade, de forma a orientar estratégias modernas e mais eficazes para distribuição física de produtos e proporcionar melhores condições no fluxo nestas áreas. O método ainda apoiou-se na definição e caracterização do conceito de logística urbana e de terminais logísticos, e a influência que exerceriam na distribuição urbana de cargas, principalmente nas áreas centrais, da cidade de Uberlândia. O software mostrou-se uma ferramenta de apoio a decisões no planejamento urbano. Pode-se validar o uso do software TransCAD na busca por soluções ótimas para os terminais logísticos e na roteirização dos veículos que compõem a frota dos terminais, assim, acredita-se que é uma ferramenta para operações logísticas. Mesmo com algumas limitações do software, este contribui para que chegássemos aos resultados finais alcançando os objetivos iniciais propostos. / The present work starting from the characterization of transport problem in the Uberlândia (MG) central area , and with the use of tools of the software TransCAD (SIG-T), as facility location problem and vehicle routing, it was looked for to propose an alternative to contribute to the urban goods distribution, mainly in the urban central areas, with focus in the minimization of the transport costs and considering the brazilian reality and the current discussions on alternatives of operational and technological innovations. The chosen method for the study of case based on the data of the urban road net and goods movement in the central area of the city, in way to guide modern and more effective strategies for physical products distribution and to provide better conditions in the flow in these areas. The method still leaned on in the definition and characterization of the concept of logistics urban and logistics terminals, and the influence that they would exercise in the urban goods distribution, mainly in the central areas, of the Uberlândia city. The software was shown a support tool to decisions in the urban planning. The use of the software TransCAD can be validated in the search by great solutions for the logistics terminals and in the vehicle routing that compose the fleet of the terminals, like this, it is believed that is a tool for logistics operations. Even with some limitations of the software, this contributes so that we arrived to the final results reaching the objectives initials proposed.
|
30 |
Uma aplicação do SIG para a localização e alocação de terminais logísticos em áreas urbanas congestionadas / An application of the SIG for the location and allocation of logistics terminals in congested urban areasCamilla Miguel Carrara 17 August 2007 (has links)
O presente trabalho a partir da caracterização da problemática dos transportes na área central de Uberlândia (MG), e com a utilização das ferramentas do software TransCAD (SIG-T), como problema de localização de instalações e roteirização de veículos, buscou-se propor uma alternativa que contribuísse para a distribuição urbana de cargas, principalmente nas áreas centrais urbanas, com foco na minimização dos custos de transporte e considerando a realidade brasileira e as atuais discussões sobre alternativas de inovações operacionais e tecnológicas. O método escolhido para o estudo de caso baseou-se nos dados georeferenciados da rede viária urbana e de movimentação de cargas na área central da cidade, de forma a orientar estratégias modernas e mais eficazes para distribuição física de produtos e proporcionar melhores condições no fluxo nestas áreas. O método ainda apoiou-se na definição e caracterização do conceito de logística urbana e de terminais logísticos, e a influência que exerceriam na distribuição urbana de cargas, principalmente nas áreas centrais, da cidade de Uberlândia. O software mostrou-se uma ferramenta de apoio a decisões no planejamento urbano. Pode-se validar o uso do software TransCAD na busca por soluções ótimas para os terminais logísticos e na roteirização dos veículos que compõem a frota dos terminais, assim, acredita-se que é uma ferramenta para operações logísticas. Mesmo com algumas limitações do software, este contribui para que chegássemos aos resultados finais alcançando os objetivos iniciais propostos. / The present work starting from the characterization of transport problem in the Uberlândia (MG) central area , and with the use of tools of the software TransCAD (SIG-T), as facility location problem and vehicle routing, it was looked for to propose an alternative to contribute to the urban goods distribution, mainly in the urban central areas, with focus in the minimization of the transport costs and considering the brazilian reality and the current discussions on alternatives of operational and technological innovations. The chosen method for the study of case based on the data of the urban road net and goods movement in the central area of the city, in way to guide modern and more effective strategies for physical products distribution and to provide better conditions in the flow in these areas. The method still leaned on in the definition and characterization of the concept of logistics urban and logistics terminals, and the influence that they would exercise in the urban goods distribution, mainly in the central areas, of the Uberlândia city. The software was shown a support tool to decisions in the urban planning. The use of the software TransCAD can be validated in the search by great solutions for the logistics terminals and in the vehicle routing that compose the fleet of the terminals, like this, it is believed that is a tool for logistics operations. Even with some limitations of the software, this contributes so that we arrived to the final results reaching the objectives initials proposed.
|
Page generated in 0.3357 seconds