Joint optimization of multi-type component procurement and assignment problems with budget constraint

被引:0
|
作者
Qiu, Siqi [1 ]
Tu, Danhong [2 ]
Ming, Xinguo [3 ]
机构
[1] Shanghai Jiao Tong Univ, SJTU Paris Elite Inst Technol, Shanghai, Peoples R China
[2] China Shipbuilding Power Engn Inst Co Ltd, Shanghai, Peoples R China
[3] Shanghai Jiao Tong Univ, Sch Mech Engn, 800 Dongchuan Rd, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Component assignment problem; heuristic algorithm; Birnbaum importance; reliability optimization; budget constraint; ALLOCATION; HEURISTICS; SYSTEMS;
D O I
10.1177/1748006X251319070
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
There are usually multiple types of products with similar functions available on the market, and the price of a product depends on its functionality and reliability. For some industrial systems whose components are functionally exchangeable, different component procurement plans and assignment plans lead to different system reliability and procurement cost. The objective of multi-type component assignment problem (MCAP) is to search the optimal assignment of multiple types of components to the positions of a system for maximizing the system reliability. However, in the existing studies on MCAPs, a particular position can be assigned at most two types of components and the budget constraint has not been taken into consideration. This work studies a new type of MCAPs in which a particular position can be assigned multiple types of components, develops the mathematical model of the MCAP with budget constraint, and proposes a Birnbaum importance (BI)-based two-stage heuristic to solve the budget-constrained MCAP. The proposed method is applied to a real-world fuel service system of marine engines to show its feasibility and practicability.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Joint location and assignment optimization of multi-type fire vehicles
    Liu, Han
    Soleimaniamiri, Saeid
    Li, Xiaopeng
    Xie, Siyang
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2022, 37 (08) : 976 - 990
  • [2] Birnbaum importance based heuristics for multi-type component assignment problems
    Zhu, Xiaoyan
    Fu, Yugiang
    Yuan, Tao
    Wu, Xinying
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2017, 165 : 209 - 221
  • [3] Coordinated Optimization of Multi-Type Peak Shaving Resources Considering Carbon Budget Constraints
    Li, Hujun
    Lv, Mengxuan
    Deng, Fangzhao
    Yang, Meng
    Yuan, Bo
    Zhang, Dong
    2022 4TH INTERNATIONAL CONFERENCE ON SMART POWER & INTERNET ENERGY SYSTEMS, SPIES, 2022, : 2329 - 2334
  • [4] OPTIMIZATION PROBLEMS SUBJECT TO A BUDGET CONSTRAINT WITH ECONOMIES OF SCALE
    HILLESTAD, RJ
    OPERATIONS RESEARCH, 1975, 23 (06) : 1091 - 1098
  • [5] Modelization and Optimization of Multi-Type Power Generators Joint Scheduling based on Improved PSO
    Zhou, Yifan
    Hu, Wei
    Hong, Chengqiu
    Hu, Biqin
    Cheng, Tao
    2014 IEEE PES ASIA-PACIFIC POWER AND ENERGY ENGINEERING CONFERENCE (IEEE PES APPEEC), 2014,
  • [6] A dynamic auction for multi-object procurement under a hard budget constraint
    Ensthaler, Ludwig
    Giebe, Thomas
    RESEARCH POLICY, 2014, 43 (01) : 179 - 189
  • [7] An Optimal Assignment of Multi-type Weapons to Single-target
    Ma, Feng
    Ni, Mingfang
    Yu, Zhanke
    Tong, Wei
    2015 IEEE ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), 2015, : 44 - 47
  • [8] Electricity-carbon Joint Distributed Trading for Multi-type Buildings Based on Distributional Robust Chance Constraint
    Sun G.
    Chen X.
    Zhou Y.
    Chen S.
    Wei Z.
    Wang S.
    Dianwang Jishu/Power System Technology, 2023, 47 (08): : 3078 - 3087
  • [9] Joint Optimization of Multi-type Caching Placement and Multi-user Computation Offloading for Vehicular Edge Computing
    Cao, Dun
    Wang, Yubin
    Yang, Yifan
    He, Shiming
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 5593 - 5598
  • [10] On solving multi-type railway line planning problems
    Goossens, JW
    van Hoesel, S
    Kroon, L
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 168 (02) : 403 - 424