Search NASA⌕ Search

SEARCH · Search NASA

Results for “ROUTING”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗
DOE OSTI2017

Navigation API Route Fuel Saving Opportunity Assessment on Large-Scale Real-World Travel Data for Conventional Vehicles and Hybrid Electric Vehicles: Preprint

The green routing strategy instructing a vehicle to select a fuel-efficient route benefits the current transportation system with fuel-saving opportunities. This paper introduces a navigation API route fuel-saving evaluation framework for estimating fuel advantages of alternative API routes based on large-scale, real-world travel data for conventional vehicles (CVs) and hybrid electric vehicles (HEVs). The navigation APIs, such Google Directions API, integrate traffic conditions and provide feasible alternative routes for origin-destination pairs. This paper develops two link-based fuel-consumption models stratified by link-level speed, road grade, and functional class (local/non-local), one for CVs and the other for HEVs. The link-based fuel-consumption models are built by assigning travel from a large number of GPS driving traces to the links in TomTom MultiNet as the underlying road network layer and road grade data from a U.S. Geological Survey elevation data set. Fuel consumption on a link is calculated by the proposed fuel consumption model. This paper envisions two kinds of applications: 1) identifying alternate routes that save fuel, and 2) quantifying the potential fuel savings for large amounts of travel. An experiment based on a large-scale California Household Travel Survey GPS trajectory data set is conducted. The fuel consumption and savings of CVs and HEVs are investigated. At the same time, the trade-off between fuel saving and time saving for choosing different routes is also examined for both powertrains.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2014

Deployment of feasible routes to renewable jet-fuel with an emphasis on the Norwegian landscape.

Techno-economic performances of Norwegian biojet fuel production via the Alcoholto- Jet and Fischer-Tropsch synthetic paraffinic kerosene routes were estimated based on adaptations of available literature data to Norwegian conditions. This paper reviews the deployment of feasible routes to sustainable jet fuel production for the short-to-medium term timeframe (2020-2025), with an emphasis on the Norwegian landscape. Given the fact that there are serious concerns regarding the availability and the sustainability of large-scale biofuels production both from oil seed plants and carbohydrates (sugars and starches) as well as the unsuitability of the Norwegian climate for oil seed or sugar/starch plant cultivation, only biojet fuels produced from lignocellulosic resources are considered. The short-to-medium term implies certified or near certified fuels. The most promising and feasible alternatives for Norwegian biojet fuel production are hence limited to FT-SPK and ATJ. The results suggest that, from a techno-economic point of view, production of jet fuel via the gasification-FT route is more favorable than the alcohol to jet fuel route. This is attributed to the inclusion of the alcohol production step. Feedstock price is the main operating cost for both of the routes. The current cost of production of jet fuel under Norwegian conditions for gasification FT route is estimated between 43 USD/GJ and 47.4 USD/GJ, and for the ATJ route, between 54 USD/GJ and 60 USD/GJ.

09 BIOMASS FUELS↗
DOE OSTI2023

Progress in the Verification and Validation Efforts for START: A Spent Fuel Routing Tool

The U.S. Department of Energy’s (DOE) Office of Nuclear Energy (DOE-NE) is planning for an integrated waste management approach to transport, store, and dispose of spent nuclear fuel (SNF) and other high-level radioactive waste (HLW) as part of the Integrated Waste Management (IWM) program [1]. In support of this effort, the Stakeholder Tool for Assessing Radioactive Transportation (START) is being developed within the IWM program [2, 3]. This is a web-based decision support tool that can be used to analyze geospatial data related to the transportation of SNF and HLW. START is designed as a web-based application using an ArcGIS server through which the user can select the origin and destination of the route [4]. This is followed by selection of the mode of transportation of choice based on user preference. Some of the modes available to the user include rail, heavy haul truck, and barge. The option of utilizing more than one mode of transportation (intermodal transportation) is also implemented in START. A few examples of intermodal transportation include barge to rail, and heavy haul truck to rail. It must be noted that some routes might not have access to all modes of transportation, depending on the infrastructure availability at the origin and destination sites. Users can also select any stops or barriers they would like to introduce in the routes. This is followed by selection of the routing criteria of interest. Three primary routing options available to the user include minimum population, minimum distance, and minimum time. Apart from that, a few other options include accounting for a weighted average of the three aforementioned routing options. The next step involves the selection of the buffer distance of interest which includes the two choices available of 800 m and 2500 m, respectively. Finally, an option to select any prohibited rail carriers that the user does not wish to use is available. After making these selections, a route is ready to be created.

