Papers › LocationReasoner: Evaluating LLMs on Real-World Site Selection Reasoning

LocationReasoner: Evaluating LLMs on Real-World Site Selection Reasoning

16 Jun 2025arXiv:2506.13841archive 2025-07-28

Miho Koda, Yu Zheng, Ruixian Ma, Mingyang Sun, Devesh Pansare, Fabio Duarte, Paolo Santi

Recent advances in large language models (LLMs), particularly those enhanced through reinforced post-training, have demonstrated impressive reasoning capabilities, as exemplified by models such as OpenAI o1 and DeepSeek-R1. However, these capabilities are predominantly benchmarked on domains like mathematical problem solving and code generation -- leaving open the question of whether such reasoning skills generalize to complex, real-world scenarios. In this paper, we introduce LocationReasoner, a benchmark designed to evaluate LLMs' reasoning abilities in the context of real-world site selection, where models must identify feasible locations by reasoning over diverse and complicated spatial, environmental, and logistical constraints. The benchmark comprises over 300 carefully crafted queries of varying difficulty levels, supported by a sandbox environment with in-house tools for constraint-based location search. Extensive evaluations reveal that state-of-the-art reasoning models offer limited improvement over their non-reasoning predecessors in real-world contexts, with even the latest OpenAI o4 model failing on 30% of site selection tasks. Moreover, agentic strategies such as ReAct and Reflexion often suffer from over-reasoning, leading to worse outcomes than direct code-generation prompting. With key limitations of LLMs in holistic and non-linear reasoning highlighted, we release LocationReasoner to foster the development of LLMs and agents capable of robust, grounded reasoning in real-world decision-making tasks. Codes and data for our benchmark are available at https://github.com/miho-koda/LocationReasoner.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2506.13841")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

miho-koda/locationreasoner officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 11 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from miho-koda/LocationReasoner. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

clean_code_string miho-koda/LocationReasoner/code/executors/code_task_executor.py official repository unverified no licence file found · pointer only · 00fda2704b022424 · report
clean_code_string miho-koda/LocationReasoner/code/executors/complex_task_executor.py official repository unverified no licence file found · pointer only · 69bd58f5c3d58a5d · report
clean_code_string miho-koda/locationreasoner/code/executors/run_harder.py official repository unverified no licence file found · pointer only · a8bf6e1766e37ae5 · report
combine_zone_sets miho-koda/LocationReasoner/code/executors/complex_task_executor.py official repository unverified no licence file found · pointer only · 1c85fe06d9836515 · report
compare_zones miho-koda/LocationReasoner/code/executors/claude_code_executor.py official repository unverified no licence file found · pointer only · ab16d163be8d585c · report
extract_python_code miho-koda/LocationReasoner/code/core/router.py official repository unverified no licence file found · pointer only · 474e1d327bf447c9 · report
get_logistics_path miho-koda/LocationReasoner/code/executors/city_batch_executor.py official repository unverified no licence file found · pointer only · 71f61c43e0e66b0c · report
load_config miho-koda/LocationReasoner/code/config_utils.py official repository unverified no licence file found · pointer only · 5b813380b449d9ec · report
make_runner_script miho-koda/LocationReasoner/code/executors/run_harder.py official repository unverified no licence file found · pointer only · 288e94e2e03d35d5 · report
resolve_paths miho-koda/LocationReasoner/code/config_utils.py official repository unverified no licence file found · pointer only · eadcd2834f643642 · report
run_claude_code miho-koda/LocationReasoner/code/executors/claude_code_executor.py official repository unverified no licence file found · pointer only · afdd65ea18e2ba86 · report

Tasks

Code GenerationMathematical Problem-Solving

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections