2020
DOI: 10.1016/j.cie.2020.106864
|View full text |Cite
|
Sign up to set email alerts
|

Simulation-based integrated optimization of nesting policy and booking limits for revenue management

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…When the new solution is not accepted, keep the old solution unchanged and cool down. when the current temperature is lower than the end temperature, end the algorithm and get the final solution [ 27 , 28 ].…”
Section: Optimization Of Neural Network Algorithm Based On High-order Simulated Annealingmentioning
confidence: 99%
“…When the new solution is not accepted, keep the old solution unchanged and cool down. when the current temperature is lower than the end temperature, end the algorithm and get the final solution [ 27 , 28 ].…”
Section: Optimization Of Neural Network Algorithm Based On High-order Simulated Annealingmentioning
confidence: 99%
“…Additionally, different distributions for the demand were attempted in their study. Luo et al ( 2020 ) proposed a generalized nesting policy (GNP) that can enrich the family of nesting policies. A mathematical model for the nesting control under GNP was suggested, in which the nesting policy and booking limits were both taken as the decision variables.…”
Section: Literature Reviewmentioning
confidence: 99%
“…When determining different fare levels in an airplane, the limited seats should be distributed to predetermined fare levels as efficiently as possible, since any unsold seats or opportunity costs resulting from selling too many low-fare seats are undesirable. In the literature, there are many optimization models such as dynamic programming (Kunnumkal and Topaloğlu, 2010 ; Selçuk and Avşar, 2019 ), linear programming (Möller et al, 2004 ; Liu and van Ryzin, 2008 ), bid price control (Akan and Ata, 2009 ; Talluri and van Ryzin, 1998 ), and nested booking limits (van Ryzin and Vulcano, 2008 ; Luo et al, 2020 ). Since the problem space is enormous and human-related aspects are involved, algorithms are becoming more complicated to tackle complex problems arising in the ARM.…”
Section: Introductionmentioning
confidence: 99%
“…When the train offers multiple fare classes, a nesting control can avoid the situation in which more profitable bookings are rejected in favor of less profitable products. The virtual nesting controls (e.g., Smith and Penn, 1988; Bertsimas and de Boer, 2005; Luo et al., 2020) developed for airlines are not feasible for railways because these methods produce leg‐based allocations, which cannot meet the “one‐seat‐one‐ticket” restriction of the passenger railway. Therefore, a train usually sets nested allocation that is simply nested by fare classes.…”
Section: Traditional Railway Booking Control Strategiesmentioning
confidence: 99%