evomo.algorithms.moead_uraw#

Attributes#

algo

Classes#

MOEAURAW

Initialize the MOEAURAW population and optimization state.

Module Contents#

class evomo.algorithms.moead_uraw.MOEAURAW(pop_size: int, n_objs: int, lb: torch.Tensor, ub: torch.Tensor, delta: float = 0.9, nr: int = 2, nEP: int = 200, **kwargs)#

Bases: evox.core.Algorithm

Initialize the MOEAURAW population and optimization state.

Parameters:

  • pop_size (int) – Required. Requested number of candidate solutions. Use a positive integer; algorithm-specific minimums and reference-vector sampling are described below. Use at least n_objs candidates because initial weights include all objective axes.

  • n_objs (int) – Required. Number of objectives, matching the second dimension of the problem’s objective tensor. Objectives are minimized; this library targets two or more objectives.

  • lb (torch.Tensor) – Required. Lower decision bounds of shape (D,), where D is the number of decision variables. Use floating-point bounds with the same shape, dtype and device as ub, and lb <= ub elementwise.

  • ub (torch.Tensor) – Required. Upper decision bounds of shape (D,). The decision dimension is inferred from the bounds, rather than passed separately. Match lb in shape, dtype and device.

  • delta (float) – Default: 0.9. Probability in [0, 1] of drawing mating parents from the current subproblem’s neighborhood. The remaining draws use the full population. This controls mating, not the replacement limit.

  • nr (int) – Default: 2. Maximum number of incumbent solutions replaced by one offspring during decomposition-based updating. Use a positive integer; the number actually replaced also depends on fitness comparisons.

  • nEP (int) – Default: 200. Capacity of the external nondominated archive used for adaptive weight updates. Use a positive integer; increasing it stores more candidate solutions and increases archive work.

  • kwargs (dict) – Default: {}. Extra keyword arguments are accepted for constructor compatibility but are not read by this implementation. In particular, passing device=... here does not move tensors; place both bounds on the intended device before construction.

Note

Use this algorithm through a workflow that connects the problem’s evaluation method. Call workflow.init_step() before workflow.step() or compiling the step. The current evaluation path expects an objective tensor of shape (B, n_objs). It does not consume a (fitness, constraint_violation) tuple.

Tensor allocation uses lb.device. There is no explicit device parameter; prepare both bounds on the intended device.

init_step() → None#

Evaluate the initial population and initialize algorithm state.

Invoke through workflow.init_step() before the first optimization step.

Returns:

None; results are stored in algorithm state.

step() → None#

Advance optimization and update population and fitness state in place.

Invoke through workflow.step() after initialization. The caller controls termination.

Returns:

None; results are stored in algorithm state.

evomo.algorithms.moead_uraw.algo#