Solving Multi-Objective Transportation Problem to reduce Transportation cost and Time
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 11, Issue 1
Abstract
In this paper we study the multi-objective transportation problem for Procter & Gamble to reduce transportation cost and time of goods supply from one source to another source. To solve this problem we are using a new proposed algorithm which is different form to another existing method. This proposed method providing the support to decision makers for handling time oriented problems.
Authors and Affiliations
Gaurav sharma
Keywords
Related Articles
- EP ID EP651506
- DOI 10.24297/jam.v11i1.1291
- Views 133
- Downloads 0
Best Quadratic unbiased Estimator for Variance Component of One-Way Repeated Measurement Model
The studies of analysis of variance components is one of the important topics in mathematical statistics for this subject of wide application. In this paper given best quadratic unbiased estimator of variance components...
4D-Space-Time Geometry & Cosmological Constant
In this paper, 4-dimensional space-time geometry has been discussed. The smallness of the effective cosmological constant constitutes the most difficult problems involving cosmology. Recent observations of Type Ia supern...
Convergence Theorems of Iterative Schemes For Nonexpansive Mappings
In this paper, we give a type of iterative scheme for sequence of nonexpansive mappings and we study the strongly convergence of these schemes in real Hilbert space to common fixed point which is also a solution of a var...
Controlled 2-Frames in 2-Hilbert Spaces
Controlled frames in Hilbert spaces and 2-frames in 2-Hilbert spaces are studied, some results on them are presented. The controlled 2-frames in 2-Hilbert spaces is introduced. Some results on controlled 2-frames are est...
Branch and Bound Method to Solve Multiple Objective Function
This paper presents a branch and bound algorithm for sequencing a set of n jobs on a single machine to minimize multiobjective: total cost of flow time, maximum earliness and sum of tardy jobs, when the jobs may have une...