Railway passenger transportation plays a fundamental role in Europe, particularly in view of the growing number of trains offering valuable services such as high speed travel, high comfort, etc. Hence, it is advantageous to submit seat inventories to a Yield Management system to get the maximum revenue. We consider a deterministic linear programming model and a probabilistic nonlinear programming model for the network problem with non-nested seat allocation. A first comparative analysis of the computational results obtained by the two models, both in terms of the overall expected revenue and in terms of CPU time, is carried out. Furthermore, we describe a new nonlinear algorithm for the solution of the probabilistic nonlinear programming model that exploits the structure of the optimization problem. The numerical results obtained on a set of real data show that, for this class of problems, this algorithm is more efficient than other standard algorithms for nonlinear programming problems.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||A mathematical programming approach for the solution of the railway yield management problem|
|Data di pubblicazione:||1999|
|Appartiene alla tipologia:||01a Articolo in rivista|