Sustainable multi-commodity capacitated facility location problem with complementarity demand functions

被引:13
|
作者
Liu, Weiwei [1 ]
Kong, Nan [2 ]
Wang, Mingzheng [3 ]
Zhang, Lingling [1 ]
机构
[1] Dalian Univ Technol, Sch Econ & Management, Dalian 116024, Peoples R China
[2] Purdue Univ, Weldon Sch Biomed Engn, W Lafayette, IN 47907 USA
[3] Zhejiang Univ, Sch Management, Hangzhou 310058, Peoples R China
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Facility location; Multi-commodity; Carbon emission; Complementarity demand function; Mixed-integer quadratic program; MIXED-INTEGER MODELS; MULTIPRODUCT PRICE; BOUND ALGORITHM; NETWORK DESIGN; INVENTORY; GREEN; COMPETITION;
D O I
10.1016/j.tre.2020.102165
中图分类号
F [经济];
学科分类号
02 ;
摘要
We investigate a multi-commodity capacitated facility location problem involving sustainability concerns (e.g., restrained carbon emission). In addition, this problem incorporates a complementarity demand function. We show that this incorporation can lead to superior decisions both analytically and computationally. The resultant formulation is a 0-1 mixed-integer non-concave quadratic program with equilibrium constraints. We adopt the piecewise-linear envelope method to transform the formulation into a 0-1 mixed-integer concave program. We then propose an efficient branch-and-refine algorithm with global convergence. Numerical examples demonstrate the effect of carbon emission limit and carbon trading on company decisions.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] An algorithm for the capacitated, multi-commodity multi-period facility location problem
    Canel, C
    Khumawala, BM
    Law, J
    Loh, A
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (05) : 411 - 427
  • [2] The Online Multi-Commodity Facility Location Problem
    Castenow, Jannik
    Feldkord, Bjoern
    Knollmann, Till
    Malatyali, Manuel
    der Heide, Friedhelm Meyer auf
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 129 - 139
  • [3] A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution
    Pirkul, H
    Jayaraman, V
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (10) : 869 - 878
  • [4] The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals
    Akyuz, M. Hakan
    Oncan, Temel
    Altinel, I. Kuban
    IIE TRANSACTIONS, 2010, 42 (11) : 825 - 841
  • [5] A Beam Search Heuristic for the Multi-commodity Capacitated Multi-facility Weber Problem
    Oncan, Temel
    Akyuz, M. Hakan
    Altinel, I. Kuban
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II, 2012, : 1617 - 1622
  • [6] The Multi-commodity Capacitated Multi-facility Weber Problem: Heuristics and Confidence Intervals
    Akyuez, M. Hakan
    Oencan, Temel
    Altinel, I. Kuban
    IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2009, : 2042 - +
  • [7] Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
    Akyuz, M. Hakan
    Oncan, Temel
    Altinel, I. Kuban
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 225 - 237
  • [8] Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
    Akyuz, M. Hakan
    Oncan, Temel
    Altinel, I. Kuban
    ANNALS OF OPERATIONS RESEARCH, 2019, 279 (1-2) : 1 - 42
  • [9] Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
    M. Hakan Akyüz
    Temel Öncan
    İ. Kuban Altınel
    Annals of Operations Research, 2019, 279 : 1 - 42
  • [10] THE MULTI-COMMODITY FACILITIES LOCATION PROBLEM
    KARKAZIS, J
    BOFFEY, TB
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1981, 32 (09) : 803 - 814