this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

optimal capacitor placement, considering power system loss reduction, voltage profile improvement, line reactive power decrease and power factor correction, is of particular importance in power system planning and control. the distribution system operator calculates the optimal place, number and capacity of capacitors based on two major purposes: active power loss reduction and return on invest...

Abstract: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problem...

The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms CSP/SAT techniques (especially when a plan length is not given a priori). The probl...

  Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problems are co...

In this study, the planning problem concerned with simultaneous placement of distribution generation (DG) and capacitor bank in the distribution network is investigated from a local distribution company’s (DISCO’s) viewpoint based on minimum total cost over the planning period and applying genetic algorithm (GA). The cost terms of the objective function include risk cost of load not supplied of...

The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...

Optimization mobile radio network planning is a very complex task, as many aspects must be taken into account. Deciding upon the optimum placement for the base stations (BS’s) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper introduces the spatial clustering to solve the Mobile Networking Planning problem. It addresses antenna ...