Skip to content

Dara-O/Optimal-Position-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Optimal-Position-Algorithm

An attempt to develop an algorithm that optimizes the location of objects (called servers) that interact with other objects (called nodes) within a predefined range. The algorithm was implemented in python using numpy, pandas, matplotlib and seaborn.

Glosary

  • Server: An object that distributes a resources or interacts in some way with other objects within a specified (circular) range.
  • Node : An object that recieves a resources or requires some interaction.
  • Radius: The "distance" around a server that determines how far away nodes can be before they are no longer served by the server.
  • Most connected object/node: The node that has the highest number of nodes within a specified radius. This radius is the same as the radius defined above.

Demonstration

39 Nodes, 9 Servers demo

Algotithm Flowchart

image

Time Complexity

image

Proposed Applications:

  • In general, any application that requires the distribution of resources within a limited range may benefit from this algorithm like this one. For example, this algorithm can help optimize the positions of…
    • surveillance drones used in disaster management endeavors like wildfire fighting.
    • wireless-communication infrastructure like cell towers.
    • electrical substations
    • COVID-19 vaccination clinics

Cursory analysis reveals that the number of circles depends on the radius of the circle and density of the points.

About

An attempt to develop an algorithm that optimizes the location of objects (called servers) that interact with other objects (called nodes) within a predefined range.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors