Developing a dynamic maximal covering location problem by considering capacitated facilities &amp; solving it using hill climbing &amp; a genetic algorithm.pdf
Creators: name: Seifbarghy, Mehdi
name: Bagherinejad, Jafar
name: Shoeib, Mahnaz
Publisher: name: figshare
Year: 2020
Subjects: subject: 90603 Industrial Electronics
subject: FOS: Electrical engineering, electronic engineering, information engineering
subject: FOS: Electrical engineering, electronic engineering, information engineering
subject: 90505 Infrastructure Engineering and Asset Management
subject: FOS: Civil engineering
subject: FOS: Civil engineering
subject: 91599 Interdisciplinary Engineering not elsewhere classified
subject: FOS: Other engineering and technologies
subject: FOS: Other engineering and technologies
subject: 91003 Machine Tools
subject: 91004 Machining
subject: 91099 Manufacturing Engineering not elsewhere classified
subject: 91005 Manufacturing Management
subject: 91006 Manufacturing Processes and Technologies (excl. Textiles)
subject: 91007 Manufacturing Robotics and Mechatronics (excl. Automotive Mechatronics)
subject: 91008 Manufacturing Safety and Quality
subject: 91101 Marine Engineering
subject: FOS: Environmental engineering
subject: FOS: Environmental engineering
subject: 91199 Maritime Engineering not elsewhere classified
subject: 91299 Materials Engineering not elsewhere classified
subject: FOS: Materials engineering
subject: FOS: Materials engineering
subject: Mechanical Engineering
subject: FOS: Mechanical engineering
subject: FOS: Mechanical engineering
subject: 91399 Mechanical Engineering not elsewhere classified
subject: 90304 Medical Devices
subject: FOS: Medical engineering
subject: FOS: Medical engineering
subject: 90404 Membrane and Separation Technologies
subject: FOS: Chemical engineering
subject: FOS: Chemical engineering
subject: 91207 Metals and Alloy Materials
subject: 91306 Microelectromechanical Systems (MEMS)
subject: 90604 Microelectronics and Integrated Circuits
subject: 91009 Microtechnology
subject: 91404 Mineral Processing/Beneficiation
subject: 91405 Mining Engineering
subject: 91102 Naval Architecture
subject: 90904 Navigation and Position Fixing
subject: 90405 Non-automotive Combustion and Fuel Engineering (incl. Alternative/Renewable Fuels)
subject: Nuclear Engineering
subject: 91506 Nuclear Engineering (incl. Fuel Enrichment and Waste Processing and Storage)

description: The maximal covering location problem maximizes the total number of demands served within a maximal service distance given a fixed number of facilities or budget constraints. Most research papers have considered this maximal covering location problem in only one period of time. In a dynamic version of maximal covering location problems, finding an optimal location of P facilities in T periods is the main concern. In this paper, by considering the constraints on the minimum or maximum number of facilities in each period and imposing the capacity constraint, a dynamic maximal covering location problem is developed and two related models (A, B) are proposed. Thirty sample problems are generated randomly for testing each model. In addition, Lingo 8.0 is used to find exact solutions, and heuristic and meta-heuristic approaches, such as hill climbing and genetic algorithms, are employed to solve the proposed models. Lingo is able to determine the solution in a reasonable time only for small-size problems. In both models, hill climbing has a good ability to find the objective bound. In model A, the genetic algorithm is superior to hill climbing in terms of computational time. In model B, compared to the genetic algorithm, hill climbing achieves better results in a shorter time.