IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v226y2013i3p592-601.html
   My bibliography  Save this article

Optimization of column width in website layout for advertisement fit

Author

Listed:
  • Marszałkowski, Jakub
  • Drozdowski, Maciej

Abstract

Advertising is the basic source of income for many web businesses. Preparing website layout for the advertisements is a problem faced by many web designers. The ads and other content are placed in several columns. Usually column widths are chosen ad hoc to fit the widest advertising unit. To make a more informed decisions website column width selection is formulated in this paper as optimization problem. A method of selecting column widths for a given set of advertisement units is proposed. Ad unit combinations that fit the given column widths are generated by the improved Wang algorithm for two-dimensional stock cutting problem. Column widths are evaluated for several objective functions. Two approaches are proposed. The first constructs a Pareto frontier of column width combinations. The second calculates the optimum column widths with respect to a weighted linear function of the objectives. To justify the weights expert survey was conducted. Both approaches are examined on datasets of internet advertising units.

Suggested Citation

  • Marszałkowski, Jakub & Drozdowski, Maciej, 2013. "Optimization of column width in website layout for advertisement fit," European Journal of Operational Research, Elsevier, vol. 226(3), pages 592-601.
    • Handle: RePEc:eee:ejores:v:226:y:2013:i:3:p:592-601
    DOI: 10.1016/j.ejor.2012.11.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712008764
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.11.028?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.

    References listed on IDEAS

    as
    1. P. Y. Wang, 1983. "Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems," Operations Research, INFORMS, vol. 31(3), pages 573-586, June.
    2. Kumar, Subodha & Jacob, Varghese S. & Sriskandarajah, Chelliah, 2006. "Scheduling advertisements on a web page to maximize revenue," European Journal of Operational Research, Elsevier, vol. 173(3), pages 1067-1089, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nicolás Aramayo & Mario Schiappacasse & Marcel Goic, 2023. "A Multiarmed Bandit Approach for House Ads Recommendations," Marketing Science, INFORMS, vol. 42(2), pages 271-292, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sándor P. Fekete & Jörg Schepers, 2004. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 353-368, May.
    2. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    3. Wu, Yu-Liang & Huang, Wenqi & Lau, Siu-chung & Wong, C. K. & Young, Gilbert H., 2002. "An effective quasi-human based heuristic for solving the rectangle packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 341-358, September.
    4. Parada Daza, Victor & Gomes de Alvarenga, Arlindo & de Diego, Jose, 1995. "Exact solutions for constrained two-dimensional cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 633-644, August.
    5. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2012. "To Show or Not Show: Using User Profiling to Manage Internet Advertisement Campaigns at Chitika," Interfaces, INFORMS, vol. 42(5), pages 449-464, October.
    6. Suliman, S.M.A., 2006. "A sequential heuristic procedure for the two-dimensional cutting-stock problem," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 177-185, February.
    7. Riehme, Jan & Scheithauer, Guntram & Terno, Johannes, 1996. "The solution of two-stage guillotine cutting stock problems having extremely varying order demands," European Journal of Operational Research, Elsevier, vol. 91(3), pages 543-552, June.
    8. Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke, 2020. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships," Journal of Heuristics, Springer, vol. 26(6), pages 885-912, December.
    9. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    10. Parham Fami Tafreshi & Mohammad Hasan Aghdaie & Majid Behzadian & Mahdieh Ghani Abadi, 2016. "Developing a Group Decision Support System for Advertising Media Evaluation: A Case in the Middle East," Group Decision and Negotiation, Springer, vol. 25(5), pages 1021-1048, September.
    11. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.
    12. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    13. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    14. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    15. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    16. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    17. Subodha Kumar & Xiaowei Mei & Liangfei Qiu & Lai Wei, 2020. "Watching Ads for Free Mobile Data: A Game-Theoretic Analysis of Sponsored Data with Reward Task," Working Papers 20-08, NET Institute.
    18. Alvarez-Valdes, R. & Parreno, F. & Tamarit, J.M., 2007. "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1167-1182, December.
    19. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    20. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.

    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:eee:ejores:v:226:y:2013:i:3:p:592-601. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.