Title: | Genetic Algorithm Based Approaches to Install Different Types of Facilities |
---|
Authors: | ID Atta, Soumen, Dept. of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, India (Author) ID Sinha Mahapatra, Priya Ranjan, Dept. of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, India (Author) |
Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS. |
---|
Language: | English |
---|
Work type: | Not categorized |
---|
Typology: | 1.08 - Published Scientific Conference Contribution |
---|
Organization: | UNG - University of Nova Gorica
|
---|
Abstract: | Given a set P of n-points (customers) on the plane and a positive integer k (1 ≤ k ≤ n), the objective is to find a placement of k circles (facilities) such that the union of k circles contains all the points of P and the sum of the radii of the circles is minimized. We have proposed a Genetic Algorithm (GA) to solve this problem. In this context, we have also proposed two different algorithms for k=1 and 2. Finally, we have proposed a GA to solve another optimization problem to compute a placement of fixed number of facilities where the facilities are hazardous in nature and the range of each such facility is circular. |
---|
Keywords: | Facility Location, Enclosing Problem, Optimization Problem, Genetic Algorithm |
---|
Publication status: | Published |
---|
Year of publishing: | 2014 |
---|
Number of pages: | 195-203 |
---|
PID: | 20.500.12556/RUNG-8241 |
---|
COBISS.SI-ID: | 154445315 |
---|
DOI: | https://doi.org/10.1007/978-3-319-03107-1_23 |
---|
NUK URN: | URN:SI:UNG:REP:VE1BVY33 |
---|
Publication date in RUNG: | 05.06.2023 |
---|
Views: | 1611 |
---|
Downloads: | 0 |
---|
Metadata: | |
---|
:
|
Copy citation |
---|
| | | Average score: | (0 votes) |
---|
Your score: | Voting is allowed only for logged in users. |
---|
Share: | |
---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |