A large neighbourhood search to solve capacitated planar location-allocation problem
This paper presents a large neighbourhood search for solving the planar location-allocation problem. This location-allocation problem entails to find the location of specified number of facilities on a plane and their customer allocations on a plane. It is generally assumed that all facilities have...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: |
| _version_ | 1825804057856442368 |
|---|---|
| author | Luis, Martino Lamsali, Hendrik Surya Saputra, Ruswiati |
| author_facet | Luis, Martino Lamsali, Hendrik Surya Saputra, Ruswiati |
| author_sort | Luis, Martino |
| collection | UUM |
| description | This paper presents a large neighbourhood search for solving the planar location-allocation problem. This location-allocation problem entails to find the location of specified number of facilities on a plane and their customer allocations on a plane. It is generally assumed that all facilities have the same given capacity. A greedy algorithm is used to generate initial solutions and then an exchange neighborhood procedure is put forward to explore large neighborhood heuristically. The experiments are conducted to assess the performance of the proposed method using benchmark data sets taken from the facility location literature. The preliminary computational results show that the proposed methods provide competitive results when compared to the best known results from the literature. Some future research investigations on this capacitated planar location problem are also briefly highlighted. |
| first_indexed | 2024-07-04T06:08:10Z |
| format | Conference or Workshop Item |
| id | uum-18598 |
| institution | Universiti Utara Malaysia |
| last_indexed | 2024-07-04T06:08:10Z |
| publishDate | 2014 |
| record_format | eprints |
| spelling | uum-185982016-08-21T07:47:57Z https://repo.uum.edu.my/id/eprint/18598/ A large neighbourhood search to solve capacitated planar location-allocation problem Luis, Martino Lamsali, Hendrik Surya Saputra, Ruswiati QA75 Electronic computers. Computer science This paper presents a large neighbourhood search for solving the planar location-allocation problem. This location-allocation problem entails to find the location of specified number of facilities on a plane and their customer allocations on a plane. It is generally assumed that all facilities have the same given capacity. A greedy algorithm is used to generate initial solutions and then an exchange neighborhood procedure is put forward to explore large neighborhood heuristically. The experiments are conducted to assess the performance of the proposed method using benchmark data sets taken from the facility location literature. The preliminary computational results show that the proposed methods provide competitive results when compared to the best known results from the literature. Some future research investigations on this capacitated planar location problem are also briefly highlighted. 2014-08-12 Conference or Workshop Item PeerReviewed Luis, Martino and Lamsali, Hendrik and Surya Saputra, Ruswiati (2014) A large neighbourhood search to solve capacitated planar location-allocation problem. In: International Conference on Quantitative Sciences and Its Applications (ICOQSIA 2014), 12–14 August 2014, Langkawi, Kedah Malaysia. http://doi.org/10.1063/1.4903646 doi:10.1063/1.4903646 doi:10.1063/1.4903646 |
| spellingShingle | QA75 Electronic computers. Computer science Luis, Martino Lamsali, Hendrik Surya Saputra, Ruswiati A large neighbourhood search to solve capacitated planar location-allocation problem |
| title | A large neighbourhood search to solve capacitated planar location-allocation problem |
| title_full | A large neighbourhood search to solve capacitated planar location-allocation problem |
| title_fullStr | A large neighbourhood search to solve capacitated planar location-allocation problem |
| title_full_unstemmed | A large neighbourhood search to solve capacitated planar location-allocation problem |
| title_short | A large neighbourhood search to solve capacitated planar location-allocation problem |
| title_sort | large neighbourhood search to solve capacitated planar location allocation problem |
| topic | QA75 Electronic computers. Computer science |
| work_keys_str_mv | AT luismartino alargeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem AT lamsalihendrik alargeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem AT suryasaputraruswiati alargeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem AT luismartino largeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem AT lamsalihendrik largeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem AT suryasaputraruswiati largeneighbourhoodsearchtosolvecapacitatedplanarlocationallocationproblem |