An algorithm employing the branch-and-bound method to search for pareto solutions of Bi-objective NVP system design problems

被引:0
|
作者
Yamachi, Hidemi [1 ,2 ]
Yamamoto, Hisashi [1 ]
Tsujimura, Yasuhiro [2 ]
Kamba Yashi, Yasushi [2 ]
机构
[1] Tokyo Metropolitan University
[2] Nippon Institute of Technology
关键词
8;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:44 / 53
相关论文
共 37 条
  • [21] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Asmaa Khoudi
    Ali Berrichi
    Operational Research, 2020, 20 : 1763 - 1789
  • [22] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Khoudi, Asmaa
    Berrichi, Ali
    OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
  • [23] An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization
    Ho-Huu, V.
    Hartjes, S.
    Visser, H. G.
    Curran, R.
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 92 : 430 - 446
  • [24] Risk quantification of fatigue-induced sequential failures by Branch-and-Bound method employing system reliability bounds
    Lee, Y. -J.
    Song, J.
    APPLICATIONS OF STATISTICS AND PROBABILITY IN CIVIL ENGINEERING, 2011, : 1781 - 1789
  • [25] Risk Analysis of Fatigue-Induced Sequential Failures by Branch-and-Bound Method Employing System Reliability Bounds
    Lee, Young-Joo
    Song, Junho
    JOURNAL OF ENGINEERING MECHANICS, 2011, 137 (12) : 807 - 821
  • [26] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Carman K. M. Lee
    Danping Lin
    William Ho
    Zhang Wu
    The International Journal of Advanced Manufacturing Technology, 2011, 56 : 1105 - 1113
  • [27] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Lee, Carman K. M.
    Lin, Danping
    Ho, William
    Wu, Zhang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (9-12): : 1105 - 1113
  • [28] Clustering Method using Pareto Corner Search Evolutionary Algorithm for Objective Reduction in Many-Objective Optimization Problems
    Xuan Hung Nguyen
    Lam Thu Bui
    Cao Truong Tran
    SOICT 2019: PROCEEDINGS OF THE TENTH INTERNATIONAL SYMPOSIUM ON INFORMATION AND COMMUNICATION TECHNOLOGY, 2019, : 78 - 84
  • [29] BO-B&B: A hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems
    Yin, Ruyang
    Xing, Jiping
    Mo, Pengli
    Zheng, Nan
    Liu, Zhiyuan
    ELECTRONIC RESEARCH ARCHIVE, 2022, 30 (11): : 3993 - 4014
  • [30] A new artificial bee colony algorithm using a gradual weight method for the bi-objective traveling salesman problems
    Bouzid, Mouna
    Alaya, Ines
    Tagina, Moncef
    EVOLUTIONARY INTELLIGENCE, 2022, 15 (03) : 2077 - 2088