Computers & Operations Research
|
|
- Alice Leonard
- 6 years ago
- Views:
Transcription
1 Computers & Operations Research 36 (2009) Contents lists available at ScienceDirect Computers & Operations Research journal homepage: Hub location for time definite transportation James F. Campbell College of Business Administration, University of Missouri St. Louis, One University Blvd., St. Louis, MO , USA A R T I C L E I N F O A B S T R A C T Available online 30 January 2009 Keywords: Hub location Hub median Hub arc location Time definite transportation Motor carriers Time definite motor carriers provide very reliable scheduled truck transportation service between specified terminals. They provide service competitive with airfreight carriers over continental-scale distances at a much lower cost. This paper provides time definite models for multiple allocation p-hub median problems and hub arc location problems. Service levels are imposed by limiting the maximum travel distance via the hub network for each origin destination pair. Computational results are presented to demonstrate the effects of the time definite service levels on practical network design for truck transportation in North America Elsevier Ltd. All rights reserved. 1. Introduction Over the past two decades, hub location researchers have addressed a wide range of problems motivated by air, ground and water transportation systems. Hub facilities are used in transportation networks to provide a transshipment, consolidation and break-bulk function that allows discounted transport costs via the economies of scale in transportation. Hub location problems involve locating hub facilities and discounted transportation links, allocating origin and destinations nodes (e.g., cities) to hubs, and routing flows through the network. Much research has focused on discrete hub median and related models that seek to minimize total transportation costs, along with fixed costs for hubs in some cases. Hub center problems seek to locate hubs to minimize a maximum measure related to transportation distance or cost. While hub median-type models focus on economic objectives, and hub center and covering models focus more on service level objectives, models that combine both dimensions could provide valuable insights for designing transportation hub networks. In this paper we present cost minimizing hub location models for time definite transportation, where each origin destination pair has a specified level of service that must be met. These service levels are expressed in terms of the travel distance via the hub network from the origin to the destination. This research was motivated by our work with a major North American time definite motor carrier. Time definite trucking firms offer very reliable, scheduled service between major cities, generally for freight shipments of several hundred to several thousand pounds. Tel.: ; fax: address: campbell@umsl.edu. Given business operating cycles, the delivery schedules generally conform to either overnight, second day, third day, etc. delivery, with pickup from a terminal in the early evening (e.g., 6:00 pm) and delivery to the terminal in the morning (e.g., by 8:00 or 9:00 am). The combination of higher service levels than general motor carriers, and lower cost than airfreight carriers provides a strong competitive advantage in an environment of decreasing cycle times and increasing uncertainty. The results in this paper provide insights into how time definite transportation firms can configure their networks to be both efficient (low cost) and effective (provide high levels of service). Recent reviews of hub location research by Alumur and Kara [1] and Campbell et al. [7] show the majority of research has addressed cost minimizing (e.g., hub median) models, although more attention recently has been devoted to hub center and hub covering models [14 16,27]. The classic models in hub location research have assumed that the hub nodes are fully connected by hub arcs with discounted transportation cost. These hub arcs reflect the economies of scale in transportation that provide a major incentive for hub networks. These classic hub location models have a number of attractive theoretical features, but the assumption of a fully connected set of hub arcs can lead to some unrealistic results where hub arcs may carry a much lower flow than non-hub arcs, yet the transportation cost is discounted on the hub arcs. Several authors have noted this anomaly (see [18] for a discussion) and alternative hub location models have been proposed to more properly discount transportation costs, including models with flow-dependent costs [22], flow thresholds [25] and hub arc location models [8 10]. Hub arc location models relax the assumption that all hub nodes are connected by hub arcs and seek to locate the discounted hub arcs, whose endpoints are hubs, to minimize the total transportation cost. This more /$ - see front matter 2009 Elsevier Ltd. All rights reserved. doi: /j.cor
2 3108 J.F. Campbell / Computers & Operations Research 36 (2009) general model allows the hub arcs to be used where appropriate to achieve the specified objective. Travel distances and times have been used to measure the level of service in transportation network design and location science since the introduction of covering models and the distance constrained p-median problem [29]. More recently, research has addressed service network design issues, including routing, scheduling and fleet sizing for express delivery services and time definite transportation (e.g., see [3,4,17,19]). In hub location research, O'Kelly [21] and O'Kelly and Lao [23] considered maximum distance constraints for the travel between hubs and origins/destinations in networks with a mini-hub. Other hub location research that incorporates service level constraints on path lengths includes hub covering models with a single maximum origin destination travel time (or distance) constraint [2,28], hop constrained models [24], penalty-minimizing models with tree structures [11] and p-hub center models with stochastic travel times [27]. While each of these models includes aspects of cost and service, none of them include locating hubs with the objective of minimizing transportation costs under distance-dependent service level constraints. In general, hub center and hub covering models have focused on worst-case service (based on the maximum origin destination distance or travel time), while ignoring the total cost for transportation. These models often use a discounted inter-hub travel time (analogous to the discounted travel cost in hub median models) to reflect the use of faster vehicles between hubs. However, the underlying practical motivation for many-to-many hub center and hub covering models seems less compelling than that for the one-to-many (nonhub) center and covering models, which have strong motivations from locating public sector emergency service facilities [29]. Manyto-many transportation carriers (airlines, trucking companies, etc.) are generally private sector firms for whom the cost of transport cannot be easily ignored. Thus, models that integrate both cost and service may provide better insights into practical transportation networks. In this paper we present time definite hub location models for multiple allocation p-hub median problems (HMP) and multiple allocation hub arc location problems. These models blend the costoriented hub median models that minimize the total transportation cost with level of service constraints to ensure origin destination travel times are competitive. The remainder of this paper is organized as follows. Section 2 provides background on time definite motor carriers. Section 3 presents mixed integer programming models for the time definite p-hmp and a time definite hub arc location model. Section 4 presents computational results and Section 5 is the conclusion. 2. Background Trucking is the most important mode of freight transportation in the US, and LTL (less-than-truckload) firms are the largest part of the motor carrier industry. LTL carriers consolidate many small shipments (each generally between 100 and 10,000 pounds) from many different shippers to make efficient vehicle loads. LTL carriers route shipments via a network of consolidation and break-bulk terminals. Each terminal collects shipments from its local service region. Shipments are sorted at the terminal and loaded into line-haul trucks, which carry the shipments to terminals near their destinations. The freight is then transshipped from the line-haul truck to a local delivery truck for transport to the destination. See [12,26] for details on trucking operations and [6] for a review of motor carrier network design. Time definite motor carriers are a small, but growing segment of the LTL carriers that provide very reliable scheduled service between specified terminals. These carriers compete with airfreight carriers for higher value, lower weight products that need fast, reliable transportation, but do not require the immediacy of emergency or next-flight-out service. Typical freight includes electronic and electrical equipment (especially telecommunications and high technology equipment), trade show materials, machinery and parts, and clothing and fashion accessories. Time definite trucking firms use a network of terminals to consolidate small shipments into economic truckloads, as do other more general LTL carriers. However, the lack of strict service schedules for regular LTL carriers allows them more flexibility in constructing routes. For example, a regular LTL carrier may achieve lower costs via greater consolidation by routing a shipment over a more circuitous path, or by holding shipments at a terminal until a large load is accumulated. These measures may reduce costs, but will increase the time until delivery and degrade service. In contrast, the networks for time definite trucking firms must respond to the competing pressures of better service (faster deliveries via smaller shipments, less circuitous routes and smaller delays at terminals) and lower costs (from larger shipments providing economies of scale). Thus, time definite trucking firms should locate terminals (hubs) and construct their networks to minimize cost while meeting specified service levels. 3. Models Consider a complete graph G=(V, E) with node set V ={1, 2,..., N}, where nodes correspond to origins and destinations (i.e., city terminals) and potential hub locations. Each arc (i, j) isoflengthd ij and W ij is the flow (e.g., volume of freight) to be transported from i to j. Distances are assumed to satisfy the triangle inequality. This paper provides two hub location models for time definite transportation that have the same objective of minimizing the total transportation cost. The first is based on the p-hub median model and the second is based on the first type of hub arc location model presented in [8], denoted HAL1. Both models assume each origin destination flow must be routed via at least one hub. Thus, each origin destination flow includes collection from the origin to a hub via arc (i, k) and distribution from a hub to the destination via arc (m, j). If the origin or destination is also a hub, then the collection or distribution component may be at the origin or destination node (via a degenerate arc from i to i). Paths may also include transfer between two hubs on hub arc (k, m). The cost for transportation along a hub arc is discounted by the parameter 0 α 1, presumably to capture the economies of scale from consolidated transportation. The p-hub median model locates p hubs that are fully connected by p(p 1)/2 hub arcs. As a consequence of the full connectivity of the hub arcs in the p-hub median model, each path will have at most one hub arc and at most three arcs. The hub arc location problem HAL1 locates q hub arcs with no restrictions on their locations or connectivity. In both models the nodes at the ends of each hub arc are hubs but in HAL1 every pair of hubs need not be connected by a hub arc. To maintain a similar level of service to the p-hub median model, HAL1 limits each origin destination path to at most three arcs and one central hub arc. (Other hub arc location models in [8,9] allow longer and more complex paths.) Thus, HAL1 requires that the collection and distribution components of an origin destination path occur on arcs other than hub arcs. This can lead to the use of non-discounted bridge arcs that join two hubs and may coincide with hub arcs [8,9]. Fig. 1 provides examples of some of the differences between hub median networks and HAL1 networks. Fig. 1(a) shows a 3-hub median solution with hubs at nodes 1, 3 and 4 (indicated by circles). Paths in Fig. 1(a) may involve three arcs, for example , if this provides a lower cost via the discounted hub arc than the shorter
3 J.F. Campbell / Computers & Operations Research 36 (2009) Fig. 1. (a) 3-Hub median solution; (b) solution for HAL1 with three hub arcs. path Fig. 1(b) shows a solution for HAL1 with three hub arcs and five hubs. Note that the path from nodes 1 to 6 would be , and path is not allowed since it includes two adjacent non-hub arcs. Also, note that the path is possible as long as it includes one hub arc and one bridge arc coinciding with a hub arc, since two hub arcs in a path are not allowed in HAL1. By relaxing the restriction that the hub arcs form a complete subgraph on the hub nodes, HAL1 has greater flexibility to utilize the hub arcs to produce a network with lower transportation costs (for a given number of hub arcs). Since both hub location models use three-part paths for collection, transfer and distribution (even though one or two parts may be the degenerate arc from a node to itself), we write the cost for an origin destination path as C ijkm = d ik + αd km + d mj, where (k, m) is a hub arc for the transfer component and (i, k) and (m, j) are non-hub (possibly degenerate) arcs for collection and distribution. Note that each arc in the model may correspond to travel on multiple arcs (e.g., roads) in the underlying physical transport network. Let p be the given number of hubs to locate and q be the given number of hub arcs to locate. Hub median models have been formulated with a variety of approaches [7,20] and the HAL1 model was originally formulated in a more general form by Campbell et al. [9]. The formulations below are based on the UM8 model in [20], which uses the four-subscript notation originally presented in [5]. The decision variables in the models are: X ijkm is the fraction of flow from origin i to destination j on path i k m j (in that order), Z km = 1 if there is a hub arc between nodes k and m, andy k = 1 if node k is a hub and 0 otherwise. While a very large number of paths may be feasible in the basic p-hub median and HAL1 models, a key feature of time definite models is the elimination of potential paths (and flow variables) based on the service level time restrictions. We use the set xfeas to represent the set of indices (i.e., paths) that are feasible for a particular problem. Let S be the number of service levels defined in terms of pairs of distances where dd(1,2,...,s) is the set of direct origin destination upper limit service level distances and dmax(1,2,...,s) is the set of maximum travel distances for each service level. For example, (1) if all origins and destinations within 400 miles of each other need to be served by a path of length at most 600 miles, then dd(1) = 400 and dmax(1) = 600; and (2) if all origins and destinations between 400 and 1000 miles of each other need to be served by a path of length at most 1200 miles, then dd(2)=1000 and dmax(2)=1200; etc. The set xfeas is then defined based on the direct origin destination distances d ij and the path distances d ik +d km +d mj associated with each flow variable X ijkm. In the formulations below we use the set xfeas to limit the size of the formulation by restricting sets of constraints and summations to only the feasible flow variables. The formulation for the p-hmp to minimize total transportation costs is HMP: Minimize (W ij + W ji )C ijkm X ijkm i<j,k,m xfeas Subject to X ijkm = 1 (i, j, k, m) xfeas, i < j, (1) k m Y k = p, (2) k V X ijkk + ijkm + X ijmk ) Y k (i, j, k, m) xfeas, i < j, (3) m k(x Y k {0, 1} k V, (4) X ijkm 0 (i, j, k, m) xfeas, i < j, (5) The objective is the total cost for collection, distribution and transfer. Constraint (1) ensures that each origin destination flow is sent via some hub pair (possibly a single hub as in X ijkk ). Constraint (2) requires that exactly p hubs are selected. Constraint (3) ensures that hubs are opened for all routings of flows. Constraints (4) and (5) restrict the variables appropriately. The hub arc location problem HAL1 can be formulated similarly to the HMP using the four subscript flow variables X ijkm. However, it requires additional constraints to track the use of hub arcs. As in [8,9] we assume the hub arcs are undirected to allow discounted flow in either direction. The formulation for the hub arc location problem (HAL1) to minimize total transportation costs is HAL1: Minimize (W ij + W ji )C ijkm X ijkm i<j,k,m xfeas Subject to X ijkm = 1 (i, j, k, m) xfeas, i < j, (1) k m Y k p, (2b) k V X ijkk + m k(x ijkm + X ijmk ) Y k (i, j, k, m) xfeas, i < j, (3) X ijkm Z km (i, j, k, m) xfeas, i < j, k m, (6) Z km = q, (7) k V m V m>k Y k Z mk + Z km k V, (8) m<k m>k Y k {0, 1} k V, (4) X ijkm 0 (i, j, k, m) xfeas, i < j, (5) Z km {0, 1} k, m V. (9)
4 3110 J.F. Campbell / Computers & Operations Research 36 (2009) The objective and constraints (1) and (3) are the same as for HMP. Constraint (2b) is a relaxed version of constraint (2) to allow connected hub arcs (with fewer hubs) if that reduces the cost. Constraint (6) ensures there is a hub arc established for each transfer flow. Constraint (7) requires exactly q hub arcs to be selected. Constraint (8) ensures that each hub node has an adjacent hub arc. This prevents the use of isolated hubs (hubs with no adjacent hub arc) as discussed in [8]. Without constraint (8) isolated hubs can arise when an optimal solution with q hub arcs does not use all p hubs. In this case, there is an incentive to locate additional hubs without hub arcs to reduce costs. Constraint (9) restricts the hub arc variables appropriately. 4. Results This section provides results for time definite hub network design with the HMP and HAL1 models using the CAB dataset commonly used in hub location research, along with two augmented versions of this dataset. The original CAB dataset, denoted CAB25, includes 25 US cities numbered 1 25 as shown in Fig. 2. Because this dataset reflects the concentration of population in the eastern US, an augmented dataset denoted CAB was created by adding 15 additional origins/destinations that provide a more uniform distribution of nodes and potential hub locations across an approximately rectangular service region. (Note that these new nodes do not necessarily correspond to US cities.) The locations of the 40 cities in CAB are shown in Fig. 3 and the flow W ij in and out of the 15 new cities was set at a low value of 0.2 (the flows between the first 25 cities range from to 24.0). With small flows, these 15 new cites are not attractive hubs from the standpoint of minimizing costs for originating or terminating flows, but they may be attractive from a geographical standpoint due to their intermediate locations. A third dataset, denoted CAB E, was created by using the same locations as in CAB , but setting all flows equivalent (W ij = 0.2). This dataset represents a more idealized even distribution of demand and removes the attractiveness of the larger cities in the other datasets. Because the service levels are based on those for a major time definite carrier in North America, results based on the CAB25 dataset should represent a realistic application. We provide results with two levels of inter-hub transportation discount α = 0.2 and 0.6. The small value of α reflects a strong degree of consolidation and economies of scale that corresponds to the use of much larger trucks on hub arcs than on non-hub arcs to generate the large relative cost savings. The value α = 0.6 reflects a lesser degree of consolidation and may be Fig. 2. CAB25 cities Fig. 3. CAB cities.
5 J.F. Campbell / Computers & Operations Research 36 (2009) Table 1 Service levels. Level of service dd dmax High Medium Low a more reasonable value for truck transportation where the trucks used on hub arcs may be one-and-a-half to two times larger than the trucks used on the non-hub arcs. (Note that for the Australia Post hub location dataset [13], the value of α for inter-hub transportation is between 0.25 and 0.375, relative to the value for transportation on the non-hub arcs.) We derived service levels for time definite transportation from the service schedules of a major North American time definite motor carrier. The direct (straight line) distance between all city pairs being served was calculated and compared to the published delivery service schedules of next day, second day, third day, etc. From this comparison we determined that with rare exceptions, city pairs separated by 400 miles or less received next day service; those separated by miles received second day service; and those separated by miles received third day service. City pairs with greater separation received fourth day service. The options for achieving a specified level of service with ground transportation are limited by the available time (e.g., from availability of shipments at the origin terminal at 6:00 pm to delivery at the destination terminal at 9:00 am the following day), truck speeds, and federal hours-of-service regulations that limit the number of consecutive hours that truck drivers may drive. Many of the arcs that make up each path will be short enough for a single driver to handle within the allowed time (e.g., 11 hours). Travel on longer arcs may use trucks with two drivers to increase the distance that can be covered in a given time. We leave the details of assigning drivers to a more tactical decision maker. Also, note that while air transportation can increase the level of service by extending the distances reached in a given time, this comes at a very substantial cost and the focus in this paper is on the use of truck transportation to provide a high level of service comparable to that from air transport. Hub location models that combine air and truck transport to achieve higher levels of service are an important area for future research. We consider three levels of service in this paper as shown in Table 1. These are designed for truck transportation in a region the size of the continental US where the maximum distance between cities is less than 3000 miles. The high level of service corresponds to the distance limits derived from the operations of a large North American time definite motor carrier. The medium level of service relaxes the maximum distance limits by 200 miles (about 4 hours of driving). The low level of service corresponds to no constraints on the travel distance and allows comparison with basic hub median and hub arc location models. All problems were solved to optimality using the GAMS integrated development environment with CPLEX on a 3.2 GHz Pentium processor with 1 GB RAM. Preprocessing was used to eliminate some variables by setting the flow variable X ijkm equal to zero whenever C ijmk < C ijkm, C ijmm < C ijkm or C ijkk < C ijkm. Results with the CAB25 dataset are presented in Tables 2 4 for p-hmp with up to Table 2 p-hub median problem results with CAB25 and the low service level. α p q Cost Hubs #A cpu , , 17, , 12, 17, , 7, 12, 14, , 6, 7, 12, 14, , 6, 7, 12, 14, 17, , 4, 6, 7, 12, 14, 17, , 4, 6, 7, 8, 12, 14, 17, , 4, 6, 7, 8, 12, 14, 17, 22, , , 12, , 4, 12, , 7, 12, 14, , 7, 12, 14, 17, , 7, 12, 14, 17, 20, , 7, 8, 12, 14, 17, 20, , 4, 7, 8, 12, 14, 17, 20, , 4, 6, 7, 8, 12, 14, 17, 22, hubs and in Tables 5 7 for hub arc location problems with up to five hub arcs and 10 hubs. The column #A provides the number of non-hub arcs in the solutions, and cpu time is in seconds. Each table shows how the cost, the hub network and the number of non-hub arcs change as the number of hubs and hub arcs vary. A comparison across tables demonstrates the effects of changing the level of service. Note that the higher levels of service cannot be met with small numbers of hubs and hub arcs: the medium service level requires at least five hubs and the high service level requires at least nine hubs. Table 7 for the HAL1 model provides solutions with five hub arcs and both nine and 10 hubs, where the nine hub solution necessarily involves a pair of connected hub arcs (4 18 and 14 18). Figs. 4 and 5 are plots of the direct origin destination distances versus the corresponding travel distances via the hub network for the HAL1 solution with five hub arcs, 10 hubs and α = 0.2. Fig. 4 displays results for the low service level, along with lines showing the medium and high service levels. The points above the service level lines in Fig. 4 indicate that 34 city pairs cannot meet the medium service levels and 69 city pairs cannot meet the high service levels for this instance. For example, cities 5 and 16 are 700 miles apart, but use the 1729 mile long path due to the cost savings on the hub arc Note that some of these city pairs might be able to meet the service levels via a shorter, but more expensive path using the same set of hubs. However, the large discount (α = 0.2) encourages circuitous paths to exploit the reduced cost hub arcs. Fig. 5 shows that the corresponding high service level solution results in all points clustered beneath the service level line. This is achieved by relocating six hubs and adjusting four of the five hub arcs accordingly (see Tables 5 and 7). Results with the CAB dataset are presented in Tables 8 and 9 for hub median and hub arc location problems, respectively. The SL column indicates the service level. With this larger dataset, 16 hubs are needed to meet the high service level requirements. Table 9 shows solutions with eight hub arcs (the minimum number with 16 hubs) and with 60 hub arcs (half the maximum number used in the hub median solutions in Table 8). Rather than show all 60 hub arcs in Table 9, the notation A(B) indicates that hub city A is adjacent to B hub arcs. Hub arc location problems with the low and medium service levels for α = 0.6 could not be solved due to exceeding the memory limits. Hub median results with the CAB E dataset are presented in Table 10. The hub arc location versions of these problems could not be solved due to memory limitations. In general, the results show that moving from low to high service leads to a shortening of the hub arcs and more centralization of the
6 3112 J.F. Campbell / Computers & Operations Research 36 (2009) Table 3 p-hub median problem results with CAB25 and the medium service level. α p q Cost Hubs #A cpu , 10, 12, 14, , 7, 12, 13, 14, , 6, 7, 12, 13, 14, , 6, 7, 12, 13, 14, 17, , 6, 8, 10, 12, 14, 17, 21, , 4, 6, 7, 8, 12, 14, 17, 21, , 10, 12, 14, , 7, 12, 13, 14, , 7, 12, 13, 14, 17, , 7, 12, 13, 14, 17, 20, , 4, 7, 11, 12, 14, 17, 20, , 4, 7, 8, 12, 14, 17, 20, 21, Table 4 p-hub median problem results with CAB25 and the high service level. α p q Cost Hubs #A cpu , 5, 10, 11, 13, 14, 18, 19, , 4, 6, 10, 11, 13, 14, 17 19, , 5, 10, 11, 13, 14, 18, 19, , 4, 10, 11, 13, 14, 17, 19, 20, Table 5 HAL1 results with CAB25 and the low service level. α p q Cost Hubs Hub arcs #A cpu , 4, 12, , , 12, 14, 17, 21, , 14 25, , 7, 12, 14, 17, 18, 20, , 7 22, 12 20, , 7, 12, 14, 17, 18, 20, 21, , 7 20, 12 21, 14 18, , 7, 12, 14, 17, 18, 20, 21, , 7 20, 12 21, 14 18, , 4, 12, , , 7, 12, 14, 17, , 7 20, , 6, 7, 12, 14, 17, 22, , 6 12, 7 22, , 6, 7, 12, 14, 17, 21, 22, , 6 22, 7 12, 12 21, , 6, 7, 12, 14, 17, 19, 21, 22, , 6 22, 7 19, 14 25, Table 6 HAL1 results with CAB25 and the medium service level. α p q Cost Hubs Hub arcs #A cpu , 10, 12, 14, 17, , 12 21, , 10, 12, 14, 17, 18, 20, , 10 20, 12 21, , 4, 5, 10, 11, 12, 14, 17, , 5 10, 17 22, 11 12, , 4, 5, 10, 11, 12, 14, 17, , 5 10, 17 22, 11 12, , 7, 12, 13, 14, , 7 13, , 10, 12, 14, 17, 21, 22, , 4 17, 12 21, , 4, 7, 12, 14, 17, 20, 21, , 4 17, 12 21, 14 17, , 4, 7, 12, 14, 17, 18, 20, 21, , 4 17, 12 21, 14 18, Table 7 HAL1 results with CAB25 and the high service level. α p q Cost Hubs Hub arcs #A cpu , 5, 10, 11, 13, 14, 18, 19, , 4 18, 5 22, 10 13, , 4, 5, 10, 11, 13, 14, 17, 19, , 4 17, 5 22, 10 13, , 5, 10, 11, 13, 14, 18, 19, , 5 22, 10 13, 11 19, , 5, 10, 11, 13, 14, 17, 19, 22, , 5 22, 10 13, 11 19,
7 J.F. Campbell / Computers & Operations Research 36 (2009) Fig. 4. Direct and network travel distances for the low service level HAL1 solution with CAB25 when p = 10, q = 5andα = 0.2. Fig. 5. Direct and network travel distances for the high service level HAL1 solution with CAB25 when p = 10, q = 5andα = 0.2. Table 8 p-hub median problem results with CAB for p = 16. α SL p q Cost Hubs #A cpu 0.2 L , 3, 4, 6, 7, 8, 12, 14, 15, 16, 17, 19, 21, 22, 23, M , 3, 4, 6, 7, 8, 12, 14, 15, 17, 21, 22, 25, 29, 34, H , 4, 6, 7, 8, 12, 14, 16, 18, 19, 21, 23, 30, 32, 33, L , 3, 4, 6, 7, 8, 12, 14, 15, 16, 17, 19, 21, 22, 23, M , 4, 6, 7, 8, 12, 14, 15, 17, 19, 21, 22, 23, 25, 32, H , 4, 7, 8, 12, 14, 16, 18, 19, 20, 21, 23, 30, 32, 33, hub nodes. As an example, Fig. 6 displays the HAL1 solutions for the CAB25 dataset with five hub arcs, 10 hubs and α = 0.2 for the three different levels of service. The transition from the low to the medium level of service changes three hub arcs, as does the transition from the medium to the high level of service. In each transition, the net result is a set of shorter hub arcs. This pattern of centralization of hubs is also evident for other hub arc and hub median problems for all three datasets. For example, the lower two solutions in Fig. 7 show the low and high service level solutions for the p-hub median solution with p = 16 and α = 0.2 for the CAB E dataset. Comparison of the transportation cost with different service levels shows that the increase in cost needed to improve the level of service decreases as the number of hubs and the number of hub arcs increases, and it decreases as α increases. With the CAB25 dataset, the cost increase to move from the low to the high service level ranges from 27.2% for the HMP with CAB25 when p = 5andα = 0.2
8 3114 J.F. Campbell / Computers & Operations Research 36 (2009) Table 9 HAL1 results with CAB for p = 16. α SL p q Cost Hubs Hubs arcs #A cpu 0.2 L , 4, 5, 6, 7, 8, 12, 14, 17, 21, 23, , 4 17, 4 24, 5 23, 6 8, 12 17, 12 21, M , 2, 4, 6, 7, 12, 14, 17, 21, 29, 33, 34, , 4 17, 6 36, 7 34, 12 17, 12 21, 14 17, H , 10, 11, 12, 13, 14, 15, 17, 19, 25, 29, 30, 31, 34, 35, , 10 34, 11 19, 12 25, 13 36, 14 35, 15 29, H , 4, 6, 7, 8, 12, 14, 16, 18, 19, 21, 23, 30, 32, 33, 36 1(9), 4(11),6(10), 7(11), 8(9), 12(12), 14(9), 16(6), 18(12), 19(5), 21(7), 23(7), 30(1), 32(5), 33(5), 36(1) M 16 8 Mem 0.6 H , 8, 10, 12, 13, 14, 17, 19, 21, 23, 25, 30, 32, 33, 35, , 8 13, 10 35, 12 21, 14 25, 19 36, 23 33, H , 4, 7, 8, 12, 14, 16, 18, 19, 20, 21, 23, 30, 32, 33, 36 1(9), 4(13), 7(9), 8(10), 12(11), 14(7), 16(6), 18(13), 19(6), 20(10), 21(7), 23(5), 30(1), 32(6), 33(6), 36(1) Table 10 p-hub median problem results with CAB Eforp = 16. α SL p q Cost Hubs #A cpu 0.2 L , 10, 18, 19, 21, 22, 24, 26, 27, 28, 29, 33, 34, 35, 36, M , 7, 16, 18, 19, 21, 22, 24, 26, 28, 29, 33, 34, 35, 36, H , 2, 6, 7, 12, 14, 15, 16, 19, 21, 29, 30, 31, 33, 34, L , 7, 9, 13, 19, 21, 22, 24, 26, 28, 29, 33, 34, 35, 36, M , 7, 9, 13, 19, 21, 22, 24, 26, 28, 29, 33, 34, 35, 36, H , 5, 10, 11, 12, 13, 15, 19, 24, 29, 30, 31, 34, 35, 36, to only 2.3% for HAL1 with CAB25 when p = 10, q = 5andα = 0.6. Comparison of Tables 8 and 10 shows that with equal demands, the increase in cost required to move from the low to the high service level is much less with the more uniform demand in CAB E. Note that although the costs of hub arc and hub median solutions can differ considerably (with the hub median solutions providing a lower transportation cost due to the greater number of hub arcs), some of the hubs used by the HMP and HAL1 solutions are identical or very similar. This commonality of hubs seems stronger for the CAB25 dataset than in the larger datasets. For example, each of the CAB25 HAL1 solutions with α = 0.2, p = 10 and q = 5 shown in Fig. 6 use between 6 and 8 of the same 10 hubs as in the corresponding HMP solutions (in Tables 2 4). It is also interesting that in some HAL1 problems with small α, the optimal solution does not use all the hub nodes allowed. For example, the CAB25 solutions in Tables 5 and 6 with α = 0.2, p = 10 and q=5 useonlyninehubs (notthe10possible) andthecab25+15 solutions in the first two rows of Table 9 (α = 0.2, p = 16 and q = 8) use only 12 and 13 hubs, respectively. These examples achieve the minimum cost with fewer than the maximum number of hub nodes by deploying adjacent hub arcs at nodes 4, 12 and 17. The number of non-hub allocation arcs (or spokes ), as shown by #A in Tables 2 10 generally increases with an increasing level of service as flows may be shifted from lower cost circuitous routes to more direct routes to reduce the travel distance. The length of these allocation arcs can be used to provide the cut-off times for providing freight at the origins and the delivery times at the destinations. The results also show that hubs consistently appear at certain cities or in certain geographic regions. For the CAB25 dataset, all HAL1 solutions use hubs at nearby eastern cities 17 or 18, west-coast city 12 or 22, and central city 4 (except nearby city 6 in one solution). For q 3, nearby cities 7 or 10 are always used. Similarly, all hub median solutions use cities 12, 4 (except nearby city 21 in one case), and either city 17, 18 or 2 (all along the east coast). However, there are differences in the networks, even with high service levels when the path length limits restrict the set of feasible hubs. In the larger 40 node datasets, fewer hubs are commonly used across solutions, with only cities 4, 12, and 14 appearing in all solutions for CAB25+15 (Tables 8 and 9). Fig. 7 shows the differential use of new cities as hubs from three hub median solutions in Tables 8 and 10. The circles with crosses represent hubs at new cities not in CAB25. The top solution uses no new cities as hubs, while the central solution for equal demands with CAB E has nine of the 16 hubs at new cities. Comparison of the lower two solutions in Fig. 7 show how the even distribution of hubs with the low service level is replaced by a more clustered pattern with fewer hubs at new cities under the high service level. In general, hub arc location solutions (Table 9) consistently use more new cities as hubs than hub median solutions (Table 8) and the even demand in CAB E encourages the use of new cities as hubs (46 out of 96 hubs in Table 10 are at new cities). With the CAB25+15 dataset, the large cities attract hubs and create a more clustered pattern of hubs that reflects the underlying population distribution with concentrations in the eastern US. In contrast, the solutions with CAB E provide a more uniform distribution of hubs by utilizing many of the new cities not in the original CAB25 dataset. The cpu times show that all HMP and the hub arc location problems with CAB25 were solved in very reasonable times (with the HAL1 problems solved much more quickly than in [9] due to the improved formulation). Solution times for HAL1 with the CAB dataset were over 2800 seconds in one instance, and several problems could not be solved due to memory limitations. This is not surprising with the four subscript notation (as noted in [20]) and a more compact formulation (as in [9]) may reduce the memory requirements, at the cost of increased solution times. Note though that the results presented here are the largest hub arc problems solved to date. 5. Conclusions This paper presents models for time definite hub location and network design motivated by time definite trucking in the US. The results document the impact on network design of different levels of service, and highlight the relative importance of different terminals or geographic regions in achieving high levels of service. The results allow a comparison of optimal networks for time definite hub arc location solutions and hub median solutions. The models also can help evaluate the ability of firms to improve their level of service without significant changes in their network. The results show that an increase in the service level may require modifying a given hub network by relocating hubs (and hub arcs) or by adding hubs and hub arcs. Adding hubs and hub arcs
9 J.F. Campbell / Computers & Operations Research 36 (2009) Low service level HAL1 solution CAB25+15 with Low service level Medium service level HAL1 solution CAB25+15-E with Low service level High service level HAL1 solution Fig. 6. Time definite HAL1 solutions for CAB25 with α = 0.2, p = 10, and q = 5. CAB25+15-E with High service level would increase fixed costs for the new facilities and assets, while decreasing transportation costs. The hub arc location model used in this paper (HAL1) requires that each hub be adjacent to a hub arc, but another option to meet higher levels of service would be to add isolated hubs that are not adjacent to a hub arc. Isolated hubs may improve the level of service at a more moderate cost compared to adding hub arcs (and associated hubs), and this is an area of ongoing research. Other areas for future research include consideration of other hub arc location models from [8,9] that allow more complex paths, incorporation of service level constraints in other hub location models especially models with fixed costs for hubs, and models with multiple transportation modes (e.g., air and truck). Alternate forms of the service level restrictions could also be explored to allow service levels based on a percentage or fixed amount of travel in excess of the direct distance (as might be more relevant for passenger transportation). Service levels might also be relaxed or tightened for certain origin destination pairs to reflect competitive pressures. Note though that service level constraints have the advantage of reducing problem size and thus may allow solution of more realistic problems of larger size and with more practical levels of service. Fig. 7. Time definite HMP solutions with α = 0.2 and p = 16. Acknowledgment The author thanks the reviewers and the editors for their many helpful comments and suggestions that substantially improved this paper. References [1] Alumur S, Kara BY. Network hub location problems: the state of the art. European Journal of Operational Research 2008;190:1 21. [2] Alumur S, Kara BY. A hub covering network design problem for cargo applications in Turkey. Journal of the Operational Research Society 2008; in press, doi: /jors [3] Barnhart C, Krishnan N, Kim D, Ware K. Network design for express shipment delivery. Computational Optimization and Applications 2002;21: [4] Barnhart C, Schneur R. Air network design for express shipment service. Operations Research 1996;44: [5] Campbell JF. Integer programming formulations of discrete hub location problems. European Journal of Operational Research 1994;72:
10 3116 J.F. Campbell / Computers & Operations Research 36 (2009) [6] Campbell JF. Strategic network design for motor carriers. In: Langevin A, Riopel D, editors. Logistics systems: design and optimization. New York: Springer; p [7] Campbell JF, Ernst A, Krishnamoorthy M. Hub location problems. In: Drezner Z, Hamacher H, editors. Facility location: applications and theory. Heidelberg, Germany: Springer; p [8] Campbell JF, Ernst A, Krishnamoorthy M. Hub arc location problems: Part I introduction and results. Management Science 2005;51(10): [9] Campbell JF, Ernst A, Krishnamoorthy M. Hub arc location problems: Part II formulations and optimal algorithms. Management Science 2005;51(10): [10] Campbell JF, Stiehr G, Ernst A, Krishnamoorthy M. Solving hub arc location problems on a cluster of workstations. Parallel Computing 2003;29: [11] Chen H, Campbell AM, Thomas B. Network design for time-constrained delivery. Naval Research Logistics 2008;55: [12] Delorme L, Roy J, Rousseau J-M. Motor carrier operation planning models: a state of the art. In: Bianco L, Bella AL, editors. Freight transport planning and logistics. Berlin: Springer; p [13] Ernst A, Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 1996;4: [14] Ernst A, Hamacher H, Jiang H, Krishnamoorthy M, Woegingerb G. Uncapacitated single and multiple allocation p-hub center problems. Computers & Operations Research 2009;36(7): [15] Hammacher H, Meyer T. Hub cover and hub center problems. Technical Report 98, FB Mathematik TU Kaiserslautern; [16] Kara BY, Tansel B. On the single-assignment p-hub center problem. European Journal of Operational Research 2000;125: [17] Kim D, Barnhart C, Ware K, Reinhardt G. Multimodal express package delivery: a service network design application. Transportation Science 1999;33: [18] Kimms A. Economies of scale in hub & spoke network design: we have it all wrong. In: Morlock M, Schwindt C, Trautmann N, Zimmermann J, editors. Perspectives on operations research. Weisbaden, Germany: DUV; p [19] Lin C-C, Chen S-H. The hierarchical network design problem for time definite express common carriers. Transportation Research Part B 2004;38: [20] Marin A, Canovas L, Landete M. New formulations for the uncapacitated multiple allocation hub location problem. European Journal of Operational Research 2006;172: [21] O'Kelly ME. On the allocation of a subset of nodes to a mini-hub in a package delivery network. Papers in Regional Science 1998;77: [22] O'Kelly ME, Bryan D. Hub location with flow economies of scale. Transportation Research Part B 1998;32: [23] O'Kelly ME, Lao Y. Mode choice in a hub-and-spoke network: a zero-one linear programming approach. Geographical Analysis 1991;23: [24] Pirkul J, Soni S. New formulations and solution procedures for the hop constrained network design problem. European Journal of Operational Research 2003;148: [25] Podnar H, Skorin-Kapov J, Skorin-Kapov D. Network cost minimization using threshold based discounting. European Journal of Operational Research 2002;137: [26] Roy J. Recent trends in logistics and the need for real-time decision tools in the trucking industry. CRG Working Paper , Centre de Recherche en Gestion, UQAM, Montreal, Quebec, Canada, [27] Sim T, Lowe T, Thomas B. The stochastic p-hub center problem with servicelevel constraints. Computers & Operations Research 2008; in press, doi: /j.cor [28] Tan P, Kara B. A hub covering model for cargo delivery systems. Networks 2007;49: [29] Toregas C, Swain R, ReVelle C, Bergman L. The location of emergency service facilities. Operations Research 1971;19:
Gateway Location Models
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 356 363 Gateway Location Models Mihiro
More informationUC Berkeley Working Papers
UC Berkeley Working Papers Title The Value Of Runway Time Slots For Airlines Permalink https://escholarship.org/uc/item/69t9v6qb Authors Cao, Jia-ming Kanafani, Adib Publication Date 1997-05-01 escholarship.org
More informationMathematical modeling in the airline industry: optimizing aircraft assignment for on-demand air transport
Trabalho apresentado no CNMAC, Gramado - RS, 2016. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics Mathematical modeling in the airline industry: optimizing aircraft
More informationAmerican Airlines Next Top Model
Page 1 of 12 American Airlines Next Top Model Introduction Airlines employ several distinct strategies for the boarding and deboarding of airplanes in an attempt to minimize the time each plane spends
More informationSERVICE NETWORK DESIGN: APPLICATIONS IN TRANSPORTATION AND LOGISTICS
SERVICE NETWORK DESIGN: APPLICATIONS IN TRANSPORTATION AND LOGISTICS Professor Cynthia Barnhart Massachusetts Institute of Technology Cambridge, Massachusetts USA March 21, 2007 Outline Service network
More informationImpact of Landing Fee Policy on Airlines Service Decisions, Financial Performance and Airport Congestion
Wenbin Wei Impact of Landing Fee Policy on Airlines Service Decisions, Financial Performance and Airport Congestion Wenbin Wei Department of Aviation and Technology San Jose State University One Washington
More informationABSTRACT. Subrat Mahapatra, M.S., The package delivery industry plays a dominant role in our economy by providing consistent
ABSTRACT Title: ANALYSIS OF ROUTING STRATEGIES IN AIR TRANSPORTATION NETWORKS FOR EXPRESS PACKAGE DELIVERY SERVICES Subrat Mahapatra, M.S., 2005 Directed By: Professor Ali Haghani, Department of Civil
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 16 Transportation Timetabling 1. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling Marco Chiarandini DM87 Scheduling,
More informationAirport Monopoly and Regulation: Practice and Reform in China Jianwei Huang1, a
2nd International Conference on Economics, Management Engineering and Education Technology (ICEMEET 2016) Airport Monopoly and Regulation: Practice and Reform in China Jianwei Huang1, a 1 Shanghai University
More informationAirline Schedule Development Overview Dr. Peter Belobaba
Airline Schedule Development Overview Dr. Peter Belobaba Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning Module 18 : 1 April 2016
More informationPRAJWAL KHADGI Department of Industrial and Systems Engineering Northern Illinois University DeKalb, Illinois, USA
SIMULATION ANALYSIS OF PASSENGER CHECK IN AND BAGGAGE SCREENING AREA AT CHICAGO-ROCKFORD INTERNATIONAL AIRPORT PRAJWAL KHADGI Department of Industrial and Systems Engineering Northern Illinois University
More informationAppendix B Ultimate Airport Capacity and Delay Simulation Modeling Analysis
Appendix B ULTIMATE AIRPORT CAPACITY & DELAY SIMULATION MODELING ANALYSIS B TABLE OF CONTENTS EXHIBITS TABLES B.1 Introduction... 1 B.2 Simulation Modeling Assumption and Methodology... 4 B.2.1 Runway
More informationApplying Integer Linear Programming to the Fleet Assignment Problem
Applying Integer Linear Programming to the Fleet Assignment Problem ABARA American Airlines Decision Ti'chnohi^ics PO Box 619616 Dallasll'ort Worth Airport, Texas 75261-9616 We formulated and solved the
More information1-Hub or 2-Hub networks?
1-Hub or 2-Hub networks? A Theoretical Analysis of the Optimality of Airline Network Structure Department of Economics, UC Irvine Xiyan(Jamie) Wang 02/11/2015 Introduction The Hub-and-spoke (HS) network
More informationONLINE DELAY MANAGEMENT IN RAILWAYS - SIMULATION OF A TRAIN TIMETABLE
ONLINE DELAY MANAGEMENT IN RAILWAYS - SIMULATION OF A TRAIN TIMETABLE WITH DECISION RULES - N. VAN MEERTEN 333485 28-08-2013 Econometrics & Operational Research Erasmus University Rotterdam Bachelor thesis
More informationIncluding Linear Holding in Air Traffic Flow Management for Flexible Delay Handling
Including Linear Holding in Air Traffic Flow Management for Flexible Delay Handling Yan Xu and Xavier Prats Technical University of Catalonia (UPC) Outline Motivation & Background Trajectory optimization
More informationA RECURSION EVENT-DRIVEN MODEL TO SOLVE THE SINGLE AIRPORT GROUND-HOLDING PROBLEM
RECURSION EVENT-DRIVEN MODEL TO SOLVE THE SINGLE IRPORT GROUND-HOLDING PROBLEM Lili WNG Doctor ir Traffic Management College Civil viation University of China 00 Xunhai Road, Dongli District, Tianjin P.R.
More informationRE: PROPOSED MAXIMUM LEVELS OF AIRPORT CHARGES DRAFT DETERMINATION /COMMISSION PAPER CP6/2001
RE: PROPOSED MAXIMUM LEVELS OF AIRPORT CHARGES DRAFT DETERMINATION /COMMISSION PAPER CP6/2001 ------------------------------------------------------------------------------------------------------- Bord
More informationA Review of Airport Runway Scheduling
1 A Review of Airport Runway Scheduling Julia Bennell School of Management, University of Southampton Chris Potts School of Mathematics, University of Southampton This work was supported by EUROCONTROL,
More informationAirline Scheduling: An Overview
Airline Scheduling: An Overview Crew Scheduling Time-shared Jet Scheduling (Case Study) Airline Scheduling: An Overview Flight Schedule Development Fleet Assignment Crew Scheduling Daily Problem Weekly
More informationPREFACE. Service frequency; Hours of service; Service coverage; Passenger loading; Reliability, and Transit vs. auto travel time.
PREFACE The Florida Department of Transportation (FDOT) has embarked upon a statewide evaluation of transit system performance. The outcome of this evaluation is a benchmark of transit performance that
More informationHOW TO IMPROVE HIGH-FREQUENCY BUS SERVICE RELIABILITY THROUGH SCHEDULING
HOW TO IMPROVE HIGH-FREQUENCY BUS SERVICE RELIABILITY THROUGH SCHEDULING Ms. Grace Fattouche Abstract This paper outlines a scheduling process for improving high-frequency bus service reliability based
More informationEfficiency and Automation
Efficiency and Automation Towards higher levels of automation in Air Traffic Management HALA! Summer School Cursos de Verano Politécnica de Madrid La Granja, July 2011 Guest Lecturer: Rosa Arnaldo Universidad
More informationAbstract. Introduction
COMPARISON OF EFFICIENCY OF SLOT ALLOCATION BY CONGESTION PRICING AND RATION BY SCHEDULE Saba Neyshaboury,Vivek Kumar, Lance Sherry, Karla Hoffman Center for Air Transportation Systems Research (CATSR)
More informationTime Benefits of Free-Flight for a Commercial Aircraft
Time Benefits of Free-Flight for a Commercial Aircraft James A. McDonald and Yiyuan Zhao University of Minnesota, Minneapolis, Minnesota 55455 Introduction The nationwide increase in air traffic has severely
More informationAirline Scheduling Optimization ( Chapter 7 I)
Airline Scheduling Optimization ( Chapter 7 I) Vivek Kumar (Research Associate, CATSR/GMU) February 28 th, 2011 CENTER FOR AIR TRANSPORTATION SYSTEMS RESEARCH 2 Agenda Airline Scheduling Factors affecting
More informationRunway Length Analysis Prescott Municipal Airport
APPENDIX 2 Runway Length Analysis Prescott Municipal Airport May 11, 2009 Version 2 (draft) Table of Contents Introduction... 1-1 Section 1 Purpose & Need... 1-2 Section 2 Design Standards...1-3 Section
More informationTransit Vehicle Scheduling: Problem Description
Transit Vehicle Scheduling: Problem Description Outline Problem Characteristics Service Planning Hierarchy (revisited) Vehicle Scheduling /24/03.224J/ESD.204J Problem Characteristics Consolidated Operations
More informationA Hub Covering Model for Cargo Delivery Systems
A Hub Covering Model for Cargo Delivery Systems Pinar Z. Tan and Bahar Y. Kara Department of Industrial Engineering, Bilkent University, Ankara, Turkey The hub location problem appears in a variety of
More informationEvaluation of Alternative Aircraft Types Dr. Peter Belobaba
Evaluation of Alternative Aircraft Types Dr. Peter Belobaba Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning Module 5: 10 March 2014
More informationAutomatic Aircraft Cargo Load Planning with Pick-up and Delivery
Automatic Aircraft Cargo Load Planning with Pick-up and Delivery V. Lurkin and M. Schyns University of Liège QuantOM 14ème conférence ROADEF Société Française de Recherche Opérationnelle et Aide à la Décision
More informationScienceDirect. Prediction of Commercial Aircraft Price using the COC & Aircraft Design Factors
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 67 ( 2013 ) 70 77 7th Asian-Pacific Conference on Aerospace Technology and Science, 7th APCATS 2013 Prediction of Commercial
More informationAircraft Arrival Sequencing: Creating order from disorder
Aircraft Arrival Sequencing: Creating order from disorder Sponsor Dr. John Shortle Assistant Professor SEOR Dept, GMU Mentor Dr. Lance Sherry Executive Director CATSR, GMU Group members Vivek Kumar David
More informationFORT LAUDERDALE-HOLLYWOOD INTERNATIONAL AIRPORT ENVIRONMENTAL IMPACT STATEMENT DRAFT
D.3 RUNWAY LENGTH ANALYSIS Appendix D Purpose and Need THIS PAGE INTENTIONALLY LEFT BLANK Appendix D Purpose and Need APPENDIX D.3 AIRFIELD GEOMETRIC REQUIREMENTS This information provided in this appendix
More informationIntegrated Optimization of Arrival, Departure, and Surface Operations
Integrated Optimization of Arrival, Departure, and Surface Operations Ji MA, Daniel DELAHAYE, Mohammed SBIHI ENAC École Nationale de l Aviation Civile, Toulouse, France Paolo SCALA Amsterdam University
More informationSchedule Compression by Fair Allocation Methods
Schedule Compression by Fair Allocation Methods by Michael Ball Andrew Churchill David Lovell University of Maryland and NEXTOR, the National Center of Excellence for Aviation Operations Research November
More informationA Study of Tradeoffs in Airport Coordinated Surface Operations
A Study of Tradeoffs in Airport Coordinated Surface Operations Ji MA, Daniel DELAHAYE, Mohammed SBIHI ENAC École Nationale de l Aviation Civile, Toulouse, France Paolo SCALA, Miguel MUJICA MOTA Amsterdam
More informationComments on Notice of Proposed Amendment to Policy Statement U.S. Department of Transportation, Federal Aviation Administration
Comments on Notice of Proposed Amendment to Policy Statement U.S. Department of Transportation, Federal Aviation Administration POLICY REGARDING AIRPORT RATES AND CHARGES Docket No. FAA-2008-0036, January
More informationReducing Garbage-In for Discrete Choice Model Estimation
Reducing Garbage-In for Discrete Choice Model Estimation David Kurth* Cambridge Systematics, Inc. 999 18th Street, Suite 3000 Denver, CO 80202 P: 303-357-4661 F: 303-446-9111 dkurth@camsys.com Marty Milkovits
More informationThe Benefits of Attendee Travel Management
The Benefits of Attendee Travel Management Travel to and from a meeting or an event is very much part of each attendee s event experience. Meeting planners and attendees alike can benefit from inclusion
More informationATM Network Performance Report
ATM Network Performance Report 2019 Page 1 of 20 Table of contents Summary... 3 Network Wide Performance... 4 Airborne delay... 4 Sydney... 7 Airborne delay... 7 Notable events... 7 CTOT (Calculated take
More informationCHAPTER 5 SIMULATION MODEL TO DETERMINE FREQUENCY OF A SINGLE BUS ROUTE WITH SINGLE AND MULTIPLE HEADWAYS
91 CHAPTER 5 SIMULATION MODEL TO DETERMINE FREQUENCY OF A SINGLE BUS ROUTE WITH SINGLE AND MULTIPLE HEADWAYS 5.1 INTRODUCTION In chapter 4, from the evaluation of routes and the sensitive analysis, it
More informationBest schedule to utilize the Big Long River
page 1of20 1 Introduction Best schedule to utilize the Big Long River People enjoy going to the Big Long River for its scenic views and exciting white water rapids, and the only way to achieve this should
More informationPredicting Flight Delays Using Data Mining Techniques
Todd Keech CSC 600 Project Report Background Predicting Flight Delays Using Data Mining Techniques According to the FAA, air carriers operating in the US in 2012 carried 837.2 million passengers and the
More informationDepeaking Optimization of Air Traffic Systems
Depeaking Optimization of Air Traffic Systems B.Stolz, T. Hanschke Technische Universität Clausthal, Institut für Mathematik, Erzstr. 1, 38678 Clausthal-Zellerfeld M. Frank, M. Mederer Deutsche Lufthansa
More informationA Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network
A Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network Klaus Wehmuth, Bernardo B. A. Costa, João Victor M. Bechara, Artur Ziviani 1 National Laboratory for Scientific
More informationDe-peaking Lufthansa Hub Operations at Frankfurt Airport
Advances in Simulation for Production and Logistics Applications Markus Rabe (ed.) Stuttgart, Fraunhofer IRB Verlag 2008 De-peaking Lufthansa Hub Operations at Frankfurt Airport De-peaking des Lufthansa-Hub-Betriebs
More informationCHAPTER 3: HUBBING THEORY
CHAPTER 3: HUBBING THEORY 3.1 Introduction Button et al. (2002) state that in order to minimise costs and keep airfares down, airlines need to keep aircraft in the air for the longest possible time to
More informationOptimization Model Integrated Flight Schedule and Maintenance Plans
Optimization Model Integrated Flight Schedule and Maintenance Plans 1 Shao Zhifang, 2 Sun Lu, 3 Li Fujuan *1 School of Information Management and Engineering, Shanghai University of Finance and Economics,
More informationHistorical Statistics
Historical Statistics FedEx Corporation Financial and Operating Statistics FY 2005 FY 2014 This report is a statistical supplement to FedEx s interim financial reports and is prepared quarterly. Additional
More informationTactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation Gizem Keysan, George L. Nemhauser, and Martin W.P. Savelsbergh February 13, 2009 Abstract Advances
More informationCombining Control by CTA and Dynamic En Route Speed Adjustment to Improve Ground Delay Program Performance
Combining Control by CTA and Dynamic En Route Speed Adjustment to Improve Ground Delay Program Performance James C. Jones, University of Maryland David J. Lovell, University of Maryland Michael O. Ball,
More informationSAMTRANS TITLE VI STANDARDS AND POLICIES
SAMTRANS TITLE VI STANDARDS AND POLICIES Adopted March 13, 2013 Federal Title VI requirements of the Civil Rights Act of 1964 were recently updated by the Federal Transit Administration (FTA) and now require
More informationDo Not Write Below Question Maximum Possible Points Score Total Points = 100
University of Toronto Department of Economics ECO 204 Summer 2012 Ajaz Hussain TEST 3 SOLUTIONS TIME: 1 HOUR AND 50 MINUTES YOU CANNOT LEAVE THE EXAM ROOM DURING THE LAST 10 MINUTES OF THE TEST. PLEASE
More informationChapter 1 EXECUTIVE SUMMARY
Chapter 1 EXECUTIVE SUMMARY Contents Page Aviation Growth Scenarios................................................ 3 Airport Capacity Alternatives.............................................. 4 Air Traffic
More informationAnalysis of Operational Impacts of Continuous Descent Arrivals (CDA) using runwaysimulator
Analysis of Operational Impacts of Continuous Descent Arrivals (CDA) using runwaysimulator Camille Shiotsuki Dr. Gene C. Lin Ed Hahn December 5, 2007 Outline Background Objective and Scope Study Approach
More informationResponse to the London Heathrow Airport Expansion Public Consultation
Response to the London Heathrow Airport Expansion Public Consultation Summary This report sets out the response to the Heathrow Airport s consultation on airport expansion and airspace change. The consultation
More informationProof of Concept Study for a National Database of Air Passenger Survey Data
NATIONAL CENTER OF EXCELLENCE FOR AVIATION OPERATIONS RESEARCH University of California at Berkeley Development of a National Database of Air Passenger Survey Data Research Report Proof of Concept Study
More informationQUALITY OF SERVICE INDEX Advanced
QUALITY OF SERVICE INDEX Advanced Presented by: D. Austin Horowitz ICF SH&E Technical Specialist 2014 Air Service Data Seminar January 26-28, 2014 0 Workshop Agenda Introduction QSI/CSI Overview QSI Uses
More informationPrice-Setting Auctions for Airport Slot Allocation: a Multi-Airport Case Study
Price-Setting Auctions for Airport Slot Allocation: a Multi-Airport Case Study An Agent-Based Computational Economics Approach to Strategic Slot Allocation SESAR Innovation Days Bologna, 2 nd December
More informationCENTRAL OREGON REGIONAL TRANSIT MASTER PLAN
Central Oregon Regional Transit Master Plan Volume II: Surveys and Market Research CENTRAL OREGON REGIONAL TRANSIT MASTER PLAN Volume IV: Service Plan Appendices A-B July 213 Nelson\Nygaard Consulting
More informationCompustat. Data Navigator. White Paper: Airline Industry-Specifi c
Compustat Data Navigator White Paper: Airline Industry-Specifi c April 2008 Data Navigator: Airline Industry-Specific Data There are several metrics essential to airline analysis that are unavailable on
More informationEstimating the Risk of a New Launch Vehicle Using Historical Design Element Data
International Journal of Performability Engineering, Vol. 9, No. 6, November 2013, pp. 599-608. RAMS Consultants Printed in India Estimating the Risk of a New Launch Vehicle Using Historical Design Element
More informationDraft Concept Alternatives Analysis for the Inaugural Airport Program September 2005
Draft Concept Alternatives Analysis for the Inaugural Airport Program September 2005 Section 3 - Refinement of the Ultimate Airfield Concept Using the Base Concept identified in Section 2, IDOT re-examined
More informationGreater Orlando Aviation Authority Orlando International Airport One Jeff Fuqua Boulevard Orlando, Florida Memorandum TO: FROM:
Greater Orlando Aviation Authority One Jeff Fuqua Boulevard Orlando, Florida 32827-4399 Memorandum TO: FROM: Participating Airlines Phil Brown, Executive Director DATE: SUBJECT: Rate Methodology for FY
More informationHEATHROW COMMUNITY NOISE FORUM
HEATHROW COMMUNITY NOISE FORUM 3Villages flight path analysis report January 216 1 Contents 1. Executive summary 2. Introduction 3. Evolution of traffic from 25 to 215 4. Easterly departures 5. Westerly
More informationPerformance and Efficiency Evaluation of Airports. The Balance Between DEA and MCDA Tools. J.Braz, E.Baltazar, J.Jardim, J.Silva, M.
Performance and Efficiency Evaluation of Airports. The Balance Between DEA and MCDA Tools. J.Braz, E.Baltazar, J.Jardim, J.Silva, M.Vaz Airdev 2012 Conference Lisbon, 19th-20th April 2012 1 Introduction
More informationNOVEMBER YEAR III LATIN AMERICA&CARIBBEAN MID-MARKETS: OPPORTUNITIES IN THE REGION
NOVEMBER 2011 - YEAR III MARKETWATCH LATIN AMERICA&CARIBBEAN MID-MARKETS: OPPORTUNITIES IN THE REGION THE REGION IN PERSPECTIVE LAC in Perspective - 2011 Facts % of the world 595 mi people 9,3 $ 5,8 tri
More informationFUTURE PASSENGER PROCESSING. ACRP New Concepts for Airport Terminal Landside Facilities
FUTURE PASSENGER PROCESSING ACRP 07-01 New Concepts for Airport Terminal Landside Facilities In association with: Ricondo & Associates, TransSolutions, TranSecure RESEARCH Background Research Objective
More informationAccording to FAA Advisory Circular 150/5060-5, Airport Capacity and Delay, the elements that affect airfield capacity include:
4.1 INTRODUCTION The previous chapters have described the existing facilities and provided planning guidelines as well as a forecast of demand for aviation activity at North Perry Airport. The demand/capacity
More informationScenarios for Fleet Assignment: A Case Study at Lion Air
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X Volume 10, Issue 5 Ver I (Sep-Oct 2014), PP 64-68 wwwiosrjournalsorg Scenarios for Fleet Assignment: A Case Study at Lion Air
More informationAIR TRANSPORT MANAGEMENT Universidade Lusofona January 2008
AIR TRANSPORT MANAGEMENT Universidade Lusofona Introduction to airline network planning: John Strickland, Director JLS Consulting Contents 1. What kind of airlines? 2. Network Planning Data Generic / traditional
More informationQUALITY OF SERVICE INDEX
QUALITY OF SERVICE INDEX Advanced Presented by: David Dague SH&E, Prinicpal Airports Council International 2010 Air Service & Data Planning Seminar January 26, 2010 Workshop Agenda Introduction QSI/CSI
More informationActivity Template. Drexel-SDP GK-12 ACTIVITY. Subject Area(s): Sound Associated Unit: Associated Lesson: None
Activity Template Subject Area(s): Sound Associated Unit: Associated Lesson: None Drexel-SDP GK-12 ACTIVITY Activity Title: What is the quickest way to my destination? Grade Level: 8 (7-9) Activity Dependency:
More informationFLIGHT SCHEDULE PUNCTUALITY CONTROL AND MANAGEMENT: A STOCHASTIC APPROACH
Transportation Planning and Technology, August 2003 Vol. 26, No. 4, pp. 313 330 FLIGHT SCHEDULE PUNCTUALITY CONTROL AND MANAGEMENT: A STOCHASTIC APPROACH CHENG-LUNG WU a and ROBERT E. CAVES b a Department
More informationA Simulation Approach to Airline Cost Benefit Analysis
Department of Management, Marketing & Operations - Daytona Beach College of Business 4-2013 A Simulation Approach to Airline Cost Benefit Analysis Massoud Bazargan, bazargam@erau.edu David Lange Luyen
More informationDecreasing Airline Delay Propagation By Re-Allocating Scheduled Slack
Decreasing Airline Delay Propagation By Re-Allocating Scheduled Slack Shervin AhmadBeygi, Amy Cohn and Marcial Lapp University of Michigan BE COME A S LOAN AFFILIATE http://www.sloan.org/programs/affiliates.shtml
More informationOverview of the Airline Planning Process Dr. Peter Belobaba Presented by Alex Heiter
Overview of the Airline Planning Process Dr. Peter Belobaba Presented by Alex Heiter Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning
More informationSimulation of disturbances and modelling of expected train passenger delays
Computers in Railways X 521 Simulation of disturbances and modelling of expected train passenger delays A. Landex & O. A. Nielsen Centre for Traffic and Transport, Technical University of Denmark, Denmark
More informationRECEDING HORIZON CONTROL FOR AIRPORT CAPACITY MANAGEMENT
RECEDING HORIZON CONTROL FOR AIRPORT CAPACITY MANAGEMENT W.-H. Chen, X.B. Hu Dept. of Aeronautical & Automotive Engineering, Loughborough University, UK Keywords: Receding Horizon Control, Air Traffic
More informationIMPROVING THE ROBUSTNESS OF FLIGHT SCHEDULE BY FLIGHT RE-TIMING AND IMPOSING A NEW CREW BASE
Jurnal Karya Asli Lorekan Ahli Matematik Vol. 6 No.1 (2013) Page 066-073. Jurnal Karya Asli Lorekan Ahli Matematik IMPROVING THE ROBUSTNESS OF FLIGHT SCHEDULE BY FLIGHT RE-TIMING AND IMPOSING A NEW CREW
More information15:00 minutes of the scheduled arrival time. As a leader in aviation and air travel data insights, we are uniquely positioned to provide an
FlightGlobal, incorporating FlightStats, On-time Performance Service Awards: A Long-time Partner Recognizing Industry Success ON-TIME PERFORMANCE 2018 WINNER SERVICE AWARDS As a leader in aviation and
More informationAIR CANADA REPORTS 2010 THIRD QUARTER RESULTS; Operating Income improved $259 million or 381 per cent from previous year s quarter
AIR CANADA REPORTS 2010 THIRD QUARTER RESULTS; Operating Income improved $259 million or 381 per cent from previous year s quarter MONTRÉAL, November 4, 2010 Air Canada today reported operating income
More informationHeuristic technique for tour package models
Proceedings of the 214 International Conference on Information, Operations Management and Statistics (ICIOMS213), Kuala Lumpur, Malaysia, September 1-3, 213 Heuristic technique for tour package models
More informationApplication of Graph Theory in Transportation Networks
International Journal of Scientific Research and Management (IJSRM) Volume 5 Issue 07 Pages 6197-6201 2017 Website: www.ijsrm.in ISSN (e): 2321-3418 Index Copernicus value (2015): 57.47 DOI: 10.18535/ijsrm/v5i7.48
More informationINNOVATIVE TECHNIQUES USED IN TRAFFIC IMPACT ASSESSMENTS OF DEVELOPMENTS IN CONGESTED NETWORKS
INNOVATIVE TECHNIQUES USED IN TRAFFIC IMPACT ASSESSMENTS OF DEVELOPMENTS IN CONGESTED NETWORKS Andre Frieslaar Pr.Eng and John Jones Pr.Eng Abstract Hawkins Hawkins and Osborn (South) Pty Ltd 14 Bree Street,
More informationWe consider the airline fleet assignment problem involving the profit maximizing assignment
Itinerary-Based Airline Fleet Assignment Cynthia Barnhart Timothy S. Kniker Manoj Lohatepanont Center for Transportation and Logistics Studies, Massachusetts Institute of Technology, Cambridge, Massachusetts
More informationMEASURING ACCESSIBILITY TO PASSENGER FLIGHTS IN EUROPE: TOWARDS HARMONISED INDICATORS AT THE REGIONAL LEVEL. Regional Focus.
Regional Focus A series of short papers on regional research and indicators produced by the Directorate-General for Regional and Urban Policy 01/2013 SEPTEMBER 2013 MEASURING ACCESSIBILITY TO PASSENGER
More information1. Introduction. 2.2 Surface Movement Radar Data. 2.3 Determining Spot from Radar Data. 2. Data Sources and Processing. 2.1 SMAP and ODAP Data
1. Introduction The Electronic Navigation Research Institute (ENRI) is analysing surface movements at Tokyo International (Haneda) airport to create a simulation model that will be used to explore ways
More informationMAXIMUM LEVELS OF AVIATION TERMINAL SERVICE CHARGES that may be imposed by the Irish Aviation Authority ISSUE PAPER CP3/2010 COMMENTS OF AER LINGUS
MAXIMUM LEVELS OF AVIATION TERMINAL SERVICE CHARGES that may be imposed by the Irish Aviation Authority ISSUE PAPER CP3/2010 COMMENTS OF AER LINGUS 1. Introduction A safe, reliable and efficient terminal
More informationAn Assessment on the Cost Structure of the UK Airport Industry: Ownership Outcomes and Long Run Cost Economies
An Assessment on the Cost Structure of the UK Airport Industry: Ownership Outcomes and Long Run Cost Economies Anna Bottasso & Maurizio Conti Università di Genova Milano- IEFE-Bocconi 19 March 2010 Plan
More informationTransportation Safety and the Allocation of Safety Improvements
Transportation Safety and the Allocation of Safety Improvements Garrett Waycaster 1, Raphael T. Haftka 2, Nam H, Kim 3, and Volodymyr Bilotkach 4 University of Florida, Gainesville, FL, 32611 and Newcastle
More informationStrategic airspace capacity planning in a network under demand uncertainty (COCTA project results)
Strategic airspace capacity planning in a network under demand uncertainty (COCTA project results) Prof. Dr. Frank Fichert Worms University of Applied Sciences Joint work with: University of Belgrade (Dr
More informationImplementing an Air Taxi System
Departamento de Ingeniería Industrial, FCFM, Universidad de Chile, Chile August 11, 2006 Outline 1 Introduction 2 The Routing Problems 3 Final Comments Work Team Work Team Mo Bazaraa (Georgia Institute
More informationSTRC. STRC 8 th Swiss Transport Research Conference. Analysis of Depeaking Effects for Zurich Airport s Ground Handler
Analysis of Depeaking Effects for Zurich Airport s Ground Handler Beat Kisseleff, Emch + Berger AG Zürich Marco Lüthi, ETH Zürich Conference paper STRC 2008 STRC STRC 8 th Swiss Transport Research Conference
More informationOptimized Schedules for Airline Routes
Optimized Schedules for Airline Routes Sze-Wei Chang 1 and Paul Schonfeld, F.ASCE Abstract: Increasing flight frequency on airline routes tends to reduce user delay costs but increase airline operating
More informationWeekly airline fleet assignment with homogeneity
Transportation Research Part B 40 (2006) 306 318 www.elsevier.com/locate/trb Weekly airline fleet assignment with homogeneity Nicolas Bélanger a, Guy Desaulniers a, François Soumis a, Jacques Desrosiers
More informationAir Connectivity and Competition
Air Connectivity and Competition Sainarayan A Chief, Aviation Data and Analysis Section, ATB Concept of Connectivity in Air Transport Movement of passengers, mail and cargo involving the minimum of transit
More informationOverview of Boeing Planning Tools Alex Heiter
Overview of Boeing Planning Tools Alex Heiter Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning Module 16: 31 March 2016 Lecture Outline
More informationDaily Estimation of Passenger Flow in Large and Complicated Urban Railway Network. Shuichi Myojo. Railway Technical Research Institute, Tokyo, Japan
Daily Estimation of Passenger Flow in Large and Complicated Urban Railway Network Shuichi Myojo Abstract Railway Technical Research Institute, Tokyo, Japan Railway passenger flow data including the on-board
More information