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.

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN: 978-0-7354-1274-3
Uncontrolled Keywords:	Data sets
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Technology Management & Logistics
Depositing User:	Dr. Martino Luis
Date Deposited:	21 Aug 2016 07:47
Last Modified:	21 Aug 2016 07:47
URI:	https://repo.uum.edu.my/id/eprint/18598

Actions (login required)

View Item