IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v337y2024i1d10.1007_s10479-024-05920-x.html
   My bibliography  Save this article

Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model

Author

Listed:
  • Edmar Langendoen

    (Erasmus University Rotterdam)

  • Flavius Frasincar

    (Erasmus University Rotterdam)

  • Mark Riezebos

    (Erasmus University Rotterdam)

  • Vladyslav Matsiiako

    (Erasmus University Rotterdam)

  • David Boekestijn

    (Erasmus University Rotterdam)

Abstract

The aim of this paper is to optimize the allocation of multiple advertisements on a Web banner, where the price of an advertisement depends on the location at the banner. This problem can be defined as a two-dimensional single orthogonal knapsack problem with a location-based pixel-price model. A formulation is proposed in which the problem is specified as a 0–1 integer programming problem. As this problem is NP-complete, we mainly focus on a heuristic approach to solve the problem. We propose two new heuristic algorithms: the reactive GRASP algorithm and the partitioning left-justified algorithm. Next to that, we present an exact algorithm that is able to solve small problem instances in a reasonable time. These newly presented algorithms are compared with respect to efficiency and effectiveness to existing algorithms that solve the problem without a location-based pixel-price model. To test the quality of the algorithms, we have executed two experiments. The results of these experiments show that overall the reactive GRASP algorithm is the most effective algorithm, whereas the greedy stripping algorithm is the most efficient.

Suggested Citation

  • Edmar Langendoen & Flavius Frasincar & Mark Riezebos & Vladyslav Matsiiako & David Boekestijn, 2024. "Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model," Annals of Operations Research, Springer, vol. 337(1), pages 135-166, June.
    • Handle: RePEc:spr:annopr:v:337:y:2024:i:1:d:10.1007_s10479-024-05920-x
    DOI: 10.1007/s10479-024-05920-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-05920-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-05920-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:337:y:2024:i:1:d:10.1007_s10479-024-05920-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.