On the public citation graph

A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance

https://doi.org/10.1016/j.cor.2022.105831
0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-0526(199705/06)2:5<39::aid-cplx8>3.0.co;2-lopenalex-snapshot
An introduction to genetic algorithms
inferredcites →https://doi.org/10.1002/net.21746openalex-snapshot
The vehicle routing problem with drones: Extended models and connections
inferredcites →https://doi.org/10.1007/978-0-387-39934-8openalex-snapshot
Perspectives in Operations Research
inferredcites →https://doi.org/10.1007/978-0-387-77778-8openalex-snapshot
The Vehicle Routing Problem: Latest Advances and New Challenges
inferredcites →https://doi.org/10.1016/0166-218x(94)90008-6openalex-snapshot
Approximation algorithms for the geometric covering salesman problem
inferredcites →https://doi.org/10.1016/j.cor.2016.09.003openalex-snapshot
A novel discretization scheme for the close enough traveling salesman problem
inferredcites →https://doi.org/10.1016/j.cor.2018.07.023openalex-snapshot
A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/j.ejor.2017.07.024openalex-snapshot
A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
inferredcites →https://doi.org/10.1016/s0196-6774(03)00047-6openalex-snapshot
Approximation algorithms for TSP with neighborhoods in the plane
inferredcites →https://doi.org/10.1109/tkde.2007.1062openalex-snapshot
On the Optimal Robot Routing Problem in Wireless Sensor Networks
inferredcites →https://doi.org/10.1137/0206041openalex-snapshot
An Analysis of Several Heuristics for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/ics.2011.0004openalex-snapshot
A Steiner-Zone Heuristic for Solving the Close-Enough Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/ijoc.2013.0574openalex-snapshot
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/ijoc.2016.0711openalex-snapshot
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/ijoc.2020.0962openalex-snapshot
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.45.4.568openalex-snapshot
The Covering Tour Problem
inferredcites →https://doi.org/10.1287/trsc.23.3.208openalex-snapshot
The Covering Salesman Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4668701openalex-extracted
A Parallel Genetic Algorithm for Multi-Criteria Path Routing on Complex Real-World Road Networks
inferred← citeshttps://doi.org/10.1002/net.22214openalex-snapshot
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters
inferred← citeshttps://doi.org/10.1007/s00521-025-11706-4openalex-snapshot
Scalable parallel memetic algorithms for large close-enough traveling salesman problems
inferred← citeshttps://doi.org/10.1007/s10732-025-09553-6openalex-snapshot
An adaptive variable neighborhood search for the traveling salesman problem with job-times
inferred← citeshttps://doi.org/10.1007/s12530-023-09524-xopenalex-snapshot
Spherical vector-based artificial gorilla troops optimization for spherical asymmetric multiple traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s13177-026-00642-9openalex-snapshot
Solving the Life Detector Routing Problem over a Street Network: A Multi-Start-based Approach
inferred← citeshttps://doi.org/10.1007/s13369-024-09369-9openalex-snapshot
Optimization of UAV Flight Paths in Multi-UAV Networks for Efficient Data Collection
inferred← citeshttps://doi.org/10.1016/j.apenergy.2024.124092openalex-snapshot
Power line routing design by GIS-driven fuzzy traveling salesman problem-binary integer programming for green energy integration
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.111266openalex-snapshot
An effective memetic algorithm for the close-enough traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.112559openalex-snapshot
A parallel genetic algorithm for multi-criteria path routing on complex real-world road networks
inferred← citeshttps://doi.org/10.1016/j.compag.2023.108446openalex-snapshot
Path planning method for Camellia oleifera forest trenching operation based on human-robot collaboration
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.010openalex-snapshot
The generalized close enough traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.05.032openalex-snapshot
On solving close enough orienteering problems with overlapped neighborhoods
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.08.001openalex-snapshot
On the service time in the close-enough traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.120879openalex-snapshot
Emergent multipath COVID-19 specimen collection problem with green corridor through variable length GA
inferred← citeshttps://doi.org/10.1016/j.iswa.2025.200586openalex-snapshot
New Harris Hawks algorithms for the Close-Enough Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.jclepro.2024.144100openalex-snapshot
Optimizing and evaluating the performance of integrated supply production centers: A hybrid heuristic-simulation applied to olive oil waste circular supply chains
inferred← citeshttps://doi.org/10.1016/j.nexus.2026.100771openalex-snapshot
Cooling techniques for photovoltaic/thermal systems: A critical review of performance, exergy analysis, maintenance strategies and AI-applications
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2024.120140openalex-snapshot
The Travelling Schnauzer Problem: Mission planning for heterogeneous vehicles with distance constraints
inferred← citeshttps://doi.org/10.1016/j.rser.2024.114342openalex-snapshot
Photovoltaic systems operation and maintenance: A review and future directions
inferred← citeshttps://doi.org/10.1049/rpg2.12774openalex-snapshot
A techno‐economic model for enhancing PV hosting capacity through capabilities of smart inverters and soft open points
inferred← citeshttps://doi.org/10.1109/access.2024.3418072openalex-snapshot
Fast Obstacle Avoidance Path Generation Algorithm for Multi-Target Point Coverage Traversal
inferred← citeshttps://doi.org/10.1109/cai59869.2024.00221openalex-snapshot
Route Planning through Genetic Algorithm for Multi-Axis Motion Control
inferred← citeshttps://doi.org/10.1109/infocomwkshps61880.2024.10620865openalex-snapshot
Optimal Route Planning of an Unmanned Aerial Vehicle for Data Collection of Agricultural Sensors
inferred← citeshttps://doi.org/10.1109/tevc.2025.3565947openalex-snapshot
Hierarchical Genetic Algorithm for the Multi-Solution Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1117/12.2661863openalex-snapshot
Optimization of nonlinear functions based on improved genetic algorithm
inferred← citeshttps://doi.org/10.1145/3611450.3611465openalex-snapshot
A solution of TSP based on the improved ant colony optimization
inferred← citeshttps://doi.org/10.11606/d.45.2023.tde-27042023-223742openalex-snapshot
Uma abordagem contínua para o problema do caixeiro viajante
inferred← citeshttps://doi.org/10.1177/00202940231157422openalex-snapshot
Inspection path planning of free-form surfaces based on improved cuckoo search algorithm
inferred← citeshttps://doi.org/10.1590/0101-7438.2025.045.00291911openalex-snapshot
GENETIC ALGORITHM APPROACH TO PRODUCTION SEQUENCING: A TRAVELING SALESMAN PROBLEM IN THE TWO-WHEEL SECTOR OF THE MANAUS INDUSTRIAL HUB
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2248935/v1openalex-snapshot
A Genetic Algorithm for Simultaneous Route and Path Planning in a Road Network
inferred← citeshttps://doi.org/10.3390/a15100377openalex-snapshot
The Assignment Problem and Its Relation to Logistics Problems
inferred← citeshttps://doi.org/10.52783/jes.1700openalex-snapshot
Application of Using Improved Genetic Algorithm in Art Design
inferred← citeshttps://doi.org/10.67458/re2024a433136openalex-snapshot
El Problema del Viajero: Aplicación para la Optimización Georeferenciada de Rutas de Cobradores
inferred← citeshttps://doi.org/10.7717/peerj-cs.1609openalex-snapshot
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.