Modifications of the Two-Stage Transportation Problem and Their Applications

被引：2
|
作者：
Stetsyuk, P., I [1 ]
Stovba, V. O. [1 ]
Tregubenko, S. S. [2 ]
Khomiak, O. M. [1 ]
机构：
[1] Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
[2] Cent Sci Res Inst Armed Forces Ukraine, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2022年 / 58卷 / 06期
关键词：
two-stage transportation problem; linear programming problem; Boolean linear programming problem; AMPL; Gurobi; CPLEX; optimal set partition; p-median; k-means; material and technical support;
D O I：
10.1007/s10559-023-00523-z
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Mathematical models of linear and Boolean linear programming for the balanced two-stage transportation problem and its two modifications are analyzed. The first modification takes into account the upper limits on the capacity of intermediate points, and the second modification allows choosing a fixed number of intermediate points, less than their total number. For all the cases, the necessary and sufficient conditions for the consistency of the systems of linear constraints of the corresponding mathematical programming problems are justified. Examples of applying the modifications for the optimal set partitioning, the p-median graph problem, and the problem of optimal arrangement of a given number of storages are considered. The results of the computing experiments using the Gurobi and CPLEX solvers and the AMPL modeling language are presented.
引用
收藏
页码：898 / 913
页数：16
相关论文
共 50 条
  • [21] A Mathematical Model for a Multi-Commodity, Two-Stage Transportation and Inventory Problem
    Ji, P.
    Chen, K. J.
    Yan, Q. P.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2008, 15 (03): : 278 - 285
  • [22] An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
    Kaur, Supinder
    Jain, Ekta
    Sharma, Anuj
    Dahiya, Kalpana
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (04) : 2733 - 2766
  • [23] An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs
    Cosma, Ovidiu
    Pop, Petrica
    Zelina, Ioana
    14TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS (SOCO 2019), 2020, 950 : 523 - 532
  • [24] Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
    Miskovic, Stefan
    Stanimirovic, Zorica
    Grujicic, Igor
    OPTIMIZATION LETTERS, 2017, 11 (06) : 1169 - 1184
  • [25] A genetic algorithm for two-stage transportation problem using priority-based encoding
    Gen, Mitsuo
    Altiparmak, Fulya
    Lin, Lin
    OR SPECTRUM, 2006, 28 (03) : 337 - 354
  • [26] A TWO-STAGE GENETIC ALGORITHM FOR SOLVING THE TRANSPORTATION PROBLEM WITH FUZZY DEMANDS AND FUZZY SUPPLIES
    Lin, Feng-Tse
    Tsai, Tzong-Ru
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (12B): : 4775 - 4785
  • [27] 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
  • [28] Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
    Stefan Mišković
    Zorica Stanimirović
    Igor Grujičić
    Optimization Letters, 2017, 11 : 1169 - 1184
  • [29] A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
    Cosma, Ovidiu
    Pop, Petrica C.
    Danciulescu, Daniela
    COMPUTERS & OPERATIONS RESEARCH, 2020, 118 (118)
  • [30] A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem
    Raj, K. Antony Arokia Durai
    Rajendran, Chandrasekharan
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2016 - 2032
12345