Profit intensity criterion for transportation problems

被引:8
作者
Voynarenko, M. [1 ]
Kholodenko, A. [2 ]
机构
[1] Khmelnytsky Natl Univ, Dept Accounting Audit & Taxat, Khmelnytsky, Ukraine
[2] Odesa Natl Maritime Univ, Dept Business & Tourism, Odesa, Ukraine
来源
GLOBAL JOURNAL OF ENVIRONMENTAL SCIENCE AND MANAGEMENT-GJESM | 2019年 / 5卷
关键词
Financial and Time Factors; Nonlinear Generalization; Profit Intensity Criterion; Solution Algorithm; Transportation Problem; ALGORITHM;
D O I
10.22034/gjesm.2019.SI.15
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of solution of such transportation problem is constructed. It is shown that the choice is carried out among Pareto-optimal options, moreover the factor of time becomes defining for the high income from transportation, and the factor of expenses - at low ones. Not absolute but relative changes of numerator and denominator become important when the criterion represents the fraction (in this case - the profit intensity as the ratio of profit to time). Nonlinear generalization of such transportation problem is proposed and the scheme of its solution in a nonlinear case is outlined. Graphic illustrations of Pareto-optimal and optimal solutions of transportation problem by profit intensity criterion are also given. (C) 2019 GJESM. All rights reserved.
引用
收藏
页码:131 / 139
页数:9
相关论文
共 28 条
[1]   Approximation algorithms for the transportation problem with market choice and related models [J].
Aardal, Karen ;
Le Bodic, Pierre .
OPERATIONS RESEARCH LETTERS, 2014, 42 (08) :549-552
[2]   Explaining price differences between physical and derivative freight contracts [J].
Adland, Roar ;
Alizadeh, Amir H. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 118 :20-33
[3]  
Akilbasha A., 2018, Informatics in Medicine Unlocked, V11, P95, DOI 10.1016/j.imu.2018.04.007
[4]   A matheuristic for the two-stage fixed-charge transportation problem [J].
Calvete, Herminia, I ;
Gale, Carmen ;
Iranzo, Jose A. ;
Toth, Paolo .
COMPUTERS & OPERATIONS RESEARCH, 2018, 95 :113-122
[5]   Transportation-location problem with unknown number of facilities [J].
Carlo, Hector J. ;
David, Victor ;
Salvat-Davila, Gabriela S. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 :212-220
[6]  
Chow J.Y.J., 2018, INFORM URBAN TRANSP, P185
[7]   A branch-cut-and-price algorithm for the piecewise linear transportation problem [J].
Christensen, Tue R. L. ;
Labbe, Martine .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 245 (03) :645-655
[8]   On the transportation problem with market choice [J].
Damci-Kurt, Pelin ;
Dey, Santanu S. ;
Kucukyavuz, Simge .
DISCRETE APPLIED MATHEMATICS, 2015, 181 :54-77
[9]   Nonlinear integer transportation problem with additional supply and consumption points [J].
Esenkov, A. S. ;
Leonov, V. Yu. ;
Tizik, A. P. ;
Tsurkov, V. I. .
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2015, 54 (01) :86-92
[10]   A model for a multi-size inland container transportation problem [J].
Funke, Julia ;
Kopfer, Herbert .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 89 :70-85