Gadey, Harish Reddy↗
DOE OSTI2025

Secure Route: Roadway Risk Mapping for Transportation Planners

The secure transport of sensitive materials across U.S. road networks pose unique challenges for local, state, and federal agencies. Threats range from random events (e.g., accidents, medical emergencies, mechanical failures) to opportunistic or organized tactical assaults. Although the probability of such attacks is very low, the consequences of material loss to foreign states or terrorists can be catastrophic, qualifying these scenarios as “grey swan” events—low-probability, high-impact occurrences that are predictable but difficult to quantify. Traditional risk assessments struggle in these contexts, necessitating a shift toward subjective risk perception to inform planning. Risk perception in transport planning is shaped by various factors, including knowledge of adversarial capabilities, vehicle defenses, manifest details, and geographic features along the route. Geographic features such as bridges, tunnels, roadside elevation, and gaps in cellular coverage introduce vulnerabilities, while mitigative features include safe havens, police stations, and medical services. Temporal variables such as congestion, accidents, and weather further complicate route planning. Despite their importance, existing routing tools like Google Maps and commercial software do not explicitly account for geographic risk features, requiring planners to rely on personal familiarity with routes—a time-intensive, non-scalable approach. This work addresses these gaps by: (1) developing datasets that catalog geographic risk features along U.S. roadways, (2) eliciting risk perceptions from experienced transportation security experts, and (3) linking these perceptions to roadway conditions and geographic data. We implement these capabilities within Secure Route a novel mapping tool for classifying route segment risks associated with roadway conditions. This system provides transportation planners with an intuitive interface to assess and contextualize risk along potential routes, improving decision-making for secure transport. We present current progress in this effort and identify next steps.

Stewart, Robert [ORNL] (ORCID:0000000281867559)↗
DOE OSTI2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Empirical Study of Effect of Dynamic Travel Time Information on Driver Route Choice Behavior

The objective of this paper is to study the effect of travel time information on day-to-day driver route choice behavior. A real-world experimental study is designed to have participants repeatedly choose between two alternative routes for five origin-destination pairs over multiple days after providing them with dynamically updated travel time information (average travel time and travel time variability). The results demonstrate that historical travel time information enhances behavioral rationality by 10% on average and reduces inertial tendencies to increase risk seeking in the gain domain. Furthermore, expected travel time information is demonstrated to be more effective than travel time variability information in enhancing rational behavior when drivers have limited experiences. After drivers gain sufficient knowledge of routes, however, the difference in behavior associated with the two information types becomes insignificant. The results also demonstrate that, when drivers lack experience, the faster less reliable route is more attractive than the slower more reliable route. However, with cumulative experiences, drivers become more willing to take the more reliable route given that they are reluctant to become risk seekers once experience is gained. Furthermore, the effect of information on driver behavior differs significantly by participant and trip, which is, to a large extent, dependent on personal traits and trip characteristics.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

Transfissural Route Used for Preoperative Localization of Small Pulmonary Lesions with a Short Hook Wire and Suture System

PurposeWe retrospectively evaluated the results of the transfissural route for preoperative localization with a short hook wire and suture system for video-assisted thoracoscopic surgery (VATS).MethodsEleven patients with 11 tumors underwent CT-guided transfissural placement of a hook wire before VATS. This route was selected for all patients, because the distance between the tumor and interlobar fissure was much shorter than the required distance traversed using the conventional approach. Complications were evaluated using the National Cancer Institute Common Terminology Criteria for Adverse Events Version 4.0.ResultsThe hook wire was successfully placed using the transfissural route in all but one case. Of these ten successful placements, two tumors needed a second puncture for optimal placement, because the CT scan showed that the first hook wire was not properly placed in the lung. In one patient, we did not attempt replacement after the first placement was incorrect. In ten successful procedures, the mean distance traversed in the parenchyma of the unaffected lung lobe was 27.9 mm. The distance between the pleura and placed hook wire was significantly shorter than the estimated distance between the pleura and hook wire using the conventional route (mean 16.3 vs. 40.9 mm; P = 0.0002). Grade 1 adverse events occurred (11 pneumothoraxes and 4 pulmonary hemorrhages). No grade 2 or higher adverse event was observed.ConclusionsThe transfissural route used for preoperative localization before VATS is useful for selected patients because this route may allow for more limited lung parenchyma resection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Improving River Routing Using a Differentiable Muskingum‐Cunge Model and Physics‐Informed Machine Learning

