Shane T. Mueller, B. Perelman, Yin-Yin Tan, Kejkaew Thanasuan
{"title":"PEBL旅行商问题计算机试验台的研制","authors":"Shane T. Mueller, B. Perelman, Yin-Yin Tan, Kejkaew Thanasuan","doi":"10.7771/1932-6246.1169","DOIUrl":null,"url":null,"abstract":"The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points (“cities”) that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual problem solving ability. The TSP is also similar to a number of tasks commonly used for neuropsychological assessment (such as the trail-making test), and so its utility in assessing reliable individual differences in problem solving has sometimes been examined. Nevertheless, the task has seen little widespread use in clinical and assessment domains, in part because no standard software implementation or item set is widely available with known psychometric properties. In this paper, we describe a computerized version of TSP running in the free and open source Psychology Experiment Building Language (PEBL). The PEBL TSP task is designed to be suitable for use within a larger battery of tests, and to examine both standard and custom TSP node configurations (i.e., problems). We report the results of a series of experiments that help establish the test’s reliability and validity. The first experiment examines test-retest reliability, establishes that the quality of solutions in the TSP are not impacted by mild physiological strain, and demonstrates how solution quality obtained by individuals in a physical version is highly correlated with solution quality obtained in the PEBL version. The second experiment evaluates a larger set of problems, and uses the data to identify a small subset of tests that have maximal coherence. A third experiment examines test-retest reliability of this smaller set that can be administered in about five minutes, and establishes that these problems produce composite scores with moderately high (R = .75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing. Correspondence: Correspondence concerning this article should be addressed to Shane T. Mueller, Department of Cognitive and Learning Sciences, 1400 Townsend Drive, Michigan Technological University, Houghton, MI, 49931, or via email to shanem@mtu.edu.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Development of the PEBL Traveling Salesman Problem Computerized Testbed\",\"authors\":\"Shane T. Mueller, B. Perelman, Yin-Yin Tan, Kejkaew Thanasuan\",\"doi\":\"10.7771/1932-6246.1169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points (“cities”) that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual problem solving ability. The TSP is also similar to a number of tasks commonly used for neuropsychological assessment (such as the trail-making test), and so its utility in assessing reliable individual differences in problem solving has sometimes been examined. Nevertheless, the task has seen little widespread use in clinical and assessment domains, in part because no standard software implementation or item set is widely available with known psychometric properties. In this paper, we describe a computerized version of TSP running in the free and open source Psychology Experiment Building Language (PEBL). The PEBL TSP task is designed to be suitable for use within a larger battery of tests, and to examine both standard and custom TSP node configurations (i.e., problems). We report the results of a series of experiments that help establish the test’s reliability and validity. The first experiment examines test-retest reliability, establishes that the quality of solutions in the TSP are not impacted by mild physiological strain, and demonstrates how solution quality obtained by individuals in a physical version is highly correlated with solution quality obtained in the PEBL version. The second experiment evaluates a larger set of problems, and uses the data to identify a small subset of tests that have maximal coherence. A third experiment examines test-retest reliability of this smaller set that can be administered in about five minutes, and establishes that these problems produce composite scores with moderately high (R = .75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing. Correspondence: Correspondence concerning this article should be addressed to Shane T. Mueller, Department of Cognitive and Learning Sciences, 1400 Townsend Drive, Michigan Technological University, Houghton, MI, 49931, or via email to shanem@mtu.edu.\",\"PeriodicalId\":90070,\"journal\":{\"name\":\"The journal of problem solving\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The journal of problem solving\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7771/1932-6246.1169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The journal of problem solving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7771/1932-6246.1169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
旅行推销员问题(TSP)是一个组合优化问题,要求找到通过一组点(“城市”)返回到起点的最短路径。因为人类为欧几里得问题提供启发式的接近最优解决方案,它有时被用来研究人类视觉解决问题的能力。TSP也类似于一些通常用于神经心理学评估的任务(如轨迹测试),因此它在评估可靠的解决问题的个体差异方面的效用有时得到了检验。然而,这项任务在临床和评估领域几乎没有广泛使用,部分原因是没有标准的软件实现或项目集广泛使用已知的心理测量特性。在本文中,我们描述了一个计算机版本的TSP运行在免费和开源的心理学实验构建语言(PEBL)中。PEBL TSP任务被设计为适合在较大的测试组中使用,并检查标准和自定义TSP节点配置(即问题)。我们报告了一系列实验的结果,以帮助建立测试的信度和效度。第一个实验检验了重测信度,确定了TSP中的溶液质量不受轻度生理应变的影响,并证明了个体在物理版本中获得的溶液质量与在PEBL版本中获得的溶液质量是高度相关的。第二个实验评估了一组更大的问题,并使用这些数据来识别具有最大一致性的一小部分测试。第三个实验检验了这个可以在大约5分钟内完成的小集合的重测信度,并确定了这些问题产生的复合分数具有中等高的重测信度(R = 0.75),使其适用于许多评估情况,包括对个体差异、个性和智力测试的评估。通信:有关本文的通信应发送给Shane T. Mueller,认知和学习科学系,1400 Townsend Drive,密歇根理工大学,Houghton, MI, 49931,或通过电子邮件发送到shanem@mtu.edu。
Development of the PEBL Traveling Salesman Problem Computerized Testbed
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points (“cities”) that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual problem solving ability. The TSP is also similar to a number of tasks commonly used for neuropsychological assessment (such as the trail-making test), and so its utility in assessing reliable individual differences in problem solving has sometimes been examined. Nevertheless, the task has seen little widespread use in clinical and assessment domains, in part because no standard software implementation or item set is widely available with known psychometric properties. In this paper, we describe a computerized version of TSP running in the free and open source Psychology Experiment Building Language (PEBL). The PEBL TSP task is designed to be suitable for use within a larger battery of tests, and to examine both standard and custom TSP node configurations (i.e., problems). We report the results of a series of experiments that help establish the test’s reliability and validity. The first experiment examines test-retest reliability, establishes that the quality of solutions in the TSP are not impacted by mild physiological strain, and demonstrates how solution quality obtained by individuals in a physical version is highly correlated with solution quality obtained in the PEBL version. The second experiment evaluates a larger set of problems, and uses the data to identify a small subset of tests that have maximal coherence. A third experiment examines test-retest reliability of this smaller set that can be administered in about five minutes, and establishes that these problems produce composite scores with moderately high (R = .75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing. Correspondence: Correspondence concerning this article should be addressed to Shane T. Mueller, Department of Cognitive and Learning Sciences, 1400 Townsend Drive, Michigan Technological University, Houghton, MI, 49931, or via email to shanem@mtu.edu.