Citation
Random Walks And Neighborhood Bias In Oversubscribed Scheduling. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 98-105, 2005.
Paper
Abstract
This paper presents new results showing that a very simple stochastic hill climbing algorithm is as good or better than more complex metaheuristic methods for solving an oversubscribed scheduling problem: scheduling communication contacts on the Air Force Satellite Control Network (AFSCN). The empirical results also suggest that the best neighborhood construction choices produce a search that is largely a greedy random walk of the graph induced by the complete neighborhood.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-098-105-P, author = {M. Roberts and L. D. Whitley and A. E. Howe and L. Barbulescu},
title = {Random Walks And Neighborhood Bias In Oversubscribed Scheduling},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {98--105},
note = {Paper},
abstract = {This paper presents new results showing that a very simple stochastic hill climbing algorithm is as good or better than more complex metaheuristic methods for solving an oversubscribed scheduling problem: scheduling communication contacts on the Air Force Satellite Control Network (AFSCN). The empirical results also suggest that the best neighborhood construction choices produce a search that is largely a greedy random walk of the graph induced by the complete neighborhood.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-098-105-P.pdf} }