• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 12
  • 9
  • 5
  • 3
  • 1
  • 1
  • 1
  • Tagged with
  • 35
  • 35
  • 17
  • 10
  • 7
  • 6
  • 6
  • 6
  • 6
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

Consolidation problems in freight transportation systems: mathematical models and algorithms / Problemas de consolidação em sistemas de transportes: modelos matemáticos e algoritmos

Castellucci, Pedro Belin 12 August 2019 (has links)
Freight distribution systems are under stress. With the world population growing, the migration of people to urban areas and technologies that allow purchases from virtually anywhere, efficient freight distribution can be challenging. An inefficient movement of goods may lead to business not being economically viable and also has social and environmental negative effects. An important strategy to be incorporated in freight distribution systems is the consolidation of goods, i.e., group goods by their destination. This strategy increases vehicles utilisation, reducing the number of vehicles and the number of trips required for the distribution and, consequently, costs, traffic, noise and air pollution. In this thesis, we explore consolidation in three different contexts (or cases) from an optimisation point of view. Each context is related to optimisation problems for which we developed mathematical programming models and solution methods. The first case in which we explore consolidation is in container loading problems (CLPs). CLPs are a class of packing problems which aims at positioning three-dimensional boxes inside a container efficiently. The literature has incorporated many practical aspects into container loading solution method (e.g. restricting orientation of boxes, stability and weight distribution). However, to the best of our knowledge, the case considering more dynamic systems (e.g. cross-docking) in which goods might have a schedule of arrival were yet to be contemplated by the literature. We define an extension of CLP which we call Container Loading Problem with Time Availability Constraints (CLPTAC), which considers boxes are not always available for loading. We propose an extension of a CLP model that is suitable for CLPTAC and solution methods which can also handle cases with uncertainty in the schedule of the arrival of the boxes. The second case is a more broad view of the network, considering an open vehicle routing problem with cross-dock selection. The traditional vehicle routing problem has been fairly studied. Its open version (i.e. with routes that start and end at different points) has not received the same attention. We propose a version of the open vehicle routing problem in which some nodes of the network are consolidation centres. Instead of shippers sending goods directly to their consumers, they must send to one of the available consolidation centres, then, goods are resorted and forwarded to their destination. For this problem, we propose a mixed integer linear programming model for cost minimisation and a solution method based on the Benders decomposition framework. A third case in which we explored consolidation is in collaborative logistics. Particularly, we focus on the shared use of the currently available infrastructure. We defined a hub selection problem in which one of the suppliers is selected as a hub. In a hub facility, other suppliers might meet to exchange their goods allowing one supplier to satisfy the demand from others. For this problem, we propose a mixed integer linear programming model and a heuristic based on the model. Moreover, we compared a traditional distribution strategy, with each supplier handling its demand, against the collaborative one. In this thesis, we explore these three cases which are related to consolidation for improving the efficiency in freight distribution systems. We extend some problems (e.g. versions of CLP) to apply them to a more dynamic setting and we also define optimisation problems for networks with consolidation centres. Furthermore, we propose solution methods for each of the defined problems and evaluate them using randomly generated instances, benchmarks from the literature and some cases based on real-world characteristics. / Sistemas de distribuição de carga possuem uma demanda muito alta. Com a população mundial crescendo, a migração em direção às áreas urbanas e as tecnologias que permitem compras de virtualmente qualquer lugar, a distribuição eficiente de mercadorias pode ser um desafio. Uma movimentação ineficiente de mercadorias pode tornar negócios economicamente inviáveis além de ter um impacto social e ambiental negativos. Uma estratégia importante para se incorporar em sistemas de distribuição é a consolidação de cargas, isto é, agrupar cargas de acordo com seus destinos. Essa estratégia aumenta a utilização dos veículos, reduzindo o número de veículos e viagens necessários para a distribuição e, consequentemente, custos, tráfego, poluição sonora e do ar. Nesta tese, é explorada a técnica de consolidação em três casos diferentes de um ponto de vista de otimização. Cada caso é relacionado a problemas de otimização para os quais são propostos modelos de programação matemática e métodos de solução. O primeiro caso em que é explorada a consolidação é em Problemas de Carregamento de Contêineres (PCCs). PCCs pertencem a uma classe de problemas de empacotamento que visa posicionar caixas tridimensionais dentro de contêineres eficientemente. A literatura tem incorporado diversos aspectos práticos em procedimentos de solução dos PCCs (por exemplo, restringir a orientação das caixas, estabilidade e distribuição de peso). No entanto, o caso que considera sistemas logísticos mais dinâmicos (como cross-docking), nos quais mercadorias podem ter uma agenda de chegada ainda não havia sido contemplados. É definida uma extensão de PCC chamada de Problema de Carregamento de Contêieneres com Restrições de Disponibilidade Temporal (PCCRDT). Também, propõem-se modelos e métodos de solução para o PCCRDT que são capazes de lidar com incerteza na chegada das mercadorias. O segundo caso utiliza uma visão mais abrangente da rede de distribuição, considerando um problema de roteamento de veículos em rede aberta com seleção de cross-dock. O problema tradicional de roteamento de veículos é bastante estudado. A sua versão aberta (com rotas que começam e terminam em pontos diferentes) não tem recebido tanta atenção. É proposta uma versão do roteamento de veículos em rede aberta em que alguns nós da rede são centros de consolidação. Os fornecedores, ao invés de enviar as mercadorias diretamente para os consumidores, enviam-nas para um dos centros de consolidação disponíveis, então, as mercadorias são reorganizadas (em diferentes veículos) e encaminhadas para o seus destinos. Para esse problema, é proposto um modelo de programação linear inteira mista para a minimização de custo e um método de solução baseado no arcabouço de decomposição de Benders. Um terceiro caso em que foi explorada a consolidação de mercadorias é o de logística colaborativa. Particularmente, se concentrou no uso compartilhado de infra-estrutura já disponível na rede de distribuição. É definido um problema de seleção de seleção de um dos fornecedores como hub. No hub, outros fornecedores podem se encontrar para trocar suas mercadorias, permitindo que um fornecedor satisfaça a demanda de outro. Para esse problema, é proposto um modelo de programação linear inteira mista e uma heurística baseada no modelo. Ainda, é comparada uma estratégia de distribuição convencional (com cada fornecedor responsável pela sua própria demanda) com uma estratégia colaborativa. Nesta tese, são explorados esses três casos que se relacionam com consolidação para melhorar a eficiência de sistemas de distribuição de carga. São estendidos alguns problemas (como o PCC) para que se possa aplicá-los em cenários mais dinâmicos e também são definidos problemas de otimização em redes com centros de consolidação. Além disso, são propostos métodos de solução para cada um dos casos. Os métodos são avaliados em instâncias geradas aleatoriamente, instâncias da literatura e, em alguns casos, instâncias baseadas em cenários reais.
32

