NDLI: Predicting optimal solution cost with conditional probabilities : Predicting optimal solution cost

Content Provider	Springer Nature Link
Author	Stern, Roni Zilles, Sandra Lelis, Levi H. S. Felner, Ariel Holte, Robert C.
Copyright Year	2014
Abstract	Heuristic search algorithms are designed to return an optimal path from a start state to a goal state. They find the optimal solution cost as a side effect. However, there are applications in which all one wants to know is an estimate of the optimal solution cost. The actual path from start to goal is not initially needed. For instance, one might be interested in quickly assessing the monetary cost of a project for bidding purposes. In such cases only the cost of executing the project is required. The actual construction plan could be formulated later, after bidding. In this paper we propose an algorithm, named Solution Cost Predictor (SCP), that accurately and efficiently predicts the optimal solution cost of a problem instance without finding the actual solution. While SCP can be viewed as a heuristic function, it differs from a heuristic conceptually in that: 1) SCP is not required to be fast enough to guide search algorithms; 2) SCP is not required to be admissible; 3) our measure of effectiveness is the prediction accuracy, which is in contrast to the solution quality and number of nodes expanded used to measure the effectiveness of heuristic functions. We show empirically that SCP makes accurate predictions on several heuristic search benchmarks.
Ending Page	295
Page Count	29
Starting Page	267
File Format	PDF
ISSN	10122443
e-ISSN	15737470
Journal	Annals of Mathematics and Artificial Intelligence
Issue Number	3-4
Volume Number	72
Language	English
Publisher	Springer International Publishing
Publisher Date	2014-10-03
Publisher Place	Cham
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Type systems Problem solving (heuristics, search strategies, etc.) Computer Science Artificial Intelligence (incl. Robotics) Randomized algorithms Approximation algorithms Optimal solution cost prediction Mathematics Heuristic search Statistical Physics, Dynamical Systems and Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Set-structured and cost-sharing heuristics for classical planning

Heuristics as Markov chains

Experimental evaluation of pheromone models in ACOPlan

Optimization of heuristic search using recursive algorithm selection and reinforcement learning

Improving local-search metaheuristics through look-ahead policies

Improving the anytime behavior of two-phase local search

On the investigation of hyper-heuristics on a financial forecasting problem

POPMUSIC as a matheuristic for the berth allocation problem

Argumentation frameworks as constraint satisfaction problems

Predicting optimal solution cost with conditional probabilities : Predicting optimal solution cost

Similar Documents

Set-structured and cost-sharing heuristics for classical planning

Heuristics as Markov chains

Experimental evaluation of pheromone models in ACOPlan

Optimization of heuristic search using recursive algorithm selection and reinforcement learning

Improving local-search metaheuristics through look-ahead policies

Improving the anytime behavior of two-phase local search

On the investigation of hyper-heuristics on a financial forecasting problem

POPMUSIC as a matheuristic for the berth allocation problem

Argumentation frameworks as constraint satisfaction problems

Predicting optimal solution cost with conditional probabilities : Predicting optimal solution cost