ABSTRACT
The objectives of Dynamic Network Simplex plus Algorithm (DNSA) are to solve the new problem faster, to use some parts of the previous solution for the next problem, and to respond to changes in the problem. A graph is said to be fully dynamic if the update operations include unrestricted insertions as well as deletions of arcs and nodes. A graph is called partially dynamic if only one type of update, either insertions or deletions, is allowed. The data structures of the problem and graph are basic components of the algorithm. A small memory management facility has been designed, implemented, and embedded in the software. At the start of the process, a few jobs are generated for each crane and the memory for the jobs and graph are allocated. After removing the nodes and arcs from the model and omitting the jobs from the vehicle's lists, a new spanning tree is made.
