An iterative solution technique for capacitated two-stage time minimization transportation problem

4OR ◽  
2021 ◽  
Author(s):  
Fanrong Xie ◽  
Zuoan Li
Keyword(s):  
Transportation Problem ◽  
Iterative Solution ◽  
Solution Technique ◽  
Two Stage ◽  
Time Minimization

An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions

2020 ◽  
Vol 37 (05) ◽  
pp. 2050024 ◽  
Author(s):  
Fanrong Xie ◽  
Zuoan Li
Keyword(s):  
Transportation Problem ◽  
Cost Minimization ◽  
Unit Cost ◽  
Iterative Algorithms ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Maximum Flow ◽  
Iterative Solution ◽  
Solution Technique ◽  
Capacitated Transportation Problem

The average transportation cost minimization of capacitated transportation problem with bounds on rim conditions (CTPBRC) is an important optimization problem due to the requirement of low unit cost consumption in production system. In the literature, there is only one approach to solving a special case of this problem, but it is not applicable to the general case. In this paper, this problem is reduced to a series of finding the minimum cost maximum flow in a network with lower and upper arc capacities, and two iterative algorithms are proposed as more generalized solution method for this problem as compared to the existing approach. Computational experiments on randomly generated instances validate that the two iterative algorithms are generally able to find the minimum average transportation cost solution to CTPBRC efficiently for the general case, in which one iterative algorithm has higher efficiency than the other for large size instances.

CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM

2010 ◽  
Vol 27 (04) ◽  
pp. 457-476 ◽  
Author(s):  
VIKAS SHARMA ◽  
KALPANA DAHIYA ◽  
VANITA VERMA
Keyword(s):  
Upper Bound ◽  
Transportation Problem ◽  
Current Problem ◽  
Two Stage ◽  
Minimum Requirement ◽  
Second Stage ◽  
Homogeneous Product ◽  
Time Minimization ◽  
Two Stages

A capacitated two-stage time minimization transportation problem is considered in this paper, in which the total availability of a homogeneous product at various sources is more than the total requirement of the same at destinations. Unlike the conventional imbalanced time minimization transportation problem, in the current problem, transportation takes place in two stages such that the minimum requirement of the destinations is satisfied in the first stage and the surplus amount is transported in the second stage. Each time the transportation from sources to destinations is done in parallel and the capacity on each route (source destination link) remains fixed, i.e., the total amount transported in both the stages cannot exceed its upper bound. In each stage, the objective is to minimize the shipment time and the overall goal is to find a solution that minimizes the sum of first and second stage times.

Capacitated two-stage time minimization transportation problem with restricted flow

2017 ◽  
Vol 51 (2) ◽  
pp. 447-467 ◽  
Author(s):  
Prabhjot Kaur ◽  
Vanita Verma ◽  
Kalpana Dahiya
Keyword(s):  
Transportation Problem ◽  
Two Stage ◽  
Time Minimization

scholarly journals A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem

2016 ◽  
Vol 32 (2) ◽  
pp. 225-232
Author(s):  
PETRICA POP ◽  
◽  
OLIVIU MATEI ◽  
CORINA POP SITAR ◽  
IOANA ZELINA ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Transportation Problem ◽  
Hash Table ◽  
Fixed Charge ◽  
Two Stage ◽  
Hybrid Heuristic ◽  
Fixed Charge Transportation Problem ◽  
Hybrid Heuristic Algorithm ◽  
Benchmark Instances ◽  
Local Search Procedure

This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The proposed algorithm was implemented and tested on an often used collection of benchmark instances and the computational results obtained showed that our proposed hybrid heuristic algorithm delivered competitive results compared to the state-of-the-art algorithms for solving the considered capacitated two-stage fixed-charge transportation problem.

Multiobjective Transportation Problem Using Fuzzy Decision Variable Through Multi-Choice Programming

2017 ◽  
Vol 8 (3) ◽  
pp. 82-96 ◽  
Author(s):  
Gurupada Maity ◽  
Sankar Kumar Roy
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Real Variable ◽  
Programming Approach ◽  
Solution Technique ◽  
Decision Variable ◽  
Fuzzy Decision ◽  
Fuzzy Goal ◽  
Fuzzy Transportation Problem ◽  
New Formulation

This paper analyzes the study of Multiobjective Transportation Problem (MOTP) under the consideration of fuzzy decision variable. Usually, the decision variable in a Transportation Problem is taken as real variable. But, in this paper, the decision variable in each node is selected from a set of multi-choice fuzzy numbers. Inclusion of multiple objectives into transportation problem with fuzzy decision variable makes it a Multiobjective Fuzzy Transportation Problem (MOFTP). In this paper, a new formulation of mathematical model of MOFTP with fuzzy goal of each objective function is enlisted. Thereafter the solution technique of the formulated model is described through multi-choice goal programming approach. Finally, a numerical example is presented to show the feasibility and usefulness of this article.

Sign in / Sign up

Export Citation Format

Share Document