IDEAS home Printed from https://ideas.repec.org/a/vrs/ijsiel/v14y2024i1p131-146n1012.html
   My bibliography  Save this article

Logistics Optimization for Resource Allocation and Scheduling Using Time Slots

Author

Listed:
  • Papară Cezar-Marian

    (PhD student at “Alexandru Ioan Cuza” University, Faculty of Computer Science, 16 Berthelot St., Iasi, 700506)

  • Schirliu Ștefan-Horia

    (Master’s student at Faculty of Sciences, “Vasile Alecsandri” University of Bacău, 157 Cal. Mărășești, Bacău, 600115, România)

Abstract

In the field of logistics, efficient scheduling and resource allocation are essential for ensuring the seamless flow of goods through transportation networks. This paper addresses the Interval Scheduling Problem, a combinatorial optimization challenge, in the context of logistics planning for goods transportation. The study examines how optimized appointment scheduling and resource allocation can enhance the performance of transportation networks. By combining theoretical insights, algorithmic solutions, and practical applications, this work proposes a comprehensive approach grounded in mathematical models that account for time, resource, and capacity constraints, alongside a computational implementation. Utilizing advanced computational techniques and real-time data integration, the proposed solutions aim to increase operational effectiveness and competitiveness while reducing costs in transportation logistics.

Suggested Citation

  • Papară Cezar-Marian & Schirliu Ștefan-Horia, 2024. "Logistics Optimization for Resource Allocation and Scheduling Using Time Slots," International Journal of Advanced Statistics and IT&C for Economics and Life Sciences, Sciendo, vol. 14(1), pages 131-146.
  • Handle: RePEc:vrs:ijsiel:v:14:y:2024:i:1:p:131-146:n:1012
    DOI: 10.2478/ijasitels-2024-0012
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/ijasitels-2024-0012
    Download Restriction: no

    File URL: https://libkey.io/10.2478/ijasitels-2024-0012?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
    ---><---

    References listed on IDEAS

    as
    1. Papară Cezar-Marian, 2022. "An empirical study of large transportation networks and solutions for the cost optimization," International Journal of Advanced Statistics and IT&C for Economics and Life Sciences, Sciendo, vol. 12(2), pages 41-52, December.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    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. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    2. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    3. Tianlu Zhao & Yongjian Yang & En Wang, 2020. "Minimizing the average arriving distance in carpooling," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    4. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    5. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    7. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    8. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    9. Tibor Holczinger & Olivér Ősz & Máté Hegyháti, 2020. "Scheduling approach for on-site jobs of service providers," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 913-948, December.
    10. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    11. Narjes MASHHADI BANDANI & Alireza NADERI & Mohsen AKBARPOUR SHIRZAEI, 2017. "Cement Transportation Limited-Fleet Modeling And Assigning To Rated Demands," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(1), pages 111-123, March.
    12. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    13. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    14. Yeo, Lip Siang & Teng, Sin Yong & Ng, Wendy Pei Qin & Lim, Chun Hsion & Leong, Wei Dong & Lam, Hon Loong & Wong, Yat Choy & Sunarso, Jaka & How, Bing Shen, 2022. "Sequential optimization of process and supply chains considering re-refineries for oil and gas circularity," Applied Energy, Elsevier, vol. 322(C).
    15. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    16. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    17. Ling Gai & Ying Jin & Binyuan Zhang, 2022. "An integrated method for hybrid distribution with estimation of demand matching degree," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2782-2808, November.
    18. Jin Li & Feng Wang & Yu He, 2020. "Electric Vehicle Routing Problem with Battery Swapping Considering Energy Consumption and Carbon Emissions," Sustainability, MDPI, vol. 12(24), pages 1-20, December.
    19. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    20. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.

    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:vrs:ijsiel:v:14:y:2024:i:1:p:131-146:n:1012. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.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.