In order to transform three-dimensional space path planning into two-dimensional plane problem and greatly reduce the search time, an intelligent heuristic algorithm based on artificial intelligence is proposed. The analyzed introduced, A chosen. spatial environment model of picking robot investigated, a established by raster method. Then, considering whole day operation time divided several pe...

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one ano...

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...