Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...

GP requires that all functions/terminals (tree labels) be given apriori. In the absence of specific information about the solution, the user is often forced to provide a large set, thus enlarging the search space — often resulting in reducing the search efficiency. Moreover, based on heuristics, syntactic constraints, or data typing, a given subtree may be undesired or invalid in a given contex...

By fuzzy random programming, we mean the optimization theory dealing with fuzzy random decision problems. This paper presents a new concept of chance of fuzzy random events and then constructs a general framework of fuzzy random chance-constrained programming (CCP). We also design a spectrum of fuzzy random simulations for computing uncertain functions arising in the area of fuzzy random progra...

A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...

To find a global optimal solution to the quadratically constrained quadratic programming problem, we explore the relationship between its Lagrangian multipliers and related linear conic programming problems. This study leads to a global optimality condition that is more general than the known positive semidefiniteness condition in the literature. Moreover, we propose a computational scheme that...

In this article, we present a framework for planning an activity to be executed with the support of robotic navigation assistant. The two main components are and motion planner. planner composes sequence abstract activities, chosen from given set, synthesize plan. Each is associated point interest in environment probabilistic parameters that depend on plan, which characterized by simulations re...