Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm

被引:2
|
作者
Ranjan Bhattacharya
Susmita Bandyopadhyay
机构
[1] Jadavpur University,Department of Production Engineering
[2] West Bengal University of Technology,Department of Industrial Engineering and Management
关键词
Supply chain; Facility location; Multi-objective evolutionary algorithm (MOEA); Non-dominated sorting algorithm (NSGA II); Crowding distance;
D O I
暂无
中图分类号
学科分类号
摘要
This paper focuses on the facility location problem with two conflicting objectives. We observe that minimization of the total cost of a particular echelon may lead to the increase in the total cost of a supply chain as a whole. Thus, these conflicting objectives are required to be met together from a supply chain perspective. We have solved the problem formulated in mixed nonlinear programming by a multi-objective evolutionary algorithm (MOEA) known as non-dominated sorting algorithm, or NSGA II in short. Numerical example is provided to show the effect of the algorithm on the solution.
引用
下载
收藏
页码:397 / 414
页数:17
相关论文
共 50 条
  • [1] Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm
    Bhattacharya, Ranjan
    Bandyopadhyay, Susmita
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 51 (1-4): : 397 - 414
  • [2] A bi-objective uncapacitated facility location problem
    Myung, YS
    Kim, HG
    Tcha, DW
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (03) : 608 - 616
  • [3] A simulated annealing algorithm for solving the bi-objective facility layout problem
    Sahin, Ramazan
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) : 4460 - 4465
  • [4] A Cultural Algorithm Applied in a Bi-Objective Uncapacitated Facility Location Problem
    Cabrera, Guillermo
    Miguel Rubio, Jose
    Diaz, Daniela
    Fernandez, Boris
    Cubillos, Claudio
    Soto, Ricardo
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2011, 6576 : 477 - 491
  • [5] A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
    Karasakal, Esra
    Silav, Ahmet
    TOP, 2016, 24 (01) : 206 - 232
  • [6] A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
    Esra Karasakal
    Ahmet Silav
    TOP, 2016, 24 : 206 - 232
  • [7] A novel hybrid epsilon-constraint and NSGA-II method for bi-objective restructuring hierarchical facility location problem
    Yavari, Mohammad
    Mousavi-Saleh, Mohammad
    Jabbarzadeh, Armin
    JOURNAL OF ADVANCES IN MANAGEMENT RESEARCH, 2024,
  • [8] Modeling and solving a bi-objective joint replenishment-location problem under incremental discount: MOHSA and NSGA-II
    Seyed Hamid Reza Pasandideh
    Seyed Taghi Akhavan Niaki
    Reza Abdollahi
    Operational Research, 2020, 20 : 2365 - 2396
  • [9] Modeling and solving a bi-objective joint replenishment-location problem under incremental discount: MOHSA and NSGA-II
    Pasandideh, Seyed Hamid Reza
    Niaki, Seyed Taghi Akhavan
    Abdollahi, Reza
    OPERATIONAL RESEARCH, 2020, 20 (04) : 2365 - 2396
  • [10] A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
    Parragh, Sophie N.
    Tricoire, Fabien
    Gutjahr, Walter J.
    OR SPECTRUM, 2022, 44 (02) : 419 - 459