The location problem of interconnected facilities on the line with forbidden gaps is considered. The located facilities are connected among themselves and with gaps. Location in forbidden gaps is not allowed. It is need to minimize the total cost of connections between facilities and between facilities and gaps. It is known that the initial continuous problem is reduced to series discrete subpr...

This paper proposes a method to improve genetic programming with multiple trees (GPCN). An individual in GPCN comprises multiple trees, and each tree has a number P that indicates the number of repetitive actions based on the tree. In previous work, a method for updating the number P has been proposed to obtain P suitable to the tree in evolution. However, in the method efficiency becomes worse...

We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution” by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss map. In practice, the algorithm works well when there is high motion coherence in the environmen...

In this paper, we address the fundamental question concerning the limits on the network lifetime in sensor networks when multiple base stations (BSs) are deployed as data sinks. Specifically, we derive upper bounds on the network lifetime when multiple BSs are employed, and obtain optimum locations of the base stations that maximise these lifetime bounds. For the case of two BSs, we jointly opt...

for any agency dealing with the design of the water distribution network, an economic design will be an objective. in this research, central force optimization (cfo) and differential evolution (de) algorithm were used to optimize ismail abad water distribution network. optimization of the network has been evaluated by developing an optimization model based on cfo and de algorithm in matlab and ...

In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, w...

Ports, warehouses and courier services have to decide online how an arriving task is to be served in order that cost is minimized (or profit maximized). These operators have a wealth of historical data on task assignments; can these data be mined for knowledge or rules that can help the decisionmaking? MOO is a novel application of data mining to online optimization. The idea is to mine (logged...

. . . . . . . . . . . . . . . . . . . . . . . . . . 4 2 Background and Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1 Manual image segmentation 2.2 Automatic image segmentation 2.3 Multi-atlas image segmentation 2.4 Label Fusion 2.5 Atlas selection 2.6 Automatic Optimum Atlas Selection (OAS) 3 Materials and Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Solving constraint optimization problems is computationally so expensive that it is often impossible to provide a guaranteed optimal solution, either when the problem is too large, or when time is bounded. In these cases, local search algorithms usually provide good solutions. However, and even if an optimality proof is unreachable, it is often desirable to have some guarantee on the quality of...