A greedy algorithm for solving ordinary transportation problem with capacity constraints

被引：4

作者：

Liu, Fang ^{[1
]}

机构：

[1] Nanyang Technol Univ, Singapore, Singapore

来源：

OPERATIONS RESEARCH LETTERS | 2017年 / 45卷 / 04期

关键词：

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 条

[31] An algorithm for solving the indefinite least squares problem with equality constraints
Mastronardi, Nicola
Van Dooren, Paul
BIT NUMERICAL MATHEMATICS, 2014, 54 (01) : 201 - 218
[32] An algorithm for solving the indefinite least squares problem with equality constraints
Nicola Mastronardi
Paul Van Dooren
BIT Numerical Mathematics, 2014, 54 : 201 - 218
[33] Solving Stochastic Fuzzy Transportation Problem with Mixed Constraints Using the Weibull Distribution
Buvaneshwari, T. K.
Anuradha, D.
JOURNAL OF MATHEMATICS, 2022, 2022
[34] A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints
Sun M.
Journal of Heuristics, 1998, 3 (4) : 305 - 326
[35] Transportation networks with capacity constraints
Scrimali, L
EQUILIBRIUM PROBLEMS AND VARIATIONAL MODELS, 2003, 68 : 433 - 445
[36] OPTIMAL TRANSPORTATION WITH CAPACITY CONSTRAINTS
Korman, Jonathan
McCann, Robert J.
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 367 (03) : 1501 - 1521
[37] Solving the Traveling Salesman Problem using Greedy Sequential Constructive Crossover in a Genetic Algorithm
Ahmed, Zakir Hussain
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2020, 20 (02): : 99 - 112
[38] Iterated Greedy Algorithm for Solving a Hybrid Flow Shop Scheduling Problem with Reentrant Jobs
Zhang, Qi
Tian, Zheng
Wang, Sen
Liu, Shixin
PROCEEDINGS OF THE 32ND 2020 CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2020), 2020, : 5636 - 5641
[39] Improved greedy genetic algorithm for solving the hybrid flow-shop scheduling problem
Song C.
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2019, 41 (05): : 1079 - 1086
[40] An Optimized Algorithm for Solving Travelling Salesman Problem Using Greedy Cross Over Operator
Jain, Vinod
Prasad, Jay Shankar
PROCEEDINGS OF THE 10TH INDIACOM - 2016 3RD INTERNATIONAL CONFERENCE ON COMPUTING FOR SUSTAINABLE GLOBAL DEVELOPMENT, 2016, : 2981 - 2984

← 1 2 3 4 5 →