Recently, rainfall-runoff simulations in small headwater basins have been improved by methodological advances such as deep neural networks (NNs) and hybrid physics-NN models—particularly, a genre called differentiable modeling that intermingles NNs with physics to learn relationships between variables. However, hydrologic routing simulations, necessary for simulating floods in stem rivers downstream of large heterogeneous basins, had not yet benefited from these advances and it was unclear if the routing process could be improved via coupled NNs. We present a novel differentiable routing method (δMC-Juniata-hydroDL2) that mimics the classical Muskingum-Cunge routing model over a river network but embeds an NN to infer parameterizations for Manning's roughness (n) and channel geometries from raw reach-scale attributes like catchment areas and sinuosity. The NN was trained solely on downstream hydrographs. Synthetic experiments show that while the channel geometry parameter was unidentifiable, n can be identified with moderate precision. With real-world data, the trained differentiable routing model produced more accurate long-term routing results for both the training gage and untrained inner gages for larger subbasins (>2,000 km2) than either a machine learning model assuming homogeneity, or simply using the sum of runoff from subbasins. The n parameterization trained on short periods gave high performance in other periods, despite significant errors in runoff inputs. The learned n pattern was consistent with literature expectations, demonstrating the framework's potential for knowledge discovery, but the absolute values can vary depending on training periods. The trained n parameterization can be coupled with traditional models to improve national-scale hydrologic flood simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Effect of process route on powder three-dimensional-printing of metal powders

The purpose of this study is to investigate the effect of two unique processing routes (solvent jetting (SJ) and binder jetting (BJ)), on the green density of printed stainless steel 316L (SS316L) and Nickel (Ni) powders. In the SJ processing route, a solvent is jetted unto the powder/binder mixture to selectively activate the binder, layer by layer. In the BJ processing route, a solution of the binder mixture is jetted onto the powder bed to selectively bind powder particles. The effects of printing parameters such as layer height, roller speed, shaker speed and nozzle temperature on the green density of printed components are investigated and compared for both processing routes. Results show that layer height and nozzle temperature affect the relative density of the printed compact for both processing routes. Slightly higher relative densities were achieved via the SJ route, with the overall highest relative density being 42.7% at 100 µ m layer height and 70% nozzle temperature for the SS316L components and 43.7% at 150 µ m layer height and 90% nozzle temperature for the Ni components, respectively. Results also show an increase in the final sintered relative density with an increase in green (printed) relative density of the solvent jetted SS316L components, with the highest relative density being 87.2%. The paper studies the influence of printing parameters on the green density of printed SS316L and Ni samples in an unprecedented effort to provide a comparative understanding of the process-property relationships in BJ and SJ of SS316L and Ni components to the additive manufacturing research community.

Engineering↗
DOE OSTI2020

PC-RPL: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Computer Science↗
DOE OSTI2015

Factors Affecting Route Selection and Survival of Steelhead Kelts at Snake River Dams in 2012 and 2013

In 2012 and 2013, Pacific Northwest National Laboratory (PNNL) conducted a study that summarized the passage route proportions and route-specific survival rates of steelhead kelts that passed through Federal Columbia River Power System (FCRPS) dams. To accomplish this, a total of 811 steelhead kelts were tagged with Juvenile Salmon Acoustic Telemetry System (JSATS) transmitters. Acoustic receivers, both autonomous and cabled, were deployed throughout the FCRPS to monitor the downstream movements of tagged kelts. Kelts were also tagged with passive integrated transponder tags to monitor passage through juvenile bypass systems (JBS) and detect returning fish. The current study evaluated data collected in 2012 and 2013 to identify environmental, temporal, operational, individual, and behavioral variables that were related to forebay residence time, route of passage, and survival of steelhead kelts at FCRPS dams on the Snake River. Multiple approaches, including 3-D tracking, bivariate and multivariable regression modeling, and decision tree analyses were used to identify the environmental, temporal, operational, individual, and behavioral variables that had the greatest effect on forebay residence time, route of passage, and route-specific and overall dam passage survival probabilities for tagged kelts at Lower Granite (LGR), Little Goose (LGS), and Lower Monumental (LMN) dams. In general, kelt behavior and discharge appeared to work independently to affect forebay residence times. Kelt behavior, primarily approach location, migration depth, and “searching” activities in the forebay, was found to have the greatest influence on their route of passage. The condition of kelts was the single most important factor affecting their survival. The information gathered in this study may be used by dam operators and fisheries managers to identify potential management actions to improve in-river survival of kelts or collection methods for kelt reconditioning programs to aid the recovery of Snake River steelhead populations.

