Answered: in java write code for particle swarm…

in java write code for particle swarm optimization which has adds a forth force closer to nest. calculate the direction the particles must move to be in the centre

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

C PROGRAMMING Implement dijkstras alorithm Check that the Graph graph, and starting node, id, are valid• Create the set S containing all the networks (vertices) except the source node (you might wantto use an array for this.• Create an array to represent the table D and initialise it with the weights of the edges from thesource node, or infinity if no edge exists. You should use the constant DBL_MAX to representinfinity.• Create an array to represent the table R and initialise it with the next hops if an edge existsfrom the source, or 0 otherwise.• Then repeatedly follow the remaining rules of Dijkstra’s algorithm, updating the values in D andR until S is empty.• Each of the values required to complete the above can be found by calling the variousfunctions (get_vertices(), get_edge(), edge_destination(), edge_weight(), etc.)in the supplied graph library.• Once Dijkstra’s algorithm has run, you will need to create the routing table to be returned byallocating enough memory for the…
InfoProcessorTest.java import java.util.*; /** * * Class to process and extract information from a list of lines. * */ public class InfoProcessorTest { /** * * List of lines to process. * */ private ArrayList<String> lines =new ArrayList<String>(); /** * * Creates InfoProcessor with given list of lines. * * @param lines to process * */ public InfoProcessorTest(ArrayList<String> lines) { this.lines = lines; } /** * * Gets the course name from the list of lines. * * First, finds the line that starts with "Course:". * * Second, gets the String on the very next line, which should be the course * name. * * Third, returns the String from the method. * * * * Hint(s): * * - Use the getNextStringStartsWith(String str) method to find the course name * * * * Example(s): * * - If the ArrayList<String> lines contains: "Course:" and "CIT590", and we * call * * getCourseName(), we'll get "CIT590". * * * * - If the ArrayList<String> lines contains: "Course:"…
Programming assignments1) Waiting line simulation in an Indian post office:In an Indian post office that not only delivers mail but also functions as a savingsbank carrying out specific transactions, a lone postal worker serves a single queue ofcustomers. Every customer receives a token # (serial number) as soon as they enterthe queue. After service, the token is returned to the postal worker, and the customerleaves the queue. At any point in time, the worker may want to know how manycustomers are yet to be served.i) Implement the system using an appropriate queue data structure, simulating arandom arrival and departure of customers after service completion.ii) If a customer arrives to operate their savings account at the post office, thenthey are attended to first by permitting them to join a special queue. In such a case,the postal worker attends to them immediately before resuming their normal serviceof mail delivery. Modify the system to implement this addition in service
Create the following graph. Implement the following functions. 1. addEdge() that takes two vertices as two parameters and creates an Edge between them. 2. nonAdjacentVertices() that takes a single vertex as parameter, and returns an array of vertices that are NOT adjacent to that vertex. 3. Write a function addUnknownVertices() that takes a vertex as a parameters, and creates an Edge with the vertices that are NOT adjacent to it. 4. Write a method searchVertex() which takes an array of Vertices as parameters. The first member of the array will be the starting vertex and the last member will be the Vertex you want to reach. For example searchVertex(Vertex 0, Vertex 4, Vertex 3) will output “Vertex cannot be reached” since you can reach from 0 to 4, but cannot from 4 to 3. Again, searchVertex(Vertex 0, Vertex 1, Vertex 2, Node 3) will output “Vertex can be reached” since you can reach from 0 to 1, 1 to 2, 2 to 3.
Recursive function tracing: drawing Recursion Tree for Smallest(a, 0, 6), where vector a contains the following numbers: a = {4, 5, 10, 1, 20, 23, 2}. • clearly label each recursive call’s parameters• clearly label what each call returns to its caller //Return smallest element in sublist a[first...last] int Smallest (vector<int> a, int first, int last){ if (first==last) return a[first]; mid = (first+last)/2; //integer division l1 = Smallest(a, first, mid); l2 = Smallest (a, mid+1, last); if (l1>l2) return l2; else return l1; }
neural networks Program to generate random numbers from 11 to 21 as class 1 and generate random numbers from 9 to 55 as class append them to the lists. Take 8 data in each list and plot it.
You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack. A queen is standing on an chessboard. The chess board's rows are numbered from to , going from bottom to top. Its columns are numbered from to , going from left to right. Each square is referenced by a tuple, , describing the row, , and column, , where the square is located. The queen is standing at position . In a single move, she can attack any square in any of the eight directions (left, right, up, down, and the four diagonals). In the diagram below, the green circles denote all the cells the queen can attack from : There are obstacles on the chessboard, each preventing the queen from attacking any square beyond it on that path. For example, an obstacle at location in the diagram above prevents the queen from attacking cells , , and : Given the queen's position and the locations of all the obstacles, find and print the number of…
Need help solving this issue. ShoppingList Class import java.util.Scanner;import java.util.LinkedList; public class ShoppingList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in); // TODO: Declare a LinkedList called shoppingList of type ListItemLinkedList<String> shoppingList = new LinkedList<String>(); String item;// TODO: Scan inputs (items) and add them to the shoppingList LinkedList// Read inputs until a -1 is inputitem = scnr.next();while (!item.equals("-1")) {shoppingList.add(item);item = scnr.next();}// TODO: Print the shoppingList LinkedList using the printNodeData() methodfor (int i = 0; i < shoppingList.size(); i ++) {ListItem list = new ListItem();list.listItem();list.printNodeData();} }} ListItem Class public class ListItem {private String item; public ListItem() {item = "";} public ListItem(String itemInit) {this.item = itemInit;} // Print this node public void printNodeData() {System.out.println(this.item);}}…
Artificial intelligence, i need it python code please not algorithm Develop a Word2Vec Language Model Use a corpus , to build a Word2Vec Language Model, using Python. Each student should learn what is Word2Vec by him/herself. The language model will be a set of words and a vector of numbers (called Word Embeddings) for each word. The language model can be easily used in Python. After building the language model, each student should demonstrate it by: (1) finding similar words to a given word, and (2) Finding the cosine similarity between two words. i need it python code please
Write a Graph class in Java. This class should represent undirected graphs. You can choose one of the representationsfrom our graph exercises, eg object model, sets of nodes and edges, adjacency matrix, or soon, whichever you feel most comfortable with.● Include comments in your Java file to explain how nodes and edges are represented.● Assume that only one edge can exist between two nodes.● Assume that it is possible to have an edge connecting a node to itself, ie that a nodecan be connected to itself via an edge.● Because edges are undirected, an edge between v and w is also one between w and v.● Your constructor method should take one parameter: the number of nodes of thegraph. Add a method to your class: boolean addEdge that takes two parameters, v andw (representing two modes v and w which are connected together by the edgebeing added). If successful, the method should return true. The method should return false when it isunsuccessful, which is in the following cases: the edge is…
In Java code: In Java code: In a game of Tic Tac Toe, two players take turns making an available cell in a 3 x 3 grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical, or diagonal row on the grid, the game is over and that player has won. A stalemate occurs when all the cells on the grid have been filled with tokens and neither player has achieved a win. Code a program that emulates a Tic Tac Toe game. When you are done, a typical session will look like this: Welcome to tic-tac-toe. Enter coordinates for your move following the X and O prompts. 1 2 3A | | -----B | | -----C | |X:A2 1 2 3A |X| -----B | | -----C | |O:B3 1 2 3A |X| -----B | |O -----C | | And so on. Illegal moves will prompt the user again for a new move. A win or a stalemate will be announced, mentioning the winning side if any. The program will terminate whenever a single game is complete. For this lab, you will be…
write python program 10x10 grid, agent top right corner, traversing terrain = 1 time unit, rough terrain = 5 time units, and others terain = cannot be reached An A* based search function that takes a list of lists as argument and generates as a result a list of grid cell coordinates starting at the upper right and ending at the lower left and representing the fastest path for the agent to travel. E.g., path = aStarSearch(map). The path can be empty if there is no route.