Profit intensity criterion for transportation problems

نویسندگان

  • A. Kholodenko Department of Business and Tourism, Odesa National Maritime University, Odesa, Ukraine
  • M. Voynarenko Department of Accounting, Audit and Taxation, Khmelnytsky National University, Khmelnytsky, Ukraine
چکیده مقاله:

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 the solution of such a 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). A 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. 

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Water intensity of transportation.

As the need for alternative transportation fuels increases, it is important to understand the many effects of introducing fuels based upon feedstocks other than petroleum. Water intensity in "gallons of water per mile traveled" is one method to measure these effects on the consumer level. In this paper we investigate the water intensity for light duty vehicle (LDV) travel using selected fuels b...

متن کامل

Revenue Management for Transportation Problems

In this paper, we consider the problem of managing a fleet of trucks with different capacity to serve the requests of different customers that arise randomly over time. Customers make a request by demanding the transportation of a given quantity of goods from an origin to a destination, at a given time. It is well known that these problems arise in the dynamic resource allocation context, where...

متن کامل

A Criterion for Talagrand’s Quadratic Transportation Cost Inequality

Abstract. We show that the quadratic transportation cost inequality T2 is equivalent to both a Poincaré inequality and a strong form of the Gaussian concentration property. The main ingredient in the proof is a new family of inequalities, called modified quadratic transportation cost inequalities in the spirit of the modified logarithmic-Sobolev inequalities by Bobkov and Ledoux [6], that are s...

متن کامل

Half-quadratic transportation problems

We present a primal–dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of weighted quadratic transportation problems. The new formulation allows us to solve differentiable, non– convex transportation problems.

متن کامل

Iterative Bregman Projections for Regularized Transportation Problems

This article details a general numerical framework to approximate solutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman divergence projection of a vector (representing some initial joint distribution) on the polytope of constraints. W...

متن کامل

Optimal Networks for Mass Transportation Problems

In the framework of transport theory, we are interested in the following optimization problem: given the distributions μ of working people and μ− of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined a...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 5  شماره Special Issue

صفحات  131- 140

تاریخ انتشار 2019-08-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023