3142 search results - page 153 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
175
click to vote
NCA
2008
IEEE
15 years 3 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
188
click to vote
PROCEDIA
2011
14 years 6 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
122
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
141
Voted
NETWORKS
2007
15 years 2 months ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
167
Voted
AAAI
2011
14 years 3 months ago
2011
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...