13 HYDRO ENERGY↗
NASA NTRS1990

Adaptive fault-tolerant routing in hypercube multicomputers

A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node, information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. A distributed adaptive fault tolerant routing scheme is proposed in which each node is required to know only the condition of its own links. This scheme is shown to be capable of routing messages successfully as long as the number of faulty components is less than n (the dimension of the hypercube), and to route messages via shortest paths with a rather high probability. A second routing scheme based on depth-first search is proposed which works in the presence of an arbitrary number of faulty components; however, the paths chosen by this may not always be the shortest. To guarantee shortest paths, every mode must be given information beyond that on its own links; the additional information to be kept at each node for shortest-path routing is determined. Several examples are given to illustrate the results.

Chen, Ming-Syan↗
NASA NTRS1992

Annoyance caused by aircraft en route noise

A laboratory experiment was conducted to quantify the annoyance response of people on the ground to enroute noise generated by aircraft at cruise conditions. The en route noises were ground level recordings of eight advanced turboprop aircraft flyovers and six conventional turbofan flyovers. The eight advanced turboprop enroute noises represented the NASA Propfan Test Assessment aircraft operating at different combinations of altitude, aircraft Mach number, and propeller tip speed. The conventional turbofan en route noises represented six different commercial airliners. The overall durations of the en route noises varied from approximately 40 to 160 sec. In the experiment, 32 subjects judged the annoyance of the en route noises as well as recordings of the takeoff and landing noises of each of 5 conventional turboprop and 5 conventional turbofan aircraft. Each of the noises was presented at three sound pressure levels to the subjects in an anechoic listening room. Analysis of the judgments found small differences in annoyance between three combinations of aircraft type and operation. Current tone and corrections did not significantly improve en route annoyance prediction. The optimum duration-correction magnitude for en route noise was approximately 1 dB per doubling of effective duration.

Mccurdy, David A.↗
NASA NTRS1993

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗
NASA NTRS1994

Evaluating GCM land surface hydrology parameterizations by computing river discharges using a runoff routing model: Application to the Mississippi basin

To relate general circulation model (GCM) hydrologic output to readily available river hydrographic data, a runoff routing scheme that routes gridded runoffs through regional- or continental-scale river drainage basins is developed. By following the basin overland flow paths, the routing model generates river discharge hydrographs that can be compared to observed river discharges, thus allowing an analysis of the GCM representation of monthly, seasonal, and annual water balances over large regions. The runoff routing model consists of two linear reservoirs, a surface reservoir and a groundwater reservoir, which store and transport water. The water transport mechanisms operating within these two reservoirs are differentiated by their time scales; the groundwater reservoir transports water much more slowly than the surface reservior. The groundwater reservior feeds the corresponding surface store, and the surface stores are connected via the river network. The routing model is implemented over the Global Energy and Water Cycle Experiment (GEWEX) Continental-Scale International Project Mississippi River basin on a rectangular grid of 2 deg X 2.5 deg. Two land surface hydrology parameterizations provide the gridded runoff data required to run the runoff routing scheme: the variable infiltration capacity model, and the soil moisture component of the simple biosphere model. These parameterizations are driven with 4 deg X 5 deg gridded climatological potential evapotranspiration and 1979 First Global Atmospheric Research Program (GARP) Global Experiment precipitation. These investigations have quantified the importance of physically realistic soil moisture holding capacities, evaporation parameters, and runoff mechanisms in land surface hydrology formulations.

Liston, G. E.↗
NASA NTRS2003

Route Monopolie and Optimal Nonlinear Pricing

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform distribution of agent types and explain the implications for airlines in terms of service differentiation.

Tournut, Jacques↗