On step fixed-charge transportation problem

被引:34
|
作者
Kowalski, Krzysztof [2 ]
Lev, Benjamin [1 ]
机构
[1] Univ Michigan, Sch Management, Dearborn, MI 48126 USA
[2] Wesleyan Univ, Connecticut Dept Transportat, Middletown, CT 06457 USA
来源
关键词
fixed charge; transportation problem; heuristic algorithin;
D O I
10.1016/j.omega.2007.11.001
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The fixed-charge problem is a nonlinear programming problem of practical interest in business and industry. One of its variations is the fixed-charge transportation problem (FCTP) where fixed cost is incurred for every route that is used in the solution, along with the variable cost that is proportional to the amount shipped. That cost structure causes the value of the objective function Z to also behave like a step function. Each time we open or close a route the objective function jumps a step. The step fixed-charge transportation problem (SFCTP) is a variation of the FCTP where the fixed cost is in the form of a step function dependent on the load in a given route. While the value of the objective function Z in the FCTP is a step function, the introduction of the step fixed cost in the SFCTP results in the objective function Z being itself a step function with many more steps. Fixed-charge problems are usually solved using sophisticated analytical or computer software. This paper discusses the theory of SFCTP and presents a computationally simple heuristic algorithm for solving small SFCTPs. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:913 / 917
页数:5
相关论文
共 50 条
  • [1] On the fixed-charge transportation problem
    Adlakha, V
    Kowalski, K
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (03): : 381 - 388
  • [2] Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
    Masoud Sanei
    Ali Mahmoodirad
    Sadegh Niroomand
    Ali Jamalian
    Shahin Gelareh
    Computational and Applied Mathematics, 2017, 36 : 1217 - 1237
  • [3] Heuristic algorithms for the fixed-charge transportation problem
    Veena Adlakha
    Krzysztof Kowalski
    R. R. Vemuganti
    OPSEARCH, 2006, 43 (2) : 132 - 151
  • [4] Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
    Sanei, Masoud
    Mahmoodirad, Ali
    Niroomand, Sadegh
    Jamalian, Ali
    Gelareh, Shahin
    COMPUTATIONAL & APPLIED MATHEMATICS, 2017, 36 (03): : 1217 - 1237
  • [5] EXACT SOLUTION OF FIXED-CHARGE TRANSPORTATION PROBLEM
    GRAY, P
    OPERATIONS RESEARCH, 1971, 19 (06) : 1529 - &
  • [6] A VERTEX RANKING ALGORITHM FOR THE FIXED-CHARGE TRANSPORTATION PROBLEM
    SADAGOPAN, S
    RAVINDRAN, A
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1982, 37 (02) : 221 - 230
  • [7] Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
    Agarwal, Yogesh
    Aneja, Yash
    OPERATIONS RESEARCH, 2012, 60 (03) : 638 - 654
  • [8] GROUP-THEORETIC STRUCTURE IN FIXED-CHARGE TRANSPORTATION PROBLEM
    KENNINGTON, JL
    UNGER, VE
    OPERATIONS RESEARCH, 1973, 21 (05) : 1142 - 1153
  • [9] An improved hybrid algorithm for capacitated fixed-charge transportation problem
    Pintea, Camelia-M.
    Pop, Petrica C.
    LOGIC JOURNAL OF THE IGPL, 2015, 23 (03) : 369 - 378
  • [10] A matheuristic for the two-stage fixed-charge transportation problem
    Calvete, Herminia, I
    Gale, Carmen
    Iranzo, Jose A.
    Toth, Paolo
    COMPUTERS & OPERATIONS RESEARCH, 2018, 95 : 113 - 122