Grant: Discovery Grants Program - Individual
University of Victoria
$12,144.00
Human performance in optimization tasks
FY 2014-15
Summary
In 1962, the Procter & Gamble company ran a contest in which one prize of $10,000 and 54 prizes of $1,000 were awarded for finding the shortest round-trip route through 33 US cities on Route 66, starting and finishing in Chicago. The total prize had the equivalent purchasing power of approximately half-a-million dollars today. The apparent simplicity of the challenge stands in sharp contrast to the size of the prize.Although simple to state and understand, the problem posed by Procter & Gamble is an instance of a well-known problem in mathematics and computer science known as the Traveling Salesman Problem (TSP). The number of possible round trip routes for TSPs grows rapidly as the number of cities increases. For the Procter & Gamble problem, this number calculates to about 132 billion trillion trillion possible routes, and a computer working at a rate of 10,000 routes per second would take about 417 billion trillion years to find all of them. Neverthless, in spite of the vast array of possible solutions, untrained adults are very good at this type of problem, and would normally be able to find a route just a few percent longer than the shortest in a matter of seconds. In doing so, they frequently outperform computer routines designed to quickly construct good solutions.Cognitive scientists have been investigating the processes that underlie this human skill, with results that are already being applied in testing for Alzheimer's and other forms of neural damage. The proposed research will extend investigation into the psychological processes underlying human performance in this and related tasks.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
155743-2011
Name nom
MacGregor, James
Department département
Public Administration, School of
Organization id
7
Institution établissement
University of Victoria
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
12144
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1502
Committee name en
Biological Systems and Functions
Committee name fr
Systèmes et fonctions biologiques
Area of application code
1210
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Psychology
Area of application fr
Psychologie
Research subject code
6300
Research subject group en
Psychology
Research subject group fr
Psychologie
Research subject en
Psychology
Research subject fr
Psychologie
Partie
4
Nb partie
5
Application title
Human performance in optimization tasks
Keyword
NSERC
Application summary
In 1962, the Procter & Gamble company ran a contest in which one prize of $10,000 and 54 prizes of $1,000 were awarded for finding the shortest round-trip route through 33 US cities on Route 66, starting and finishing in Chicago. The total prize had the equivalent purchasing power of approximately half-a-million dollars today. The apparent simplicity of the challenge stands in sharp contrast to the size of the prize.Although simple to state and understand, the problem posed by Procter & Gamble is an instance of a well-known problem in mathematics and computer science known as the Traveling Salesman Problem (TSP). The number of possible round trip routes for TSPs grows rapidly as the number of cities increases. For the Procter & Gamble problem, this number calculates to about 132 billion trillion trillion possible routes, and a computer working at a rate of 10,000 routes per second would take about 417 billion trillion years to find all of them. Neverthless, in spite of the vast array of possible solutions, untrained adults are very good at this type of problem, and would normally be able to find a route just a few percent longer than the shortest in a matter of seconds. In doing so, they frequently outperform computer routines designed to quickly construct good solutions.Cognitive scientists have been investigating the processes that underlie this human skill, with results that are already being applied in testing for Alzheimer's and other forms of neural damage. The proposed research will extend investigation into the psychological processes underlying human performance in this and related tasks.