STUDI TENTANG MASALAH PENEMPATAN FASILITAS BERKAPASITAS SATU SUMBER DUA ESELON

Authors

  • Lamtiur Sinambela

Abstract


Facility location problem is an important part of integer programming problems, with application in the field of telecommunications, and transportation industry. This study discussed the facility location problem with two echelon. Each second echelon facilities have  limited capacity and can only be supplied by a facility on second echelon. Each customer is served only by a single facility in second echelon. The number and location of the second echelon of custumers to facilities determined echelon two simltaneous. This study addresses the questions of decision-making in designing cargo distribution system where there is a two echelon distribution system the two level structure, components and issues related decisions. The purpose of the model in the study is to determine the location of facilities at each echelon which is a distribution facility and cargo capacity at the facility so that can minimize the total cost of the minimum as the optimal solution of the modeling.

 

Keywords: CFLP, integer programming, optimization, two echelon

 

References

[1]Goyal, S.K., 1976. An integrated inventory model for a single supplier-single customer problem. International Journal of Production Research. (15): 107-111.
[2]Banerjee, Al., 1986. A joint economic-lot-size model for purchaser and vendor. A comment. Decision Science. (17): 293-311.
[3]Zavanella, L., 2009. A one vendor multi-buyer integrated production inventory model: The ‘consignment stock’ case. International Journal of Information and Management Sciences. (20): 217-223.
[4] Barcelo, J and J. Casanovas, 1984. A heuristic Langrangian algorithm for the capacitated plant location problem. Europan Journal of Operation Research. (15): 212-226.
[5]Holmberg, K., 1999. An exact algorithm for the capacitated facility location problem with single sourcing. Europan Journal of Operation Research. (133): 544-559.
[6]Tragantalerngsak, S., 2000. An exact method for the two-echelon, single source, capacitated facility location problem. Europan Journal of Operation Research. (123): 473-489.
[7]Aikens, C. H., 1985. Facility location model for distribution planning. Europan Journal of Operation Research. (22): 263-279.
[8]Fisher, M. L., 1981. The Langrangian relaxation method for solving integer programming problem . Management Science. (27): 1-18.
[9]Geoffrion, A. M., 1974. Langrangian relaxation for integer programming. Management Science. (27): 82-114.
[10]Laporte, G., 1988. Location-routing problem. In: Methods and Studies. Nortland, Amsterdam,. 163-198.
[11]Balas, E. And E. Zemel., 1980. An algorithm for large zero one knapsack. Operration Research. (28): 130-145.
[12]Christofides, N. and J.A. Beasly., 1983. Extentions to a Langrangian relaxation approach for the capacitated warehouse location problem. Europan Journal of Operation Research. (12): 19-28.
[13]Beasly, J.A., 1988. An algorithm for solving capacitated warehouse location problem. Europan Journal of Operation Research. (33): 314-325.
[14]Wu,K. S. And Yen, H. F., 2009. On a note on the economic lot size of the integrated vendor buyer inventory system derived without derivatives. International Journal of Information and Management Sciences. (20): 217-223.
[15]Beasly, J.A., 1993. Langrangian heuristic for location problem. Europan Journal of Operation Research. (65): 383-399.

Downloads

Published

2017-07-01

Issue

Vol. 2 No. 2 (2017): Journal Information System Development (ISD)

Section

Artikel

License

Penulis yang menerbitkan jurnal ini menyetujui persyaratan berikut:

  1. Penulis memiliki hak cipta dan memberikan hak untuk publikasi pertama jurnal dengan karya yang secara simultan dilisensikan di bawah Creative Commons Attribution License yang memungkinkan orang lain untuk berbagi karya dengan pengakuan kepengarangan karya dan publikasi awal dalam jurnal ini.
  2. Penulis dapat membuat perjanjian kontrak tambahan yang terpisah untuk distribusi non-eksklusif versi jurnal yang diterbitkan dari karya tersebut (misalnya, mempostingnya ke repositori institusional atau menerbitkannya dalam sebuah buku), dengan pengakuan atas publikasi awalnya di jurnal ini.
  3. Penulis diizinkan dan didorong untuk memposting karya mereka secara online (misalnya, dalam repositori institusional atau di situs web mereka) sebelum dan selama proses pengajuan, karena dapat menyebabkan pertukaran yang produktif, serta kutipan yang lebih awal dan lebih besar dari karya yang diterbitkan (Lihat Pengaruh Akses Terbuka).