Читать книгу Handbook of Intelligent Computing and Optimization for Sustainable Development - Группа авторов - Страница 248

Now, enter the source and receiver node from the total displaced nodes. Put the values of sender and receiver node. Now, put range of node which is 2 here. Assign the sender coordinates and draw the circle by the function.

Find out the fault in routes and times in delivery. Next is the procedure of number of steps. First is to finding nodes which are in range to the sender nodes, calculate distances of senders with nodes in its range, indexes of ranged nodes with respect to sender, calculate distance between sender and all other nodes, select only the nodes in range. Now, make group of ranged nodes, and then, apply DE and find cost of all the groups collected. Selecting node combination with best cost, finding the closest node to the receiver, out of the selected ranged nodes, distance of the ranged nodes to receiver, arranging the indexes. Now, find the next node to hop on, from next hop to the receiver node draw the line and circle.