Modeling fixed-charge problems with polynomials

被引:3
|
作者
Lev, Benjamin [1 ]
Kowalski, Krzysztof [2 ]
机构
[1] Drexel Univ, LeBow Coll Business, Philadelphia, PA 19104 USA
[2] State Connecticut, Dept Transportat, Middletown, CT 06457 USA
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2011年 / 39卷 / 06期
关键词
Transportation problem; Fixed-charge; Polynomial modeling; TRANSPORTATION PROBLEM; SIMPLE ALGORITHM; SOLVING SMALL; NETWORKS;
D O I
10.1016/j.omega.2011.02.006
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we formulate fixed-charge problems with polynomials. Using polynomial formulations we show structural similarity between different kinds of linear and fixed charge formulations. We also show the benefits of applying polynomial formulation for finding an approximate solution for problems where no algorithms exist and in some cases for developing a method to provide direct solutions to those problems. The main benefit of this paper is better understanding of the fixed-charge function structure and better explanation of the local and global minima phenomena. We present a numerical example to illustrate applications of the proposed method. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:725 / 728
页数:4
相关论文
共 50 条
  • [21] A sequential reduction algorithm for the large-scale fixed-charge network flow problems
    Lu Yang
    Zhouwang Yang
    Optimization Letters, 2024, 18 : 1131 - 1149
  • [22] The Fixed-Charge Shortest-Path Problem
    Engineer, Faramroze G.
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    Song, Jin-Hwa
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) : 578 - 596
  • [23] Heuristic algorithms for the fixed-charge transportation problem
    Veena Adlakha
    Krzysztof Kowalski
    R. R. Vemuganti
    OPSEARCH, 2006, 43 (2) : 132 - 151
  • [24] The generalized fixed-charge network design problem
    Thomadsen, Tommy
    Stidsen, Thomas
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) : 997 - 1007
  • [26] An extreme-point tabu-search algorithm for fixed-charge network problems
    Barr, Richard S.
    Glover, Fred
    Huskinson, Toby
    Kochenberger, Gary
    NETWORKS, 2021, 77 (02) : 322 - 340
  • [28] LOT SIZING AS A FIXED-CHARGE PROBLEM.
    Bahl, Harish C.
    Zionts, Stanley
    Production and inventory management Washington, D.C., 1986, 27 (01): : 1 - 11
  • [29] Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach
    Hak-Jin Kim
    John N. Hooker
    Annals of Operations Research, 2002, 115 : 95 - 124
  • [30] Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
    Kim, HJ
    Hooker, JN
    ANNALS OF OPERATIONS RESEARCH, 2002, 115 (1-4) : 95 - 124