z-logo
open-access-imgOpen Access
A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff
Author(s) -
İnci Albayrak,
Mustafa Sivri,
Gizem Temelcan
Publication year - 2018
Publication title -
journal of advances in mathematics
Language(s) - English
Resource type - Journals
ISSN - 2347-1921
DOI - 10.24297/jam.v14i2.7417
Subject(s) - interval (graph theory) , mathematical optimization , linear programming , duration (music) , decision maker , integer programming , transportation theory , mathematics , dynamic programming , linear fractional programming , algorithm , computer science , operations research , art , literature , combinatorics
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).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here