COMPARATIVE ANALYSIS OF INITIAL SOLUTION METHODS FOR THE TRANSPORTATION PROBLEM

Authors

  • Aleksandar Krstev Faculty of Computer Science, Goce Delcev University, Stip, North Macedonia
  • Dejan Krstev Faculty of Mechanical engineering, Goce Delcev University, Stip, North Macedonia
  • Zoran Zlatev Faculty of Computer Science, Goce Delcev University, Stip, North Macedonia
  • Mirjana Kocaleva Vitanova Faculty of Computer Science, Goce Delcev University, Stip, North Macedonia

Keywords:

Transportation problem, Operations Research, Initial feasible solution, Vogel’s Approximation Method, Logistics optimization

Abstract

This paper presents a comparative evaluation of four classical heuristics for generating initial feasible solutions to the transportation problem: the Northwest Corner Method (NWC), Least Cost Method (LCM), Double Preference Method (DPM), and Vogel’s Approximation Method (VAM). A balanced transportation instance is analysed to quantify the impact of each method on total transportation cost. Results demonstrate that cost-aware heuristics significantly outperform the Northwest Corner approach, yielding identical minimum initial costs in the studied case. The study highlights the importance of intelligent initialization for accelerating convergence toward optimal solutions in logistics and production systems.

Downloads

Download data is not yet available.

Author Biography

  • Mirjana Kocaleva Vitanova, Faculty of Computer Science, Goce Delcev University, Stip, North Macedonia

    Faculty of Computer Science, Goce Delcev University, Stip, North Macedonia

Downloads

Published

2026-06-05

Issue

Section

Articles

How to Cite

COMPARATIVE ANALYSIS OF INITIAL SOLUTION METHODS FOR THE TRANSPORTATION PROBLEM. (2026). Balkan Journal of Applied Mathematics and Informatics, 9(1), 43-54. https://js.ugd.edu.mk/index.php/bjami/article/view/8016