Solving Facility Location Problem on Cluster Computing
| Main Authors: | Ei Phyo Wai, Nay Min Tun |
|---|---|
| Format: | Article eJournal |
| Bahasa: | eng |
| Terbitan: |
, 2011
|
| Online Access: |
https://zenodo.org/record/1329470 |
| ctrlnum |
1329470 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Ei Phyo Wai</creator><creator>Nay Min Tun</creator><date>2011-03-28</date><description>Computation of facility location problem for every
location in the country is not easy simultaneously. Solving the
problem is described by using cluster computing. A technique is to
design parallel algorithm by using local search with single swap
method in order to solve that problem on clusters. Parallel
implementation is done by the use of portable parallel programming,
Message Passing Interface (MPI), on Microsoft Windows Compute
Cluster. In this paper, it presents the algorithm that used local search
with single swap method and implementation of the system of a
facility to be opened by using MPI on cluster. If large datasets are
considered, the process of calculating a reasonable cost for a facility
becomes time consuming. The result shows parallel computation of
facility location problem on cluster speedups and scales well as
problem size increases.</description><identifier>https://zenodo.org/record/1329470</identifier><identifier>10.5281/zenodo.1329470</identifier><identifier>oai:zenodo.org:1329470</identifier><language>eng</language><relation>doi:10.5281/zenodo.1329469</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><source>International Journal of Information, Control and Computer Sciences 4.0(3)</source><title>Solving Facility Location Problem on Cluster Computing</title><type>Journal:Article</type><type>Journal:Article</type><recordID>1329470</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal Journal:eJournal |
| author |
Ei Phyo Wai Nay Min Tun |
| title |
Solving Facility Location Problem on Cluster Computing |
| publishDate |
2011 |
| url |
https://zenodo.org/record/1329470 |
| contents |
Computation of facility location problem for every
location in the country is not easy simultaneously. Solving the
problem is described by using cluster computing. A technique is to
design parallel algorithm by using local search with single swap
method in order to solve that problem on clusters. Parallel
implementation is done by the use of portable parallel programming,
Message Passing Interface (MPI), on Microsoft Windows Compute
Cluster. In this paper, it presents the algorithm that used local search
with single swap method and implementation of the system of a
facility to be opened by using MPI on cluster. If large datasets are
considered, the process of calculating a reasonable cost for a facility
becomes time consuming. The result shows parallel computation of
facility location problem on cluster speedups and scales well as
problem size increases. |
| id |
IOS17403.1329470 |
| institution |
Universitas PGRI Palembang |
| institution_id |
189 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas PGRI Palembang |
| library_id |
587 |
| collection |
Marga Life in South Sumatra in the Past: Puyang Concept Sacrificed and Demythosized |
| repository_id |
17403 |
| city |
KOTA PALEMBANG |
| province |
SUMATERA SELATAN |
| repoId |
IOS17403 |
| first_indexed |
2022-07-26T04:36:18Z |
| last_indexed |
2022-07-26T04:36:18Z |
| recordtype |
dc |
| merged_child_boolean |
1 |
| _version_ |
1739487860038303744 |
| score |
17.538404 |