Volume 4 Number 5 (Sep. 2014)
Home > Archive > 2014 > Volume 4 Number 5 (Sep. 2014) >
IJAPM 2014 Vol.4(5): 352-362 ISSN: 2010-362X
DOI: 10.7763/IJAPM.2014.V4.308

Efficient Heuristics for Single-Source Transportation Problems

Pisut Pongchairerks
Abstract—This paper develops two efficient heuristics to solve the single-source transportation problem, i.e. the special class of the transportation problem where each customer must be served by only one supplier. The proposed heuristics are both started by simplifying the problem into the simpler transportation problem where each customer requires exact one product lot. Then, the first heuristic solves the simplified problem using the transportation algorithm while the second heuristic solves it using the assignment algorithm. The heuristics return an optimal solution or a near-optimal solution for every benchmark instance.

Index Terms—Single-source transportation problem, assignment problem, transportation problem, heuristic.

Pisut Pongchairerks is with Production Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok, Thailand (email: pisut@tni.ac.th).

Cite: Pisut Pongchairerks, "Efficient Heuristics for Single-Source Transportation Problems," International Journal of Applied Physics and Mathematics vol. 4, no. 5, pp. 352-362, 2014.

General Information

ISSN: 2010-362X (Online)
Abbreviated Title: Int. J. Appl. Phys. Math.
Frequency: Quarterly
DOI: 10.17706/IJAPM
Editor-in-Chief: Prof. Haydar Akca 
Abstracting/ Indexing:  Index Copernicus, IET INSPEC, Chemical Abstracts Services (CAS), Nanowerk Database, Google Scholar, EBSCO, etc.
E-mail: ijapm@iap.org
  • May 14, 2019 News!

    IJAPM Vol 7, No 4-Vol 8, No 3 have been indexed by EI (Inspec)   [Click]

  • Sep 16, 2021 News!

    IJAPM Vol 11, No 4 has been published with online version   [Click]

  • Jun 10, 2021 News!

    Vol 11, No 3 has been published with online version   [Click]

  • Mar 15, 2021 News!

    Vol 11, No 2 has been published with online version   [Click]

  • Dec 24, 2020 News!

    Vol 11, No 1 has been published with online version   [Click]

  • Read more>>