Development of the PEBLebl 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 s...
Gespeichert in:
Veröffentlicht in: | The journal of problem solving 2015-02, Vol.8 (1), p.64 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 1 |
container_start_page | 64 |
container_title | The journal of problem solving |
container_volume | 8 |
creator | Mueller, Shane T Perelman, Brandon S Tan, Yin Yin Thanasuan, Kejkaew |
description | 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 = 0.75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing. |
doi_str_mv | 10.7771/1932-6246.1169 |
format | Article |
fullrecord | <record><control><sourceid>eric</sourceid><recordid>TN_cdi_eric_primary_EJ1103762</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ericid>EJ1103762</ericid><sourcerecordid>EJ1103762</sourcerecordid><originalsourceid>FETCH-eric_primary_EJ11037623</originalsourceid><addsrcrecordid>eNqFik8LgjAchkcUZH-u3YJ9AW3TmnjNjJAOQt5l5s8yNifbCurT5yGiW6f34XlehBaUeGEY0hWNAt9l_pp5lLJogJyvGP7wGE2MuRHCGNtQB6U7eIBQnYTWYlVjewWcJdsjlALnmvetaS_4xAUYyVucaVUKkDhWsrtb0M0LKpyDsSVUMzSquTAw_-wULfdJHh_c_nYuOt1Irp9FklJKgpD5wb_-Bjn4PXw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Development of the PEBLebl Traveling Salesman Problem Computerized Testbed</title><source>Purdue University Press Journals</source><source>Education Source (EBSCOhost)</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Mueller, Shane T ; Perelman, Brandon S ; Tan, Yin Yin ; Thanasuan, Kejkaew</creator><creatorcontrib>Mueller, Shane T ; Perelman, Brandon S ; Tan, Yin Yin ; Thanasuan, Kejkaew</creatorcontrib><description>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 = 0.75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing.</description><identifier>ISSN: 1932-6246</identifier><identifier>EISSN: 1932-6246</identifier><identifier>DOI: 10.7771/1932-6246.1169</identifier><language>eng</language><publisher>Purdue University Press</publisher><subject>Cognitive Processes ; Comparative Analysis ; Computer Assisted Testing ; Computer Software ; Computer Software Reviews ; Computer System Design ; Correlation ; Feedback (Response) ; Michigan ; Military Personnel ; Pretests Posttests ; Psychology ; Psychometrics ; Regression (Statistics) ; Replication (Evaluation) ; Sales Occupations ; Salesmanship ; Science Experiments ; Task Analysis ; Test Reliability ; Test Validity ; Undergraduate Students ; Wyoming</subject><ispartof>The journal of problem solving, 2015-02, Vol.8 (1), p.64</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids><backlink>$$Uhttp://eric.ed.gov/ERICWebPortal/detail?accno=EJ1103762$$DView record in ERIC$$Hfree_for_read</backlink></links><search><creatorcontrib>Mueller, Shane T</creatorcontrib><creatorcontrib>Perelman, Brandon S</creatorcontrib><creatorcontrib>Tan, Yin Yin</creatorcontrib><creatorcontrib>Thanasuan, Kejkaew</creatorcontrib><title>Development of the PEBLebl Traveling Salesman Problem Computerized Testbed</title><title>The journal of problem solving</title><description>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 = 0.75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing.</description><subject>Cognitive Processes</subject><subject>Comparative Analysis</subject><subject>Computer Assisted Testing</subject><subject>Computer Software</subject><subject>Computer Software Reviews</subject><subject>Computer System Design</subject><subject>Correlation</subject><subject>Feedback (Response)</subject><subject>Michigan</subject><subject>Military Personnel</subject><subject>Pretests Posttests</subject><subject>Psychology</subject><subject>Psychometrics</subject><subject>Regression (Statistics)</subject><subject>Replication (Evaluation)</subject><subject>Sales Occupations</subject><subject>Salesmanship</subject><subject>Science Experiments</subject><subject>Task Analysis</subject><subject>Test Reliability</subject><subject>Test Validity</subject><subject>Undergraduate Students</subject><subject>Wyoming</subject><issn>1932-6246</issn><issn>1932-6246</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNqFik8LgjAchkcUZH-u3YJ9AW3TmnjNjJAOQt5l5s8yNifbCurT5yGiW6f34XlehBaUeGEY0hWNAt9l_pp5lLJogJyvGP7wGE2MuRHCGNtQB6U7eIBQnYTWYlVjewWcJdsjlALnmvetaS_4xAUYyVucaVUKkDhWsrtb0M0LKpyDsSVUMzSquTAw_-wULfdJHh_c_nYuOt1Irp9FklJKgpD5wb_-Bjn4PXw</recordid><startdate>201502</startdate><enddate>201502</enddate><creator>Mueller, Shane T</creator><creator>Perelman, Brandon S</creator><creator>Tan, Yin Yin</creator><creator>Thanasuan, Kejkaew</creator><general>Purdue University Press</general><scope>7SW</scope><scope>BJH</scope><scope>BNH</scope><scope>BNI</scope><scope>BNJ</scope><scope>BNO</scope><scope>ERI</scope><scope>PET</scope><scope>REK</scope><scope>WWN</scope></search><sort><creationdate>201502</creationdate><title>Development of the PEBLebl Traveling Salesman Problem Computerized Testbed</title><author>Mueller, Shane T ; Perelman, Brandon S ; Tan, Yin Yin ; Thanasuan, Kejkaew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-eric_primary_EJ11037623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Cognitive Processes</topic><topic>Comparative Analysis</topic><topic>Computer Assisted Testing</topic><topic>Computer Software</topic><topic>Computer Software Reviews</topic><topic>Computer System Design</topic><topic>Correlation</topic><topic>Feedback (Response)</topic><topic>Michigan</topic><topic>Military Personnel</topic><topic>Pretests Posttests</topic><topic>Psychology</topic><topic>Psychometrics</topic><topic>Regression (Statistics)</topic><topic>Replication (Evaluation)</topic><topic>Sales Occupations</topic><topic>Salesmanship</topic><topic>Science Experiments</topic><topic>Task Analysis</topic><topic>Test Reliability</topic><topic>Test Validity</topic><topic>Undergraduate Students</topic><topic>Wyoming</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mueller, Shane T</creatorcontrib><creatorcontrib>Perelman, Brandon S</creatorcontrib><creatorcontrib>Tan, Yin Yin</creatorcontrib><creatorcontrib>Thanasuan, Kejkaew</creatorcontrib><collection>ERIC</collection><collection>ERIC (Ovid)</collection><collection>ERIC</collection><collection>ERIC</collection><collection>ERIC (Legacy Platform)</collection><collection>ERIC( SilverPlatter )</collection><collection>ERIC</collection><collection>ERIC PlusText (Legacy Platform)</collection><collection>Education Resources Information Center (ERIC)</collection><collection>ERIC</collection><jtitle>The journal of problem solving</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mueller, Shane T</au><au>Perelman, Brandon S</au><au>Tan, Yin Yin</au><au>Thanasuan, Kejkaew</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><ericid>EJ1103762</ericid><atitle>Development of the PEBLebl Traveling Salesman Problem Computerized Testbed</atitle><jtitle>The journal of problem solving</jtitle><date>2015-02</date><risdate>2015</risdate><volume>8</volume><issue>1</issue><spage>64</spage><pages>64-</pages><issn>1932-6246</issn><eissn>1932-6246</eissn><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 = 0.75) test-retest reliability, making it suitable for use in many assessment situations, including evaluations of individual differences, personality, and intelligence testing.</abstract><pub>Purdue University Press</pub><doi>10.7771/1932-6246.1169</doi><tpages>27</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1932-6246 |
ispartof | The journal of problem solving, 2015-02, Vol.8 (1), p.64 |
issn | 1932-6246 1932-6246 |
language | eng |
recordid | cdi_eric_primary_EJ1103762 |
source | Purdue University Press Journals; Education Source (EBSCOhost); EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
subjects | Cognitive Processes Comparative Analysis Computer Assisted Testing Computer Software Computer Software Reviews Computer System Design Correlation Feedback (Response) Michigan Military Personnel Pretests Posttests Psychology Psychometrics Regression (Statistics) Replication (Evaluation) Sales Occupations Salesmanship Science Experiments Task Analysis Test Reliability Test Validity Undergraduate Students Wyoming |
title | Development of the PEBLebl Traveling Salesman Problem Computerized Testbed |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T03%3A13%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-eric&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Development%20of%20the%20PEBLebl%20Traveling%20Salesman%20Problem%20Computerized%20Testbed&rft.jtitle=The%20journal%20of%20problem%20solving&rft.au=Mueller,%20Shane%20T&rft.date=2015-02&rft.volume=8&rft.issue=1&rft.spage=64&rft.pages=64-&rft.issn=1932-6246&rft.eissn=1932-6246&rft_id=info:doi/10.7771/1932-6246.1169&rft_dat=%3Ceric%3EEJ1103762%3C/eric%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ericid=EJ1103762&rfr_iscdi=true |