Abstract During past few decades, fuzzy decision is an important attention in the areas of science, engineering, economic system, business, etc. To solve day-to-day problem, researchers use data transportation problem for presenting uncontrollable factors; and most multi-objective problems are solved using goal programming. However, when contains interval-valued data, then obtained solution was...

A basic model of the task of assigning classes to professors, in such a way that the average number of distinct subjects assigned to each professor is minimized, is formulated as a mixed integer program. It turns out that the problem is a special case of the fixed charge transportation problem which in some cases corresponds to finding a basic solution of a transportation problem which is as de...

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been prop...

The Fixed Charge Transportation Problem (FCTP) is a generalization of the well-known Transportation Problem, where the cost for sending goods from origins to destinations is composed of a fixed cost and a continuous cost proportional to the amount of goods sent. In practical applications, the fixed costs may represent toll charges on highways, landing fees at airports, setup costs in production...

This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed meth...

The fixed-charge transportation problem is a fixed-charge network flow problem on a bipartite graph. This problem appears as a subproblem in many hard transportation problems, and is also both a special case and a strong relaxation of the challenging bigbucket multi-item lot-sizing problem. In this paper, we provide a polyhedral analysis of the polynomially solvable special case in which the as...

—Competitive global markets oblige the firms to reduce their overall costs while maintaining the same customer service level and this can be achieved just through a precise and efficient management of their supply chain network. The Fixed Charge Transportation Problem (FCTP) which is a more comprehensive type of Transportation Problem (TP) has several applications from different aspects in this...

Given a directed network, the uncapacitated fixed-charge network flow problem is to find a minimum-cost arc combination that provides flows from the supply nodes to the demand nodes. Associated with all arcs are two costs: the fixed charge of using the arc and the variable cost depending on the amount of flow the arc actually carries. This generic model has applications for problems of distribu...