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 条
  • [31] Multi-objective fully intuitionistic fuzzy fixed-charge solid transportation problem
    Ghosh, Shyamali
    Roy, Sankar Kumar
    Ebrahimnejad, Ali
    Verdegay, Jose Luis
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (02) : 1009 - 1023
  • [32] Fixed-Charge Transportation on a Path: Linear Programming Formulations
    Van Vyve, Mathieu
    INTEGER PROGRAMMING AND COMBINATORAL OPTIMIZATION, IPCO 2011, 2011, 6655 : 417 - 429
  • [33] A fast and simple branching algorithm for solving small scale fixed-charge transportation problem
    Kowalski, Krzysztof
    Lev, Benjamin
    Shen, Wenjing
    Tu, Yan
    OPERATIONS RESEARCH PERSPECTIVES, 2014, 1 (01) : 1 - 5
  • [34] Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm
    Pop, Petrica C.
    Sabo, Cosmin
    Biesinger, Benjamin
    Hu, Bin
    Raid, Guenther R.
    CARPATHIAN JOURNAL OF MATHEMATICS, 2017, 33 (03) : 365 - 371
  • [35] Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm
    Gurwinder Singh
    Amarinder Singh
    International Journal of System Assurance Engineering and Management, 2021, 12 : 1073 - 1086
  • [36] Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
    Simon Görtz
    Andreas Klose
    Journal of Heuristics, 2009, 15 : 331 - 349
  • [37] Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm
    Singh, Gurwinder
    Singh, Amarinder
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2021, 12 (06) : 1073 - 1086
  • [38] A preferable-interval method to the single-sink fixed-charge transportation problem
    Lin, Runchange
    Wang, Haibo
    Alidaee, Bahram
    Kochenberger, Gary
    International Conference on Management Innovation, Vols 1 and 2, 2007, : 46 - 51
  • [39] Near Optimal Solution for the Step Fixed Charge Transportation Problem
    Altassan, Khalid M.
    El-Sherbiny, Mahmoud M.
    Sasidhar, Bokkasam
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2013, 7 (02): : 661 - 669
  • [40] 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