Example: marketing

Lecture 9: Multi-Objective - Purdue University

SPEA Clustering Algorithm 1. Initially, each solution belongs to a distinct cluster C i 2. If number of clusters is less than or equal to N, go to 5 3. For each pair of clusters, calculate the cluster distance d ij and find the pair with minimum cluster-distance 4. Merge the two clusters and go to 2 5. Choose only one solution from each cluster ...

Tags:

  Multi, Objectives, Algorithm, Multi objective

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of Lecture 9: Multi-Objective - Purdue University

Related search queries