English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We introduce the Monte-Carlo based heuristic with first-come-first-served approximation for future optimal strategy (MC-FCFS) in order to maximize profit in a network revenue management problem. Like the randomized linear programming (RLP) model, one purpose of the MC-FCFS heuristic is to have information about displacement costs, considering the full probability distribution of future demands instead of a simplified degenerate distribution as in the deterministic linear programming (DLP) model. However, this information is conveyed by applying the FCFS heuristic as a future strategy rather than using the optimal ex-post profits as in the RLP heuristic. We show that MC-FCFS performs approximately as well as the RLP heuristic at a much lower computational cost and much better than the DLP heuristic at maximizing profit in a multi-night hotel booking setting with or without planned upgrades.

The Monte Carlo First-Come-First-Served Heuristic for Network Revenue Management