The pure fixed charge transportation problem is reformulated into an equivalent set covering problem with, in general, a large number of constraints. Two constraint generation procedures for its solution are suggested; in both of these, new constraints are generated by the solution of ordinary maximum flow problems. In the first procedure, which is an optimizing Benders-type scheme, each set co...

In this paper, the fixed charge solid transportation problem under uncertainty is investigated. As a result, three mathematical models are constructed for the problem, i.e., expected value model, chanceconstrained programming model and measure-chance programming model, where the supplies, demands, conveyance capacities, direct costs and fixed charges are regarded as uncertain variables. After t...

The fixed-charge transportation problem is an interesting problem in its own right. This paper further motivates its study by showing that it is both a special case and a strong relaxation of the big-bucket multi-item lot-sizing problem. We then provide a polyhedral analysis of the polynomially solvable special case in which the associated bipartite graph is a path. We give a O(n 3)-time optimi...

In this technical report, we study the multiple-sink fixed-charge transportation problem (MSFCTP), which arises frequently in application areas of scheduling and cost control, such as facility planning, capital budgeting, resource allocation, buffer allocation, pollution control, etc. The MSFCTP problem involves the distribution from a set of supply centers (sources) to a set of demand centers ...

0360-8352/$ see front matter 2012 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.cie.2012.12.001 q This manuscript was processed by Area Editor Iris F.A. Vis. ⇑ Corresponding author. Current address: Operations Research Dept., Institute of Statistical Studies and Research (ISSR), Cairo University, Egypt. Tel.: +2

In this contribution, for the first time, an efficient model of multi-objective product blending fixed-charge transportation problem with truck load constraints through transfer station is formulated. Transfer inserts cost and type-I fixed-charge. Our aim to analyze extra that treats as type-II in designed required when amount items exceeds capacity vehicle fulfilling shipment by more than one ...

This paper presents two variants of genetic algorithm for solving the Supply Management Problem, which can be viewed as a generalization of the Fixed Charge Transportation Problem. The first variant uses the usual binary representation of solutions. The second one is based on the permutation representation and the greedy decoder. Computational results indicate good performance of the second app...