Enhanced supply selection for better initial basic feasible solutions in transportation problems

The Transportation Problem (TP) is an optimization model that distributes goods from multiple supply points to various demand points at minimal cost. A crucial step in solving TP is generating an Initial Basic Feasible Solution (IBFS), which affects the efficiency of reaching the optimal solution. However, existing IBFS methods such as Supply Selection Method (SSM), Vogel's Approximation Method (VAM), Bilqis-Chastine-Erma (BCE). Juman-Hoque Method (JHM), and Total Opportunity Cost Matrix-Minimal Total (TOCM-MT) are not always reliable in producing low-cost solutions. This study proposes the Rihan-Bilqis-Saikhu Method (RBSM). This heuristic modifies SSM by considering the total cost-supply of each cell and adjusting how surplus allocations are shifted to rows with shortages. The method was evaluated using 42 test cases, including 32 published test cases, 5 randomly generated test cases, and 5 real test cases from XYZ company. Results show that RBSM outperformed all comparison methods, achieving the optimal solution in 36 out of 42 cases (85.71 % accuracy) and producing the lowest average deviation (0.58 %) from the optimal cost. The contributions of RBSM are:•Integration of total cost-supply into allocation decisions.•Refined reallocation rules between surplus rows and rows with shortages.•Consistent accuracy and efficiency across diverse test cases.

Authors

Institutions

Publication Details

Journal
MethodsX
Published
2026-02-15
DOI
https://doi.org/10.1016/j.mex.2026.103825
Primary Topic
Optimization and Mathematical Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhanced supply selection for better initial basic feasible solutions in transportation problems

Bilqis Amaliah, Rihan Farih Bunyamin, Ahmad Saikhu
MethodsX
Optimization and Mathematical Programming
article

Enhanced supply selection for better initial basic feasible solutions in transportation problems

Bilqis Amaliah, Rihan Farih Bunyamin, Ahmad Saikhu
article en

Abstract

The Transportation Problem (TP) is an optimization model that distributes goods from multiple supply points to various demand points at minimal cost. A crucial step in solving TP is generating an Initial Basic Feasible Solution (IBFS), which affects the efficiency of reaching the optimal solution. However, existing IBFS methods such as Supply Selection Method (SSM), Vogel's Approximation Method (VAM), Bilqis-Chastine-Erma (BCE). Juman-Hoque Method (JHM), and Total Opportunity Cost Matrix-Minimal Total (TOCM-MT) are not always reliable in producing low-cost solutions. This study proposes the Rihan-Bilqis-Saikhu Method (RBSM). This heuristic modifies SSM by considering the total cost-supply of each cell and adjusting how surplus allocations are shifted to rows with shortages. The method was evaluated using 42 test cases, including 32 published test cases, 5 randomly generated test cases, and 5 real test cases from XYZ company. Results show that RBSM outperformed all comparison methods, achieving the optimal solution in 36 out of 42 cases (85.71 % accuracy) and producing the lowest average deviation (0.58 %) from the optimal cost. The contributions of RBSM are:•Integration of total cost-supply into allocation decisions.•Refined reallocation rules between surplus rows and rows with shortages.•Consistent accuracy and efficiency across diverse test cases.

MethodsXVol. 16
Sepuluh Nopember Institute of Technology (ID)
Openalex Percentile: Top 56%
Optimization and Mathematical Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.