An adaptive framework for solving multiple hard problems under time constraints

Authors:
Sandip Aine;Rajeev Kumar;P. P. Chakrabarti
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, India;Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, India;Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, India
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 6
Cited 1

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Computation and action under bounded resources

Computation and action under bounded resources
Deliberation scheduling for problem solving in time-constrained environments

Artificial Intelligence
Monitoring and control of anytime algorithms: a dynamic programming approach

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Parameter control in evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of building an integrated meta-level framework for time deliberation and parameter control for a system solving a set of hard problems. The trade-off is between the solution qualities achieved for individual problems and the global outcome under the given time-quality constraints. Each problem is modeled as an anytime optimization algorithm whose quality-time performance varies with different control parameter settings. We use the proposed meta-level strategy for generating a deliberation schedule and adaptive cooling mechanism for anytime simulated annealing (ASA) solving hard task sets. Results on task sets comprising of the traveling salesman problem (TSP) instances demonstrate the efficacy of the proposed control strategies.