Browsing by Subject "Time-definite delivery"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Hierarchical multimodal hub location problem with time-definite deliveries
    (Elsevier, 2012) Alumur, S. A.; Yaman, H.; Kara, B. Y.
    Hierarchical multimodal hub location problem is a cost-minimizing hub covering problem where two types of hubs and hub links, accounting for ground and air transportation, are to be established, while ensuring time-definite deliveries. We propose a mixed-integer programming formulation and perform a comprehensive sensitivity analysis on the Turkish network. We show that the locations of airport hubs are less sensitive to the cost parameters compared to the locations of ground hubs and it is possible to improve the service quality at not much additional cost in the resulting multimodal networks. Our methodology provides the means for a detailed trade-off analysis.
  • Thumbnail Image
    ItemOpen Access
    Routing and scheduling decisions in the hierarchical hub location problem
    (Elsevier, 2014) Dükkancı, Okan; Kara, Bahar Y.
    Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and also the allocations of the demand (non-hub) nodes to these hubs. We propose a hierarchical multimodal hub network. Based on this network, we define a hub covering problem with a service time bound. The hierarchical network consists of three layers. We consider two different structures: ring-star-star (RSS) and ring-ring-star (RRS). The multimodal network has three different types of vehicles in each layer: airplanes, large trucks and small trucks. For the proposed problems (RSS and RRS), we present and strengthen two mathematical models with some variable fixing rules and valid inequalities. We conduct the computational analysis over the Turkish network and the CAB data sets.