• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Stochastic Optimization in Freight Revenue Management

Student: Nekrashevich Aliaksandr

Supervisor: Aleksandr Gasnikov

Faculty: Faculty of Computer Science

Educational Programme: Statistical Learning Theory (Master)

Final Grade: 8

Year of Graduation: 2019

In this work, authors study freight revenue management. Describing the industry have been a challenging problem for several decades, with plenty models and approaches provided. However, by authors knowledge, they are either non-scalable for industrial setting, or track incomplete set of industrial features and peculiarities. Particularly, scalable ones do not track uncertainty over several business lines together. Non-scalability appears due to network problem structure, which arrives due to limited vessel capacity, as well as port container balancing. However, due to recent developments in optimization, it became possible to relax these constraints. In authors’ new model, a scalable stochastic approach with dynamic pricing and container management is presented, with a peculiar ability to ship empty containers.

Full text (added May 29, 2019)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses