A large neighbourhood search to solve capacitated planar location-allocation problem

• المؤلفون الرئيسيون: Luis, Martino, Lamsali, Hendrik, Surya Saputra, Ruswiati
• التنسيق: Conference or Workshop Item
• منشور في: 2014
• الموضوعات: QA75 Electronic computers. Computer science
• الوصول للمادة أونلاين: http://repo.uum.edu.my/18598/; http://doi.org/10.1063/1.4903646

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...