IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v31y2023i1d10.1007_s11750-022-00624-6.html
   My bibliography  Save this article

A two-phase heuristic algorithm for the label printing problem

Author

Listed:
  • Emre Çankaya

    (Ozyegin University)

  • Ali Ekici

    (Ozyegin University)

  • Okan Örsan Özener

    (Ozyegin University)

Abstract

In this paper, we study the label printing problem (LPP) which has applications in the printing industry. In LPP, the demand for a set of labels is satisfied by printing the labels using templates with multiple slots. Given a fixed number of templates, the decisions in LPP are determining (i) the assignment of labels to the slots of the templates (which we call template designs), and (ii) the number of prints made using each template design. The objective is to satisfy the demand with minimum waste. We consider two variants of LPP where (i) each label can be assigned to the slot(s) of a single template, and (ii) each label can be assigned to the slot(s) of multiple templates. To address LPP, we propose a novel sampling-based construct-improve heuristic where we first generate “good” template designs and then choose the ones to be used and determine the number of prints made through a set covering-type mathematical model. Then, we improve the solution using some improvement ideas that utilize a strengthened linear integer model for the problem. Using the instances from the literature, we show that the proposed heuristic provides better results compared to the benchmark algorithm. We also find optimal solutions for some of the instances from the literature using the strengthened linear integer model. With the help of the optimal solutions found we identify some problems in the previously reported results in a related study. Finally, we observe that the proposed heuristic approach not only provides better solutions but also runs in less amount of time compared to the benchmark algorithm on the large instances.

Suggested Citation

  • Emre Çankaya & Ali Ekici & Okan Örsan Özener, 2023. "A two-phase heuristic algorithm for the label printing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 110-138, April.
    • Handle: RePEc:spr:topjnl:v:31:y:2023:i:1:d:10.1007_s11750-022-00624-6
    DOI: 10.1007/s11750-022-00624-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-022-00624-6
    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/s11750-022-00624-6?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. Dwi Groß & Horst Hamacher & Simone Horn & Anita Schöbel, 2009. "Stop location design in public transportation networks: covering and accessibility objectives," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 335-346, December.
    2. Pál Pusztai, 2008. "An application of the greedy heuristic of set cover to traffic checks," 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. 16(4), pages 407-414, December.
    Full references (including those not matched with items on IDEAS)

    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. Hugo M. Repolho & António P. Antunes & Richard L. Church, 2013. "Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line," Transportation Science, INFORMS, vol. 47(3), pages 330-343, August.
    2. Benjamin Otto, 2019. "Aggregation techniques for frequency assignment in public transportation," Public Transport, Springer, vol. 11(1), pages 51-87, June.
    3. A. Kimms & K.-C. Maassen & S. Pottbäcker, 2012. "Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements," 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. 20(4), pages 755-773, December.
    4. Piotr Kaszczyszyn & Natalia Sypion-Dutkowska, 2019. "Walking Access to Public Transportation Stops for City Residents. A Comparison of Methods," Sustainability, MDPI, vol. 11(14), pages 1-13, July.
    5. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    6. M. C. López-de-los-Mozos & Juan A. Mesa, 2022. "To stop or not to stop: a time-constrained trip covering location problem on a tree network," Annals of Operations Research, Springer, vol. 316(2), pages 1039-1061, September.
    7. Emilio Carrizosa & Jonas Harbering & Anita Schöbel, 2016. "Minimizing the passengers’ traveling time in the stop location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(10), pages 1325-1337, October.
    8. Perea, Federico & Mesa, Juan A. & Laporte, Gilbert, 2014. "Adding a new station and a road link to a road–rail network in the presence of modal competition," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 1-16.
    9. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.

    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:topjnl:v:31:y:2023:i:1:d:10.1007_s11750-022-00624-6. 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: 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.