View Article
A Hybrid Nested Partitions Algorithm for Banking Facility Location Problems
Friday, July 30, 2010 - 04:19 AM - 1 month, 1 week ago - Electrical Engineering - Automation Science and Engineering - IEEE
The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach.
(c) 2000-2010 NanotechClearinghouse.com
- Terms of use | Privacy Policy | Accessibility Statement -
You have reached the internet site of Nanotech Clearinghouse .com, a site focused on Nanomaterials, Nanotechnology, Nano Science, and related research and product developmnent. Please enjoy the searchable archive of news related to the industry. We hope you will take the time to share your experience in the nano technology field. Please provide first hand commentary within your area of expertise!
Secure the internet for your kids for free.
Commentary