A combined average-case and worst-case analysis for an integrated hub location and revenue management problem (Q2296583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128223658, #quickstatements; #temporary_batch_1724739681498
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2019/8651728 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2921630874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Pricing in Airline Seat Management for Flights with Multiple Flight Legs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network revenue management with inventory-sensitive bid prices and customer choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Bid-Price Controls for Network Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Piecewise-Linear Approximation for Network Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline revenue management games with simultaneous price and quantity competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties in a hub-to-hub network revenue management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management: Research Overview and Prospects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub median problem with modular arc capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem in a star–star network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness and approximation of the star \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable stochastic analysis in high dimensions via robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Optimization Perspective on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated hub location problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128223658 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:39, 27 August 2024

scientific article
Language Label Description Also known as
English
A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
scientific article

    Statements

    A combined average-case and worst-case analysis for an integrated hub location and revenue management problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2020
    0 references
    Summary: This paper investigates joint decisions on airline network design and capacity allocation by integrating an uncapacitated single allocation p-hub median location problem into a revenue management problem. For the situation in which uncertain demand can be captured by a finite set of scenarios, we extend this integrated problem with average profit maximization to a combined average-case and worst-case analysis of this integration. We formulate this problem as a two-stage stochastic programming framework to maximize the profit, including the cost of installing the hubs and a weighted sum of average and worst case transportation cost and the revenue from tickets over all scenarios. This model can give flexible decisions by putting the emphasis on the importance of average and worst case profits. To solve this problem, a genetic algorithm is applied. Computational results demonstrate the outperformance of the proposed formulation.
    0 references
    0 references

    Identifiers