The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a...

The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of supplier nodes to a single demand node. Shipping costs comprise costs proportional to the amount shipped as well as a fixed charge. Although the SSFCTP is an important special case of the well known fixed-charge transportation problem, only a few methods for solving this problem...

The fixed charge (fixed cost) may present the cost of renting a vehicle, landing fees in an airport, setup cost for machines in a manufacturing environment, etc. In this paper, we discuss fixed charge capacitated in a non-linear transportation problem. Thereby, we establish local optimum condition of this problem. Next we establish an algorithm for solving this transportation problem. Also, we ...

Numerous planning models within the chemical, petroleum, and process industries involve coordinating the movement of raw materials in a distribution network so that they can be blended into final products. The uncapacitated fixed-charge transportation problem with blending (FCTPwB) studied in this paper captures a core structure encountered in many of these environments. We model the FCTPwB as ...

We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation associated to the dynamic program can be obtained from extended formulations of single-node flow polytopes. Given these results, we present a unary expansion-based...

The single-sink fixed-charge transportation problem is an important problem with applications in many areas. In this paper, a new concept of preferable interval is introduced. Properties of optimal solutions to the single-sink fixed-charge transportation problem are investigated. Solution approaches using preferable intervals are presented.