-
Notifications
You must be signed in to change notification settings - Fork 37
/
ConstructionHeuristicType.java
126 lines (119 loc) · 4.29 KB
/
ConstructionHeuristicType.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/*
* Copyright 2014 Red Hat, Inc. and/or its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.optaplanner.core.config.constructionheuristic;
import org.optaplanner.core.config.heuristic.selector.entity.EntitySorterManner;
import org.optaplanner.core.config.heuristic.selector.value.ValueSorterManner;
public enum ConstructionHeuristicType {
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
FIRST_FIT,
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
FIRST_FIT_DECREASING,
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
WEAKEST_FIT,
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
WEAKEST_FIT_DECREASING,
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
STRONGEST_FIT,
/**
* A specific form of {@link #ALLOCATE_ENTITY_FROM_QUEUE}.
*/
STRONGEST_FIT_DECREASING,
/**
* Put all entities in a queue.
* Assign the first entity (from that queue) to the best value.
* Repeat until all entities are assigned.
*/
ALLOCATE_ENTITY_FROM_QUEUE,
/**
* Put all values in a round-robin queue.
* Assign the best entity to the first value (from that queue).
* Repeat until all entities are assigned.
*/
ALLOCATE_TO_VALUE_FROM_QUEUE,
/**
* A specific form of {@link #ALLOCATE_FROM_POOL}.
*/
CHEAPEST_INSERTION,
/**
* Put all entity-value combinations in a pool.
* Assign the best entity to best value.
* Repeat until all entities are assigned.
*/
ALLOCATE_FROM_POOL;
public EntitySorterManner getDefaultEntitySorterManner() {
switch (this) {
case FIRST_FIT:
case WEAKEST_FIT:
case STRONGEST_FIT:
return EntitySorterManner.NONE;
case FIRST_FIT_DECREASING:
case WEAKEST_FIT_DECREASING:
case STRONGEST_FIT_DECREASING:
return EntitySorterManner.DECREASING_DIFFICULTY;
case ALLOCATE_ENTITY_FROM_QUEUE:
case ALLOCATE_TO_VALUE_FROM_QUEUE:
case CHEAPEST_INSERTION:
case ALLOCATE_FROM_POOL:
return EntitySorterManner.DECREASING_DIFFICULTY_IF_AVAILABLE;
default:
throw new IllegalStateException("The constructionHeuristicType (" + this + ") is not implemented.");
}
}
public ValueSorterManner getDefaultValueSorterManner() {
switch (this) {
case FIRST_FIT:
case FIRST_FIT_DECREASING:
return ValueSorterManner.NONE;
case WEAKEST_FIT:
case WEAKEST_FIT_DECREASING:
return ValueSorterManner.INCREASING_STRENGTH;
case STRONGEST_FIT:
case STRONGEST_FIT_DECREASING:
return ValueSorterManner.DECREASING_STRENGTH;
case ALLOCATE_ENTITY_FROM_QUEUE:
case ALLOCATE_TO_VALUE_FROM_QUEUE:
case CHEAPEST_INSERTION:
case ALLOCATE_FROM_POOL:
return ValueSorterManner.INCREASING_STRENGTH_IF_AVAILABLE;
default:
throw new IllegalStateException("The constructionHeuristicType (" + this + ") is not implemented.");
}
}
/**
* @return {@link ConstructionHeuristicType#values()} without duplicates (abstract types that end up behaving as one of the other types).
*/
public static ConstructionHeuristicType[] getBluePrintTypes() {
return new ConstructionHeuristicType[] {
FIRST_FIT,
FIRST_FIT_DECREASING,
WEAKEST_FIT,
WEAKEST_FIT_DECREASING,
STRONGEST_FIT,
STRONGEST_FIT_DECREASING,
CHEAPEST_INSERTION
};
}
}