Optimization of VAM as Pattern – Connected Edge Weighed Graph
Main Article Content
Abstract
The main objective of this approach is to find the optimal cost of the transportation grid in Balanced and unbalanced ways of the TPM derived from the edge weighted connected non-complete graph. The proposed approach of this article is in a particular path representation of the given transportation problem to ensure the Optimal Basic Feasible Solution by Vogel’s Approximation Method for the derived TPM from the edge weighted connected non-complete graph. Optimal Basic Feasible Solution is also provided with the existed methods in operation research field with particular pattern at some extent
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
