Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"hub location problem"”.

  1. GRASP Metaheuristic for Multiple Allocation p-Hub Location Problem

    Hub Location Problems (HLPs), belonging to the field of location theory, have been area of much research over the past two decades. This is due, in large measure, to the applications of hub and spoke networks in practice. Among the most classical versions of HLPs are p-hub location problems …

    concordia Download PDF for GRASP Metaheuristic for Multiple Allocation p-Hub Location Problem (opens in a new tab)

  2. Using genetic algorithms for the single allocation hub location problem

    Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and …

    brock Repository record for Using genetic algorithms for the single allocation hub location problem (opens in a new tab)

  3. A Lagrangean Relaxation Approach for the Modular Hub Location Problem

    Hub location problems deal with the location of hub facilities and the allocation of the demand nodes to hub facilities so as to effectively route the demand between origin–destination pairs. Transportation systems such as mail, freight, passenger and even telecommunication systems most often …

    concordia Download PDF for A Lagrangean Relaxation Approach for the Modular Hub Location Problem (opens in a new tab)

  4. Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem

    Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub …

    brock Repository record for Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem (opens in a new tab)

  5. A Carbon-Conscious Closed-Loop Bi-Objective p-hub Location Problem

    … This research tackles the sustainable CLSC problem by proposing a mixed-integer linear programming (MILP) carbon-conscious textit{p}-hub location model having the objective of minimizing emissions subject to profit constraints. The model is then extended to incorporate multi-periodicity, …

    vt Repository record for A Carbon-Conscious Closed-Loop Bi-Objective p-hub Location Problem (opens in a new tab)

  6. Network design under uncertainty and demand elasticity

    … design covers a large class of fundamental problems ubiquitous in the fields of transportation and communication. These problems are modelled mathematically using directed graphs and capture the trade-off between initial investment in infrastructure and operational costs. This thesis …

    concordia Download PDF for Network design under uncertainty and demand elasticity (opens in a new tab)

  7. Modular Hub Location Problems

    Hub location problems deal with the location of a set of hub facilities and the design of the network so as to provide the most cost-effective way to route a set of commodities through the network. In this thesis we present the Modular Hub Location Problem (MHLP). The MHLP differs from classical …

    concordia Download PDF for Modular Hub Location Problems (opens in a new tab)

  8. Hub Network Design and Discrete Location: Economies of Scale, Reliability and Service Level Considerations

    In this thesis, we study three related decision problems in location theory. The first part of the dissertation presents solution algorithms for the cycle hub location problem (CHLP), which seeks to locate p-hub facilities that are connected by means of a cycle, and to assign non-hub nodes to hubs …

    concordia Download PDF for Hub Network Design and Discrete Location: Economies of Scale, Reliability and Service Level Considerations (opens in a new tab)

  9. Models and solution approaches for intermodal and less-than-truckload network design with load consolidations

    Logistics and supply chain problems arising in the context of intermodal transportation and less-than-truckload (LTL) network design typically require commodities to be consolidated and shipped via the most economical route to their destinations. Traditionally, these problems have been modelled …

    tamu Repository record for Models and solution approaches for intermodal and less-than-truckload network design with load consolidations (opens in a new tab)

  10. Location for Profit Maximization: Applications to On-Demand Warehousing and Pilotless Air Cargo Transportation

    … effectively address large-scale network design problems that prioritize profit-oriented objectives. This dissertation develops mathematical models and effective solution methodologies to optimize profitability in on-demand warehousing and pilotless air cargo transportation networks. In …

    waterloo Repository record for Location for Profit Maximization: Applications to On-Demand Warehousing and Pilotless Air Cargo Transportation (opens in a new tab)

  11. Shipment Consolidation in Hub Location Modelling

    … inventory holding decisions with the design of hub networks, where a heterogeneous fleet is used for inter-hub transportation. These problems aim to determine the optimal locations of hubs, allocate demand nodes to them, decide the quantity of inventory to be held at hubs, and assign vehicles …

    waterloo Repository record for Shipment Consolidation in Hub Location Modelling (opens in a new tab)

  12. Exact Approaches for a Class of Nonlinear Discrete Facility Location and Network Design Problems

    Many real-world problems are intrinsically mixed-integer nonlinear optimization models, which are challenging to solve due to the combinatorial complexity resulting from discrete decision variables and nonlinear functions. Mixed-integer second-order cone programming (MISOCP) is one of the promising …

    concordia Download PDF for Exact Approaches for a Class of Nonlinear Discrete Facility Location and Network Design Problems (opens in a new tab)

  13. Data-driven Structure Detection in Optimization: Decomposition, Hub Location, and Brain Connectivity

    … solve practical and large optimization problems is a recent trend that focuses on identifying patterns and structures in the problem data to help with its solution. In this thesis, we investigate this approach as an alternative to tackle real life large scale optimization problems which …

    waterloo Repository record for Data-driven Structure Detection in Optimization: Decomposition, Hub Location, and Brain Connectivity (opens in a new tab)

  14. Improving freight consolidation networks using IP-based local search

    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 …

    gatech Repository record for Improving freight consolidation networks using IP-based local search (opens in a new tab)