A greedy algorithm for solving ordinary transportation problem with capacity constraints

被引:4
|
作者
Liu, Fang [1 ]
机构
[1] Nanyang Technol Univ, Singapore, Singapore
关键词
Transportation problem; Greedy algorithm; Duality; Supermodularity; Matroid;
D O I
10.1016/j.orl.2017.05.009
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Consider the ordinary transportation problem with the objective to minimize the cost of transporting a single commodity from M warehouses to N demand locations. Each warehouse i has a finite capacity k(i) We convert the above problem into a dual problem and construct a greedy algorithm to solve it. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:388 / 391
页数:4
相关论文
共 50 条
  • [41] Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
    Geng, Xiutang
    Chen, Zhihua
    Yang, Wei
    Shi, Deqian
    Zhao, Kai
    APPLIED SOFT COMPUTING, 2011, 11 (04) : 3680 - 3689
  • [42] A hybrid algorithm using particle swarm optimization for solving transportation problem
    Gurwinder Singh
    Amarinder Singh
    Neural Computing and Applications, 2020, 32 : 11699 - 11716
  • [43] A hybrid algorithm using particle swarm optimization for solving transportation problem
    Singh, Gurwinder
    Singh, Amarinder
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (15): : 11699 - 11716
  • [44] Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm
    Hajiaghaei-Keshteli, M.
    Aminnayeri, M.
    APPLIED SOFT COMPUTING, 2014, 25 : 184 - 203
  • [45] SOLVING FOUR-INDEX TRANSPORTATION PROBLEM WITH THE USE OF A GENETIC ALGORITHM
    Skitsko, Volodymyr
    Voinikov, Mykola
    LOGFORUM, 2020, 16 (03) : 397 - 408
  • [46] Solving bicriteria solid transportation problem with fuzzy numbers by a genetic algorithm
    Gen, Mitsuo
    Ida, Kenichi
    Li, Yinzhen
    Kubota, Erika
    Computers and Industrial Engineering, 1995, 29 (1-4): : 537 - 541
  • [47] Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm
    Hajiaghaei-Keshteli, M.
    Aminnayeri, M.
    Applied Soft Computing Journal, 2014, 25 (01): : 184 - 203
  • [48] SOLVING BICRITERIA SOLID TRANSPORTATION PROBLEM WITH FUZZY NUMBERS BY A GENETIC ALGORITHM
    GEN, M
    IDA, K
    LI, YZ
    KUBOTA, E
    COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 29 : 537 - 541
  • [49] SOLVING THE MINIMUM INDEPENDENT DOMINATION SET PROBLEM IN GRAPHS BY EXACT ALGORITHM AND GREEDY HEURISTIC
    Laforest, Christian
    Phan, Raksmey
    RAIRO-OPERATIONS RESEARCH, 2013, 47 (03) : 199 - 221
  • [50] A PBIL Algorithm for Solving 0-1 Knapsack Problem Based on Greedy Strategy
    Fang, Xiaoping
    Chen, Niansheng
    Guo, Yu
    PROCEEDINGS OF THE 2013 ASIA-PACIFIC COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY CONFERENCE, 2013, : 664 - 672