Improving freight consolidation networks using IP-based local search

Lindsey, Kathleen A. 21 August 2012 (has links)
This dissertation addresses problems arising in freight routing and scheduling where full truckload (FTL) and less-than-truckload (LTL) carriers are used to serve transportation needs. Each of the problems investigated in this dissertation tries to optimize/maximize consolidation to decrease system transportation costs by (1) carefully choosing the timing and path of freight and/or (2) introducing consolidation points. Approaches are proposed that enable effective planning and operation of freight routing and scheduling for large-scale transportation networks. Chapter 2 presents solution approaches for a shipper pickup and delivery planning problem faced by many large retailers to move freight from suppliers to distribution centers. Each shipment is moved either direct via a LTL carrier or possibly consolidated with other shipments and moved by one or two FTL routes. When using a FTL carrier, the shipper takes advantage of contracted lane rates that establish prices per mile for a truck operated between two locations that are significantly less than the comparable LTL price for shipping a full truckload. Consolidated FTL routes may each visit multiple shipment origins (supplier locations) and/or destinations (distribution center locations). Additionally, FTL routes may move shipments through a single crossdock facility en route. The challenge in this planning problem is to exploit as much as possible negotiated truckload lane rates and to judiciously make use of routes through crossdock facilities to consolidate shipments. The primary contributions of this section are that (1) an interesting new problem variant is introduced to the field of transportation and logistics that is important in practice and (2) the solution approach demonstrates that exploiting knowledge of the problem and solution structure to cleverly select subsets of path variables for evaluation during each iteration of an integer programming based local search heuristic is effective on path-based routing models. Chapter 3 evaluates how to route each customer shipment through a sequence of transfer terminals in a LTL carrier network. At each terminal stop, a shipment is unloaded from an inbound trailer and reloaded onto an outbound trailer. A load plan determines the specific sequence of terminal transfers to be used for freight moving between each origin and destination. The design of the load plan determines the linehaul transportation and handling costs required to serve customers. We develop an improved very large-scale neighborhood search heuristic for solving an integer programming model for load plan design. The main contributions of this section include (1) the investigation of the pros and cons of optimizing system-wide into a single destination versus optimizing freight for all destinations in a small region, and (2) a solution approach that can find load plans with costs 6 to 7\% lower than those used in practice, and can find 2.5 to 5\% additional cost savings using the same time budget when compared to an approach optimizing system-wide into a single destination. Chapter 4 addresses a strategic planning problem that extends the load plan design problem to consider terminal roles. We investigate two-stage approaches that first identify the set of transfer terminals and then develop the corresponding load plan. Computational results compare the terminals chosen as transfer facilities from the proposed integer programming based local search method with a traditional hub location formulation and a simple facility location formulation to depict the benefits gained from modeling additional information. The key contributions of this section are (1) the introduction of a new hub location problem variant incorporating freight dispatch timing and trailer transportation cost characteristics found in the LTL trucking industry and (2) a solution approach utilizing IP-based local search that demonstrates the importance of incorporating freight dispatch timing. Finally, Chapter 5 summarizes the main conclusions from this dissertation and discusses directions for further research.
33

