99 / 2017-05-18 14:44:49
A General and Bid Price Control Algorithm on Maximized Total Revenue Problem under Fare Class Interval Customer Choice
14453,8628,14454,14455,14456,14457
Abstract Pending
宝花 王 / 清华大学经济管理学院; 北京联合大学商务学院
In this research we develop a quite general algorithm named as valuing-bidding-mapping algorithm on the maximized total revenue problem to find the optimal closed set at given remaining time and capacity. Our algorithm has three differences with literatures. First, we solve it under a more general fare class set-type customer choice instead of complete set choice model. Second, we have no assumption on optimal policy instead of the usual nesting policy assumption. Third, we applies bid price control in the algorithm, thus the computation task is greatly reduced. Numerical examples show that unlike literatures, the quantity or revenue of optimal set could be not increasing with stage.
Important Date
  • Conference Date

    Jul 22

    2017

    to

    Jul 23

    2017

  • Jul 10 2017

    Draft paper submission deadline

  • Jul 18 2017

    Draft Paper Acceptance Notification

  • Jul 18 2017

    Final Paper Deadline

  • Jul 23 2017

    Registration deadline

Contact Information
  • 张先俊(论文出版及检索)
  • 027-87332517
  • 186********
  • 027*********