Depot Location Problems By Considering Its Distribution Problems

Authors

  • Henny Sartika Department of Mathematics, University of Riau, Pekanbaru, Indonesia
  • Mohammad Daniel Hendri Gamal Department of Mathematics, University of Riau, Pekanbaru, Indonesia

DOI:

https://doi.org/10.32734/jormtt.v1i1.753

Keywords:

Heuristic method, location problem, traveling salesperson problem

Abstract

In this paper we study the problem of locating m depots to serve n customers in order to minimize the total transportation cost. The way the depots serve the customers is considered as a traveling salesperson problem. We combine the location and the traveling salesperson problem methods to find the near-optimal or the best depot locations. An illustrative example is presented to implement the proposed method.

Downloads

Download data is not yet available.

Published

2019-03-07

How to Cite

[1]
H. Sartika and M. D. H. Gamal, “Depot Location Problems By Considering Its Distribution Problems”, J. of Research in Math. Trends and Tech., vol. 1, no. 1, pp. 16-23, Mar. 2019.