BI-OBJECTIVE BLOOD PRODUCT SCHEDULING UNDER BLOOD SHORTAGE AND LIMITED SUPPLY

被引:1
|
作者
Zhao, Liu [1 ,2 ]
Wang, Nengmin [1 ,2 ]
Xu, Yinfeng [1 ]
Jiang, Bin [3 ]
机构
[1] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Shaanxi, Peoples R China
[2] ERC Proc Min Mfg Serv Shaanxi Prov, Xian 710049, Shaanxi, Peoples R China
[3] DePaul Univ, Driehaus Coll Business, Dept Management, Chicago, IL 60604 USA
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Blood product scheduling; vehicle routing problem (VRP); bi-objective optimisation; epsilon-constraint method; epsilon-GA-VNS; VEHICLE-ROUTING PROBLEM; TIME WINDOWS; ALGORITHMS;
D O I
10.3934/jimo.2023033
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Increased blood demand and limited blood supply make blood shortages a significant problem in the blood supply chain, which may cause immeasurable losses. The objective of this paper is to develop the scheduling scheme of blood products during blood shortages, considering limited blood supply. For this purpose, a bi-objective mixed-integer programming model is proposed, in which one objective minimises the maximum blood shortage of hospitals as well as the other one minimises the latest arrival time. To solve this model, a epsilon-constraint-based hybrid algorithm called epsilon-GA-VNS is presented, which benefits from exploration of the genetic algorithm (GA) and exploitation of the variable neighbourhood search (VNS) approaches. Then, a series of numerical experiments based on Solomon's benchmark were performed to evaluate the proposed model and algorithm. A performance comparison of epsilon-GA-VNS and NSGA-II indicated that epsilon-GA-VNS was superior to NSGA-II in both efficiency and effectiveness. Finally, sensitivity analyses of the uncertain and stochastic blood supply and demand impart several managerial insights.
引用
收藏
页码:8129 / 8151
页数:23
相关论文
共 50 条
  • [1] Designing a bi-objective stochastic blood supply chain network in a disaster
    Naghipour, Mohsen
    Bashiri, Mahdi
    PROCEEDINGS OF 2019 15TH IRAN INTERNATIONAL INDUSTRIAL ENGINEERING CONFERENCE (IIIEC), 2019, : 171 - 177
  • [2] Bi-objective optimisation of the enzymatic hydrolysis of porcine blood protein
    Perez-Galvez, Raul
    Carmen Almecija, M.
    Javier Espejo, F.
    Guadix, Emilia M.
    Guadix, Antonio
    BIOCHEMICAL ENGINEERING JOURNAL, 2011, 53 (03) : 305 - 310
  • [3] A Bi-Objective Paediatric Operating Theater Scheduling
    Dekhici, Latifa
    Belkadi, Khaled
    INTERNATIONAL JOURNAL OF HEALTHCARE INFORMATION SYSTEMS AND INFORMATICS, 2023, 18 (01)
  • [4] Bi-objective orienteering for personal activity scheduling
    Matl, Piotr
    Nolz, Pamela C.
    Ritzinger, Ulrike
    Ruthmair, Mario
    Tricoire, Fabien
    COMPUTERS & OPERATIONS RESEARCH, 2017, 82 : 69 - 82
  • [5] A bi-objective optimisation model for the drone scheduling problem in island delivery
    Yang, Ying
    Liu, Jiaxin
    Wang, Shuaian
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2025,
  • [6] BI-OBJECTIVE OPTIMIZATION OF SINGLE-MACHINE BATCH SCHEDULING UNDER TIME-OF-USE ELECTRICITY PRICES
    Cheng, Junheng
    Chu, Feng
    Chu, Chengbin
    Xia, Weili
    RAIRO-OPERATIONS RESEARCH, 2016, 50 (4-5) : 715 - 732
  • [7] Bi-Objective Optimization of a Flow Shop Scheduling Problem Under Time-of-Use Tariffs
    Wang, Xinyue
    Chu, Feng
    Ren, Tao
    Bai, Danyu
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024,
  • [8] A bi-objective scheduling-sharing optimization model for criminal court planning under uncertainty
    Lashgari, Zeinab
    Vahdani, Behnam
    Gholami, Habib Reza
    Amiri, Maghsoud
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2025,
  • [9] A bi-objective approach for scheduling ground-handling vehicles in airports
    Padron, Silvia
    Guimarans, Daniel
    Jose Ramos, Juan
    Fitouri-Trabelsi, Salma
    COMPUTERS & OPERATIONS RESEARCH, 2016, 71 : 34 - 53
  • [10] Bi-Objective simplified swarm optimization for fog computing task scheduling
    Yeh, Wei-Chang
    Liu, Zhenyao
    Tseng, Kuan-Cheng
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2023, 14 (04) : 723 - 748