IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v31y2023i1d10.1007_s10100-022-00798-1.html
   My bibliography  Save this article

The bin covering with delivery problem, extended investigations for the online case

Author

Listed:
  • Gyula Abraham

    (University of Pannonia)

  • Peter Auer

    (Montanuniversität Leoben)

  • Gyorgy Dosa

    (University of Pannonia)

  • Tibor Dulai

    (University of Pannonia)

  • Zsolt Tuza

    (Alfréd Rényi Institute of Mathematics
    University of Pannonia)

  • Agnes Werner-Stark

    (University of Pannonia)

Abstract

We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” covering. This problem has been defined and investigated recently. Here we continue and significantly augment the preliminary investigations of the problem. After studying the goodness of adapted versions of some classical algorithms, we propose a parametrized algorithm and use a heuristic parameter optimization method to solve this (algorithmically very challenging) problem. Namely, we apply local search to determine a good choice of the parameters. The efficiency of the proposed method is demonstrated by intensive computer experiments on appropriate modifications of benchmark instances.

Suggested Citation

  • Gyula Abraham & Peter Auer & Gyorgy Dosa & Tibor Dulai & Zsolt Tuza & Agnes Werner-Stark, 2023. "The bin covering with delivery problem, extended investigations for the online case," 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. 31(1), pages 21-47, March.
    • Handle: RePEc:spr:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00798-1
    DOI: 10.1007/s10100-022-00798-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-022-00798-1
    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/s10100-022-00798-1?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. Zhong, Weiya & Dosa, Gyorgy & Tan, Zhiyi, 2007. "On the machine scheduling problem with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1057-1072, November.
    2. Attila Benkő & György Dósa & Zsolt Tuza, 2013. "Bin covering with a general profit function: approximability results," 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. 21(4), pages 805-816, 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. Jason Pan & Chi-Shiang Su, 2015. "Two parallel machines problem with job delivery coordination and availability constraint," Annals of Operations Research, Springer, vol. 235(1), pages 653-664, December.
    2. Wan, Long & Zhang, An, 2014. "Coordinated scheduling on parallel machines with batch delivery," International Journal of Production Economics, Elsevier, vol. 150(C), pages 199-203.
    3. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    4. Low, Chinyao & Chang, Chien-Min & Li, Rong-Kwei & Huang, Chia-Ling, 2014. "Coordination of production scheduling and delivery problems with heterogeneous fleet," International Journal of Production Economics, Elsevier, vol. 153(C), pages 139-148.
    5. Liu, Peihai & Lu, Xiwen, 2016. "Integrated production and job delivery scheduling with an availability constraint," International Journal of Production Economics, Elsevier, vol. 176(C), pages 1-6.
    6. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    7. Gao, Su & Qi, Lian & Lei, Lei, 2015. "Integrated batch production and distribution scheduling with limited vehicle capacity," International Journal of Production Economics, Elsevier, vol. 160(C), pages 13-25.
    8. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    9. Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin, 2016. "An improved two-machine flowshop scheduling with intermediate transportation," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1316-1334, April.
    10. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 2022. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1 , c = 1 | C max," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2195-2206, November.
    11. Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin, 2018. "Single machine scheduling with job delivery to multiple customers," Journal of Scheduling, Springer, vol. 21(3), pages 337-348, June.
    12. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    13. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 0. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    14. Attila Benkő & György Dósa & Zsolt Tuza, 2013. "Bin covering with a general profit function: approximability results," 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. 21(4), pages 805-816, December.
    15. Guo, Zhaoxia & Shi, Leyuan & Chen, Longchao & Liang, Yong, 2017. "A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing," Omega, Elsevier, vol. 66(PB), pages 327-343.

    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:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00798-1. 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.