A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff

Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2018, Vol 14, Issue 2

Abstract

In this paper, an algorithm for solving interval time-cost tradeoff transportation problemsis presented. In this problem, all the demands are defined as intervalto determine more realistic duration and cost. Mathematical methods can be used to convert the time-cost tradeoff problems to linear programming, integer programming, dynamic programming, goal programming or multi-objective linear programming problems for determining the optimum duration and cost. Using this approach, the algorithm is developed converting interval time-cost tradeoff transportation problem to the linear programming problem by taking into consideration of decision maker (DM).

Authors and Affiliations

Inci Albayrak, Mustafa Sivri, Gizem Temelcan

Keywords

Related Articles

An Introduction to Fuzzy Edge Coloring

In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same c...

SOME NEW PROPERTIES ON TOPOLOGICAL SPACES

In this journey, we are going to explore the  separation axioms in greater detail. Separation axioms are one among the most common, important and interesting concepts in Topology. They can be used to define more re...

Solutions and comparison theorems for anticipated backward stochastic differential equations with non-Lipschitz generators

This paper is devoted to solving multidimensional anticipated backward stochastic differential equations (anticipated BSDEs for short) with a kind of non-Lipschitz generators. We establish the existence and uniqueness re...

Strongly Coretractable Modules And Some Related Concepts

Let R be a ring with identity and M be an R-module with unite . The module M is called strongly coretractable module if for each proper submodule N of M , there exists a nonzero R-homomorphism f:M/N→M  such that Imf+N...

FIXED POINTS IN MENGER SPACE FOR WEAK COMPATIBLE MAPPINGS

The purpose of this paper is to establish a unique common fixed point theorem for six self mappings using the concept of weak compatibility in Menger space which is an alternate result of Jain and Singh [5]. We also cite...

Download PDF file
  • EP ID EP651815
  • DOI 10.24297/jam.v14i2.7417
  • Views 155
  • Downloads 0

How To Cite

Inci Albayrak, Mustafa Sivri, Gizem Temelcan (2018). A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff. JOURNAL OF ADVANCES IN MATHEMATICS, 14(2), 7691-7701. https://europub.co.uk/articles/-A-651815