Research Article
Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway
Algorithm 1
Divide-and-conquer solution algorithm.
| Set an initial feasible solution, ; | Calculate the initial total revenue, ; | Repeat | Calculate ; ; | Solve for all products by Model 1’; | Repeat | Solve for each product by Model 2’; | Update ; ; | Calculate the total revenue, ; | Compare the old and new revenue. Update the optimal and at the higher total revenue; | Stop if the value of objective function does not improve in successive iterations; | Output: final solution. |
|