Yustira / AOC-IAPC-Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

An algorithm in transportation problem using Average Opportunity Cost (AOC) and Improved Average Penalty Cost (IAPC) method

2 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
Data		Data
AOC.py		AOC.py
IAPC.py		IAPC.py
README.md		README.md

Repository files navigation

AOC-IAPC-Algorithm

by: Iyas Yustira, Devi Fatmawati

References

Kamble, S. V., & Kore, B. G. (2019). A New Method to Obtain an Initial Basic Feasible Solution of Transportation Problem with the Average Opportunity Cost Method. In International Journal of Engineering and Advanced Technology (Vol. 9, Issue 2, pp. 206–209). Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP. https://doi.org/10.35940/ijeat.f9283.129219

Hossain, Munir. (2021). Improved Average Penalty Cost (IAPC) Method to Obtain Initial basic Feasible Solution of Transportation Problem. Global Journal of Science Frontier Research. 20. 23-36.

About

An algorithm in transportation problem using Average Opportunity Cost (AOC) and Improved Average Penalty Cost (IAPC) method

mathematics mathematical-modelling transportation-problem

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%