Implementace logistických technologií v potravinářském průmyslu / Implementation of logistic technologies in food industry

ŽEMLIČKA, Kamil January 2014 (has links)
This diploma thesis focuses on proposal of possibilities when applying logistic technologies in food supply chain of the MADETA, a.s. The thesis describes material and information flow in the supply chain, including determination of key factors for successful implementation of chosen technologies. A part of the thesis deals with the proposal for a change in the way of preparing orders for customers of independent market, including stating of expected costs and savings when realizing the proposal.
34

Développement des plate-formes logistiques au Maroc : enjeux et perspectives / Development of logistics platforms in Morocco : issues and prospects

Hassini, Sanaa 21 October 2015 (has links)
Depuis les années 70, la production et la commercialisation des biens et services, la circulation des capitaux et des systèmes se sont fortement internationalisées. Ce phénomène a poussé les entreprises à optimiser leurs chaînes logistiques pour rester compétitives. Le Maroc s'inscrit dans la même tendance, vue sa position géographique joue un rôle de carrefour et de hub des échanges commerciaux. Le développement d'une réelle compétitivité logistique constitue un pilier du programme gouvernemental 2010-2020, d'où le lancement de la stratégie nationale pour le développement de la compétitivité logistique, dont principalement le contrat programme régissant le développement des plateformes logistiques, dites zones logistiques multi flux. La stratégie vise la réduction du poids du coût logistique de 5 points pour 2015, la création de 70 zones logistiques dans 17 villes sur environ 3 300 hectares. La mise en œuvre de ce programme logistique nécessite un effort cohérent, s'inscrivant dans le temps et des arbitrages complexes à opérer sur des domaines ne relevant pas des prérogatives d'un seul intervenant de la chaîne logistique. À la lumière de ces propos, nous avons vu en cette problématique un enjeu majeur nécessitant des actions managériales, une réflexion académique aussi par un focus sur le principe de la Supply Chain et plus précisément la logistique des plateformes. L'agencement et la connectivité des plateformes logistiques s'avère décisionnelle pour la réussite d'une politique commerciale compétitive d'une entreprise : nous ne pouvons pas concevoir des flux juste en mouvement, in fine, ils commencent d'un point de création de valeur vers un point de consommation et que ce sont ces nœuds (plateformes) qui œuvrent pour l'optimisation de l'organisation de toute la chaîne. Un retour vers l'histoire de la logistique, ses définitions et son évolution managériale dans le temps s'avérait nécessaire pour expliciter l'approche transversale et intégrée de la chaîne logistique ; et s'attarder par la suite sur les composantes, intégration des flux physiques et d'information, sur le poids de la stratégie logistique comme arme de différenciation vis-à-vis de la concurrence et sur les leviers d'optimisation des plateformes logistiques dans ces modèles. Le dernier chapitre traitera de la compétitivité logistique au Maroc, au regard des standards précités et les axes de développement du réseau des zones logistiques comme première orientation du contrat programme logistique national. / Since earlier years, production and sales of goods and services. capital flows and systems are highly internationalized. This has led companies to optimize their supply chain to remain competitive. Morocco is part of the same trend, for its geographical position acts as a hub and crossroads of trade. The development of logistics real competitiveness is a pillar of the government program 2010-2020. Hence the launch of the national strategy for the development of logistics competitiveness, mainly the program contract governing the development of logistics platforms. The strategy aims to reduce the weight of the logistics cost of 5 points for 2015, creating 70 logistics warehouses in 17 cities on 3 300 hectares. The implementation of the logistics program requires a coherent effort, registering in time and complex trade-offs in different areas in the supply chain. In the light of these remarks, we have seen this problem a major issues requiring managerial actions, academic reflection as a focus on the basics of suppl y chain and specifically logistics platforms. The layout and connectivity of logistics platforms proves the success of a competitive sales policy of a company : we cannot just design flow, ultimately, they start a creative point value to a consumption point and that it is these nodes (platforms) working to optimize the organization of the whole chain. A return to the story of logistics was important to present it, its definitions and managerial changes over time was needed to explain the cross and integrated approach to the supply chain; and linger afterwards on the components. integration of physical and information flows. the weight of the logistics strategy as a weapon of differentiation regarding the competition and logistics platforms optimization levers in these models. The final part will present logistics competitiveness in Morocco, in view of the above standards and network development axes logistics areas as a first orientation of the national logistics program.
35

Strategie vstupu zahraničního podniku na český trh / Foreign Company's Strategy for Entering the Czech Market

Svoboda, Luděk January 2011 (has links)
The aim of this master thesis is to consider appropriate solutions of entering the foreign market. After introducing of the company follow the external and internal analysis. The thesis proves a suitability of the target market, deals with a choice of the product portfolio. It also mentions and checks the expectations of new market’s behaviour. In the final part of the thesis we can find a proper suggestions for entering the target market, steps and measures, which the monitored company shouldn’t leave out.

Page generated in 0.0812 seconds