The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution

Out of the search for the truth, the reader of the Holy Qur’an should know the fate of the sorcerers whom Pharaoh threatened when they announced it as pure monotheism in front of seeing the stick as it turned into a clear serpent, when they said: We believe in the Lord of the worlds, the Lord of Moses and Aaron, and the clear promise came to cut and crucify the trunks of palm trees, and they said what they said if Being supplicants to God (May God cause us to die as Muslims), did Pharaoh actually carry out what he promised them?? So we studied that subject from this angle. Because what looms on the horizon of the Holy Qur’an is that there is no one who seeks refuge with God Almighty in times of adversity except that God Almighty has

تمهيد

غالبا ما يكون تعامل المنظمات المالية والمصرفية مع الزبائن بشكل أساسي مما يتطلب منها جمع كميات هائلة من البيانات عن هؤلاء الزبائن هذا بالإضافة الى ما يرد اليها يوميا من بيانات يجعلها أمام أكداس كبيرة من البيانات تحتاج الى جهود جبارة تحسن التعامل معها والاستفادة منها بما يخدم المنظمة.

ان التعامل اليدوي مع مثل هذه البيانات دون استخدام تقنيات حديثة يبعد المنظمة عن التط

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).