Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
A Two-Phase Method for Solving Transportation Models with Prohibited Routes
This article is published by Pakistan Journal of Statistics and Operation Research 2022 and is also available at http://dx.doi.org/10.18187/pjsor.v18i3.3911
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pakistan Journal of Statistics and Operation Research
2024
|
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613134030635008 |
|---|---|
| access_status_str | Open Access |
| author | Owusu-Ansah, Emmanuel Ackora-Prah, Joseph Acheson, Valentine Barnes, Benedict Takyi, Ishmael |
| author_browse | Acheson, Valentine Ackora-Prah, Joseph Barnes, Benedict Owusu-Ansah, Emmanuel Takyi, Ishmael |
| author_facet | Owusu-Ansah, Emmanuel Ackora-Prah, Joseph Acheson, Valentine Barnes, Benedict Takyi, Ishmael |
| author_sort | Owusu-Ansah, Emmanuel |
| collection | Thesis |
| description | This article is published by Pakistan Journal of Statistics and Operation Research 2022 and is also available at http://dx.doi.org/10.18187/pjsor.v18i3.3911 |
| format | Article |
| id | oai:ir.knust.edu.gh:123456789/16028 |
| institution | KNUST (Ghana) |
| language | English |
| last_indexed | 2026-06-10T12:31:18.486Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from KNUSTSpace — Kwame Nkrumah University of Science & Technology (Ghana) |
| publishDate | 2024 |
| publishDateRange | 2024 |
| publishDateSort | 2024 |
| publisher | Pakistan Journal of Statistics and Operation Research |
| publisherStr | Pakistan Journal of Statistics and Operation Research |
| record_format | dspace |
| source_str | KNUSTSpace — Kwame Nkrumah University of Science & Technology (Ghana) |
| spelling | oai:ir.knust.edu.gh:123456789/16028 A Two-Phase Method for Solving Transportation Models with Prohibited Routes Owusu-Ansah, Emmanuel Ackora-Prah, Joseph Acheson, Valentine Barnes, Benedict Takyi, Ishmael This article is published by Pakistan Journal of Statistics and Operation Research 2022 and is also available at http://dx.doi.org/10.18187/pjsor.v18i3.3911 The Transportation Problem (TP) is a mathematical optimization technique which regulates the flow of items along routes by adopting an optimum guiding principle to the total shipping cost. However, instances including road hazards, traffic regulations, road construction and unexpected floods sometimes arise in transportation to ban shipments via certain routes. In formulating the TPs, potential prohibited routes are assigned a large penalty cost, M; to prevent their presence in the model solution. The arbitrary usage of the big M as a remedy for this interdiction does not go well with a good solution. In this paper, a two-phase method is proposed to solve a TP with prohibited routes. The first phase is formulated as an All-Pairs Least Cost Problem (APLCP) which assigns respectively a non-discretionary penalty costM? ij M to each of n prohibited routes present using the Floyd’s method. At phase two, the new penalty values are substituted into the original problem respectively and the resulting model is solved using the transportation algorithm. The results show that, setting this modified penalty cost (M?) logically presents a good solution. Therefore, the discretionary usage of the M 1 is not a guarantee for good model solutions. The modified cost M? M so attained in the sample model, is relatively less than the Big M( 1) and gives a good solution which makes the method reliable. KNUST 2024-12-04T11:11:08Z 2024-12-04T11:11:08Z 2022 Article Pak.j.stat.oper.res. Vol.18 No.3 2022 pp 749-758 http://dx.doi.org/10.18187/pjsor.v18i3.3911 https://ir.knust.edu.gh/handle/123456789/16028 en application/pdf Pakistan Journal of Statistics and Operation Research |
| spellingShingle | Owusu-Ansah, Emmanuel Ackora-Prah, Joseph Acheson, Valentine Barnes, Benedict Takyi, Ishmael A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title | A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title_full | A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title_fullStr | A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title_full_unstemmed | A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title_short | A Two-Phase Method for Solving Transportation Models with Prohibited Routes |
| title_sort | two phase method for solving transportation models with prohibited routes |
| url | http://dx.doi.org/10.18187/pjsor.v18i3.3911 https://ir.knust.edu.gh/handle/123456789/16028 |
| work_keys_str_mv | AT owusuansahemmanuel atwophasemethodforsolvingtransportationmodelswithprohibitedroutes AT ackoraprahjoseph atwophasemethodforsolvingtransportationmodelswithprohibitedroutes AT achesonvalentine atwophasemethodforsolvingtransportationmodelswithprohibitedroutes AT barnesbenedict atwophasemethodforsolvingtransportationmodelswithprohibitedroutes AT takyiishmael atwophasemethodforsolvingtransportationmodelswithprohibitedroutes AT owusuansahemmanuel twophasemethodforsolvingtransportationmodelswithprohibitedroutes AT ackoraprahjoseph twophasemethodforsolvingtransportationmodelswithprohibitedroutes AT achesonvalentine twophasemethodforsolvingtransportationmodelswithprohibitedroutes AT barnesbenedict twophasemethodforsolvingtransportationmodelswithprohibitedroutes AT takyiishmael twophasemethodforsolvingtransportationmodelswithprohibitedroutes |