in this paper, a new formula is applied for the calculation of gravity anomalies from a cylinder model representing a geological body. compared to conventional methods, this new development allows the cylinder to be freely oriented in space. 38 gravity forward models are produced each of which anomaly attributes are calculated. then a linear relationship is established between attributes and so...

An Evolutionary algorithm for resource constrained project scheduling (RCPS) problem is proposed with the objective to minimize project duration (makespan). The algorithm is tested with standard data sets given by Kolisch library for J30 and J60 and found to be performing well. General Terms Project Scheduling, Resources.

This paper presents the design of an algorithm based on Ant Colony Optimization paradigm to solve the Software Project Scheduling Problem. This problem consists in deciding who does what during the software project development, finding an optimal schedule for a project so that the precedence and resource constraints are satisfied and the final project cost and its duration are minimized. We pre...

This paper describes a project that was done for the Shad Valley Program, where it was required to assign students to seminars so as to maximize the satisfaction of the students with their assignments. We begin by describing the problem, its inputs and constraints. Two models are proposed to determine optimal assignments. The first model is based on the Capacitated Transportation Problem and a ...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

this paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. if the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. it is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. the ...