Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway

This paper studies the multistage pricing and seat allocation problems for multiple train services in a high-speed railway (HSR) with multiple origins and destinations (ODs). Taking the maximum total revenue of all trains as the objective function, a joint optimization model of multistage pricing an...

Full description

Saved in:
Bibliographic Details
Main Authors: Lianbo Deng, Jing Xu, Ningxin Zeng, Xinlei Hu
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2021/5316574
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832558891889590272
author Lianbo Deng
Jing Xu
Ningxin Zeng
Xinlei Hu
author_facet Lianbo Deng
Jing Xu
Ningxin Zeng
Xinlei Hu
author_sort Lianbo Deng
collection DOAJ
description This paper studies the multistage pricing and seat allocation problems for multiple train services in a high-speed railway (HSR) with multiple origins and destinations (ODs). Taking the maximum total revenue of all trains as the objective function, a joint optimization model of multistage pricing and seat allocation is established. The actual operation constraints, including train seat capacity constraints, price time constraints in each period, and price space constraints among products, are fully considered. We reformulate the optimization model as a bilevel multifollower programming model in which the upper-level model solves the seat allocation problem for all trains serving multiple ODs in the whole booking horizon and the lower optimizes the pricing decisions for each train serving each OD in different decision periods. The upper and lower are a large-scale static seat allocation programming and many small-scale multistage dynamic pricing programming which can be solved independently, respectively. The solving difficulty can be significantly reduced by decomposing. Then, we design an effective solution method based on divide-and-conquer strategy. A real instance of the China’s Wuhan-Guangzhou high-speed railway is employed to validate the advantages of the proposed model and the solution method.
format Article
id doaj-art-c291c9e951094937873373e1a22b03fe
institution Kabale University
issn 2042-3195
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Journal of Advanced Transportation
spelling doaj-art-c291c9e951094937873373e1a22b03fe2025-02-03T01:31:27ZengWileyJournal of Advanced Transportation2042-31952021-01-01202110.1155/2021/5316574Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed RailwayLianbo Deng0Jing Xu1Ningxin Zeng2Xinlei Hu3School of Traffic and Transportation EngineeringSchool of Traffic and Transportation EngineeringChina Railway SIYUAN Survey and Design Group Co. Ltd.School of Traffic and Transportation EngineeringThis paper studies the multistage pricing and seat allocation problems for multiple train services in a high-speed railway (HSR) with multiple origins and destinations (ODs). Taking the maximum total revenue of all trains as the objective function, a joint optimization model of multistage pricing and seat allocation is established. The actual operation constraints, including train seat capacity constraints, price time constraints in each period, and price space constraints among products, are fully considered. We reformulate the optimization model as a bilevel multifollower programming model in which the upper-level model solves the seat allocation problem for all trains serving multiple ODs in the whole booking horizon and the lower optimizes the pricing decisions for each train serving each OD in different decision periods. The upper and lower are a large-scale static seat allocation programming and many small-scale multistage dynamic pricing programming which can be solved independently, respectively. The solving difficulty can be significantly reduced by decomposing. Then, we design an effective solution method based on divide-and-conquer strategy. A real instance of the China’s Wuhan-Guangzhou high-speed railway is employed to validate the advantages of the proposed model and the solution method.http://dx.doi.org/10.1155/2021/5316574
spellingShingle Lianbo Deng
Jing Xu
Ningxin Zeng
Xinlei Hu
Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
Journal of Advanced Transportation
title Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
title_full Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
title_fullStr Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
title_full_unstemmed Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
title_short Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
title_sort optimization problem of pricing and seat allocation based on bilevel multifollower programming in high speed railway
url http://dx.doi.org/10.1155/2021/5316574
work_keys_str_mv AT lianbodeng optimizationproblemofpricingandseatallocationbasedonbilevelmultifollowerprogramminginhighspeedrailway
AT jingxu optimizationproblemofpricingandseatallocationbasedonbilevelmultifollowerprogramminginhighspeedrailway
AT ningxinzeng optimizationproblemofpricingandseatallocationbasedonbilevelmultifollowerprogramminginhighspeedrailway
AT xinleihu optimizationproblemofpricingandseatallocationbasedonbilevelmultifollowerprogramminginhighspeedrailway