Edmund K. Burke
and Graham Kendall (eds.)Search Methodologies2nd ed.
2014Introductory
Tutorials in Optimization and Decision Support
Techniques10.1007/978-1-4614-6940-7©
Springer Science+Business Media New York 2014
Index
acceleration coefficients
acceptance probability
ACO, see ant algorithms
adaptive
heuristics
immune system
ADF, see automatically defined
functions
adjacency matrix
affinity measure
agents
Alice
alldifferent constraint
alleles
amplitude spectrum
ancillary tests
ant algorithms
candidate lists
changing α, β values
lookahead
lower bounds
moving direction
repelling pheromone
stagnation recovery
antibody
antigen
aperiodic
approximate evaluation
approximate rule
approximation algorithms
approximation scheme
approximation strategies
APX
arc consistency
architecture
architecture-altering operations
artificial immune systems
auto-immune attacks
B-cells
cellular
cellular immunity
encoding
immune network theory
immunological memory
initialization
innate
self cells
T-cells
artificial intelligence
aspiration criteria
association rules
asymmetric
asymmetric distance measure
asymmetric matrix
attributes
autocorrelation
automatically defined functions
auxiliary objectives
axes of a search space
B-cells
backpropagation algorithm
backtrack search
complete backtrack search
complete randomized
intelligent
backtrack-free
backtracking
backward recursion
base formulation
basin of attraction
batch mode of training
Bayesian learning
Bellman’s principle
best improvement
best-bound search
best-first strategy
best-of-generation
big-M model
bin packing
binary variables
bioinformatics
bird flocking
bloat
blossom algorithm
Boltzmann
constant
distribution
Boolean satisfiability
boosting
bottom-up learning
bounding argument
branch and backtrack
branch and bound
parameters
branch and price
branching strategy
breadth-first search
Bron and Kerbosch algorithm
Brown’s algorithm
building blocks
exchange
identification
C4.5
candidate list
candidate solutions
cantilever plate design
Cartesian inner product of fuzzy sets
certain rules
chess
chromosome
Cigol
classical set
classical techniques
classification
tree
clique
clonal selection
closure
CLP
co-domain
co-evolutionary learning
collapsed matrix
combinatorial optimization
competent GAs
competition complexity
complement A
complementarity property
complementary slackness
complex systems theory
complexity theory
computer programs
computer security problems
condition attributes
condition profile
connection weights
constraining structures
constraint
databases
explicit
generation
hard
implicit
logic programming
matrix
programming
propagation
satisfaction problems
soft
constraints and graphics
construction method
constructive heuristic
constructive method
continual improvement
continuous
diversification
function
optimization
control parameter
convex
function
hull
cooling schedule
cooperative swarms
CPSO optimizer
split swarm
crossover
k
-point
cycle
one-point
order-based
partially matched
two-point
uniform order-based
crowded tournament selection
crowding distance metric
curse of dimensionality
cuts
cutting and packing
CX, see crossover
cyclic network
danger theory
Darwinian
evolution
selection
data mining
decision
attributes
classes
making
problem
profile
rules
tree
variable
variable space
decomposition
principled efficiency-enhancement
technique
defuzzification unit
center of sums technique
centroid method
centroid technique
mean of maximum technique
degree of certainty
delete-all
denial-of-service attacks
density estimation
depth-first
design innovation
deterministic
polynomial
differential calculus
direct encoding of neural networks
direction of branching
discrete
function
binary PSO algorithm
function
distance-to-target diagrams
distinct eigenvalues
distributed processing
distribution of neighborhoods
diversification
generation method
dominance
cones
relation
without degrees of preference
dominance-based rough set approach
domination
definition
doubtful region
DRSA
DSATUR
dual variables
duality
dual value
dual problem
dual simplex
dynamic
programming
cooling schedules
heuristics
programming
ECLiPSe
elementary sets
elitism strategy
elitist solutions
EMO
a posteriori approach
a priori approach
cantilever plate design
GPU computing
interactive approach
many objectives
non-evolutionary approaches
parallel implementation
post-optimality studies
redundant objectives
research challenges
spacecraft trajectory design
theoretical studies
ensemble learning
entropy
enumeration
Euclidean distance
evaluation
difficulty of a problem
function
performance of previous algorithms
performance of previous heuristics
relaxation
search algorithms
evolution
connection weights
of architectures
of learning rules
strategies
evolutionary
fuzzy logic systems
learning
neural networks
programming
exact algorithm
exact methods
exchangeable
attribute
criteria
exhaustive search
expanded formulation
facility location
fail first
feasible solution
financial decision support system
finite element method
finite-state machines
firewall
first improvement strategy
fish schooling
fitness
function
inheritance
landscapes
an example
empirical studies
mathematical characterization
practical applications
measure
of a neural network
proportionate selection
fixed charge
flow-augmenting chains
Floyd’s shortest path algorithm
Ford–Fulkerson algorithm
forward recursion
fully polynomial time approximation
scheme
fuzzy
adaptive control schemes
CSPs
implication
inference system
defuzzification unit
logic
measures
relation
set composition
set operations
sets
similarity measures
systems
modeling
stability
fuzzy reasoning
GA, see genetic algorithm
gene
deletion
duplication
generalization test
generation probability
genes
genetic algorithm
relaxation
genetic programming
developmental
probabilistic
theory
genotype
global constraints
global optimum
globally Pareto-optimal set
Gomory–Chvátal procedure
GP, see genetic programming
gradient descent algorithm
granulation
granules of knowledge
graph
algorithms
bipartite
coloring
complete
eigensystem
partitioning
problem
representation
theory
GRASP
Gray code
greedy
algorithms
approximation algorithms
construction
heuristic
knapsack
MAX-CUT
MAX-SAT
solution
vertex cover
grow initialization method
H-means
HAL
Hamming
distance
landscape
Heaviside function
Hebbian learning rule
hedge, see transformation operator
heuristics
generation
hill climbing
homogeneous
Hopfield networks
human-competitive
hyper-heuristics
hybrid
hypervolume
ideal point
idiotypic networks
inclusion property
incomplete search technique
independent variables
indicator function
indirect encoding of neural networks
indiscernibility relation
indispensable
attribute
criteria
inductive learning
inductive logic programming
inertia weight
infeasible solutions
inference methods
inference rules
infix notation
information
gain
theory
transfer
inhomogeneous algorithm
initial random population
initial solution
initialization
innovation
innovization
automated procedure
integer programming
integer quantities
intensification
interchangeability
interior point
intermediate vectors
intermediate-term memory
interpolation
intersection
intractable
invariant
inverse consistency
inverse problem
irreducible
iterative improvement
job shop scheduling
K-means
kilter
diagram
line
knapsack
binary knapsack problem
bounded knapsack problem
maximum fraction
maximum integer
minimum integer
problem
unbounded
Lagrangian relaxation
Laplacian matrix
learning
algorithms
Bayesian
bottom-up
chess play learning
classifier systems
decision-tree
element
methods
reinforcement
robot learning
sample
sequence of actions
top-down
level of confidence
limited discrepancy search
linear propagation
linear relaxation
linearly separable
Lisp S-expressions
local optimum
local search
locally Pareto-optimal set
logic programming
logical constraints
long-term memory
look-ahead
lower approximation
lower bound
machine learning
makespan
Markov chains
matching function
matching problem
matheuristics
mating pool
MAX-Ak-SAT
max-closure
max-CSP problem
MAX-CUT problem
MAX-SAT
maximum
diversity problem
flow problem
weighted independent set
McCulloch–Pitts neurons
MCDM
mean square error
membership function
Π
Gaussian
monotonically decreasing
monotonically increasing
trapezoid
triangular
memetic algorithm
metaheuristics
Metropolis algorithm
min-conflicts heuristic
minimal domain size
minimum
cost flow problem
job scheduling
sum-of-squares clustering
vertex cover
mixed integer programming
modern heuristics, see metaheuristics
modifier, see transformation operator
MOEAs
Monte Carlo
MOOP, see multi-objective optimization
Problem
multi-attribute
multi-objective optimization
ε -constraint approach
classical approach
differences from single-objective
optimization
ideal approach
preference-based approach
principles
weighted-sum approach
multi-objectivization
multicriteria
multigraded dominance
multilayer feedforward neural networks
multimodal landscapes
multistage programming
mutation
probability
nadir point
negative dominance cone
negative selection
neighbor
neighborhood
graph
search
very large scale
structure
network
flow
flow programming
management
simplex algorithm
neural networks
no free lunch
node potentials
non-dominated
front
set
solutions, procedure to identify
sorting
non-parametric estimates
NP-complete
NP-hard
NSGA-II
objective
function
objective normalization
objective space
off-policy
on-policy
online
operational research
operations research
OPL
optimal solutions
optimization, see combinatorial optimization
algorithm
ordinal selection
out-of-kilter
outranking
P
P
-boundary
P
-dominated set
P
-lower approximation
P
-rough set
P
-upper approximation
p
-median
parallel
algorithm
search strategy
parallelization
parameter
calibration
optimization
parental solutions
Pareto
optimal solutions
partial order
partial solutions
particle swarm optimization
adaptive PSO
advanced features
controlling diversity
convergence enforcement
maximum velocity
neighborhood best velocity update
PSO algorithm
queen particle
simplified PSO
stagnation recovery
partitioning
path
consistency
relinking
tracing
pathogen
pattern classification
PCPs, see probabalistically checkable
proofs
Pearson correlation coefficient
penalty function
perceptron learning
perfect graph
permutation
closure
code
matrix
problems
personnel scheduling
PESA
phenotype
pheromone
best–worst
matrix
update
values
plant location problem
plug flow tubular reactor case study
PMX
polynomial time
algorithm
approximation scheme
verifier
population
matrix
matrix update
population-based ACO
size
positive dominance cone
predictive system
prefix notation
primal
primal simplex
primal–dual method
principle of optimality, see Bellman’s principle
prior knowledge
probabilistic safety factor
probabilistically checkable proofs
probabilistically selected
probability distribution
probability space
problem-specific repair mechanism
production planning problem
production scheduling
propagation
proportional-differential-like fuzzy
controller
proportional-integral-like fuzzy
controller
protected division
pruning
PSO, see particle swarm optimization
PTAS, see polynomial time approximation
scheme
Q
-learning
quality measure
quality of approximation
queens problem
random
3SAT
binary template
bouncing
constants
crossover
cut
enumeration
initial weights
jump
MAX-SAT solution
number
restart
sampling
search
selection
solution
value
variable
walk
randomization
ranking selection
real-time decision problem
recombination
landscapes
operators
sexual
recursive relationship
reduced VNS
reduct
reducts
redundant criteria
reflexive
regression
tree
reinforcement learning
relaxation
repair
replacement
reproduction
resource allocation
restart diversification
robustness
rough approximation
rough sets
certain
certain knowledge
certain rules
dominance-based approach
formal description
fundamentals
illustrative example
indiscernibility-based approach
indiscernibility-based approach
uncertain knowledge
roulette wheel
routing
rule base design
heuristic
systematic
rules
induction of
running metric
Sarsa learning algorithm
scatter search
diversification generation
improvement
reference set update
solution combination
subset generation
schema theorem
search space
selection
selection-intensity models
self-adaptive systems
separation
sequencing problems
sequential
algorithms
job scheduling
mode of training
shaking
short-term memory
shortest path
SICStus
similarity
classes
measure
simplex
simulated annealing
single machine total weighted tardiness
problem
skewed VNS
social insect colonies
spacecraft trajectory design
SPEA2
staff planning
states
steady state
steepest descent
stochastic
element
noise
programming
search algorithm
universal selection
variable
stopping criterion
strategic oscillation
subcomponent complexity
subjective function
sum-of-squares clustering
superfluous attribute
supervised learning
supply chain management
surrogate objectives
survival of the fittest
swapping probability
swarm intelligence
symbolic regression
synapse
syntax, see tree, syntax
tabu
list
length
search
multiple tabu list
probabilistic
recency memory
tenure
takeover time models
task scheduling
Tchebycheff catastrophe
temperature
temporal difference learning
terminal
node
set
termination criterion
test function
thrashing behavior
threshold function
threshold methods
time continuation
time-independent
timetabling
top-down learning
tournament selection
tractability
trade-off solutions
transfer functions
transformation operator
transitive
transportation
assignment
cost
problem
traveling salesman problem
minimum
tree
rooted point-labeled program
syntax
truncation selection
TSP, see traveling salesman problem
Turing
machine
two-dimensional cutting problems
uncertain knowledge
uniform probability
unimodal landscapes
unimodular
union ∪
unsupervised learning
update
upper approximation
upper bound
utility service optimization
utopian point
variable
generation
neighborhood search
reduced
skewed
variable neighborhood descent
VNS within exact algorithm
precision rough set approach
vehicle routing
Visual CHIP
VNDS
VNS, see variable neighborhood search
Vogel’s approximation method
waiting-time model
weak preference relation
weighted maximum satisfiability
weighted-sum approach
Y
-reduct
zero-argument functions
Zykov’s algorithm