On the public citation graph
Randomized heuristics for the family traveling salesperson problem
0 signed · 93 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230220305openalex-snapshot
Special cases of traveling salesman and repairman problems with time windows
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/978-1-4419-1665-5_4openalex-snapshot
Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications
inferredcites →https://doi.org/10.1007/978-1-4615-4102-8openalex-snapshot
Interfaces in Computer Science and Operations Research
inferredcites →https://doi.org/10.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/s10732-010-9143-1openalex-snapshot
Biased random-key genetic algorithms for combinatorial optimization
inferredcites →https://doi.org/10.1007/s10732-011-9167-1openalex-snapshot
Path-relinking intensification methods for stochastic local search algorithms
inferredcites →https://doi.org/10.1007/s10732-013-9223-0openalex-snapshot
Randomized heuristics for handover minimization in mobility networks
inferredcites →https://doi.org/10.1007/s11590-011-0322-2openalex-snapshot
Restart strategies for GRASP with path-relinking heuristics
inferredcites →https://doi.org/10.1016/0167-6377(89)90002-3openalex-snapshot
A probabilistic heuristic for a computationally difficult set covering problem
inferredcites →https://doi.org/10.1016/j.ejor.2004.09.057openalex-snapshot
A random-key genetic algorithm for the generalized traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2009.01.036openalex-snapshot
Using a TSP heuristic for routing order pickers in warehouses
inferredcites →https://doi.org/10.1016/s0377-2217(02)00404-6openalex-snapshot
Generalized network design problems
inferredcites →https://doi.org/10.1023/b:heur.0000019986.96257.50openalex-snapshot
A Hybrid Heuristic for the p-Median Problem
inferredcites →https://doi.org/10.1080/1055678021000090033openalex-snapshot
Randomized heuristics for the Max-Cut problem
inferredcites →https://doi.org/10.1080/10556788.2014.890197openalex-snapshot
A C++application programming interface for biased random-key genetic algorithms
inferredcites →https://doi.org/10.1287/ijoc.1030.0059openalex-snapshot
GRASP with Path Relinking for Three-Index Assignment
inferredcites →https://doi.org/10.1287/ijoc.11.1.44openalex-snapshot
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
inferredcites →https://doi.org/10.1287/ijoc.1110.0480openalex-snapshot
The Generalized Covering Salesman Problem
inferredcites →https://doi.org/10.1287/ijoc.12.3.164.12639openalex-snapshot
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/ijoc.6.2.154openalex-snapshot
Genetic Algorithms and Random Keys for Sequencing and Optimization
inferredcites →https://doi.org/10.1287/opre.31.3.507openalex-snapshot
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.18637/jss.v023.i02openalex-snapshot
TSP- Infrastructure for the Traveling Salesperson Problem
inferredcites →https://doi.org/10.21236/ada293985openalex-snapshot
On the Virtues of Parameterized Uniform Crossover,
inferredcites →https://doi.org/10.5860/choice.45-0928openalex-snapshot
The Traveling salesman problem: a computational study
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.4760992openalex-extracted
Optimising Warehouse Order Picking: Real Case Practical Application in the Shoe Manufacturing Industry
inferred← citeshttps://doi.org/10.1002/net.22036openalex-snapshot
The family traveling salesman problem with incompatibility constraints
inferred← citeshttps://doi.org/10.1002/net.22125openalex-snapshot
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
inferred← citeshttps://doi.org/10.1007/978-1-4939-6530-4_7openalex-snapshot
Extended construction heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4939-6530-4_9openalex-snapshot
GRASP with path-relinking
inferred← citeshttps://doi.org/10.1007/978-3-030-87672-2_31openalex-snapshot
A Multi-objective Biased Random-Key Genetic Algorithm for Service Technician Routing and Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-75577-4_2openalex-snapshot
Algorithm Parameters: Tuning and Control
inferred← citeshttps://doi.org/10.1007/978-3-031-95693-5_3openalex-snapshot
Specified Number of Nodes Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_30openalex-snapshot
Random-Key Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_30-1openalex-snapshot
Random-Key Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_6openalex-snapshot
Greedy Randomized Adaptive Search Procedures: Advances and Extensions
inferred← citeshttps://doi.org/10.1007/s10479-024-06325-6openalex-snapshot
Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm
inferred← citeshttps://doi.org/10.1007/s10732-023-09516-9openalex-snapshot
A matheuristic approach for the family traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2016.05.003openalex-snapshot
A biased random key genetic algorithm for the field technician scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.07.004openalex-snapshot
Bi-objective scheduling on a restricted batching machine
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106750openalex-snapshot
An ALNS metaheuristic for the family multiple traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107648openalex-snapshot
A novel tri-individual memetic search algorithm for the set orienteering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.063openalex-snapshot
Solving the family traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.11.043openalex-snapshot
A biased random-key genetic algorithm for the set orienteering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.008openalex-snapshot
An adaptive memory matheuristic for the set orienteering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.022openalex-snapshot
A comprehensive survey on the generalized traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.10.042openalex-snapshot
The family capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.02.037openalex-snapshot
A unifying framework for selective routing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.030openalex-snapshot
Biased random-key genetic algorithms: A review
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.04.014openalex-snapshot
A survey on the Traveling Salesman Problem and its variants in a warehousing context
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.06.015openalex-snapshot
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.108193openalex-snapshot
Solution of the family traveling salesman problem using a hyper-heuristic approach
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.12.015openalex-snapshot
GRASP with path relinking for the selective pickup and delivery problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121735openalex-snapshot
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.866openalex-snapshot
Split procedure for graph partitioning: an application to the SONET ring problem
inferred← citeshttps://doi.org/10.1016/j.ifacol.2025.09.418openalex-snapshot
Enhancing Warehouse Efficiency: A Study on Storage Allocation Assignment in a Footwear Manufacturing Company
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.112378openalex-snapshot
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints
inferred← citeshttps://doi.org/10.1016/j.orp.2026.100393openalex-snapshot
Exact and matheuristic approaches for the Capacitated Family Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/access.2019.2915634openalex-snapshot
A Travelling Salesman Problem With Carbon Emission Reduction in the Last Mile Delivery
inferred← citeshttps://doi.org/10.1109/access.2024.3497592openalex-snapshot
Optimising Warehouse Order Picking: Real Case Application in the Shoe Manufacturing Industry
inferred← citeshttps://doi.org/10.1109/access.2025.3586876openalex-snapshot
Turning Energy-Aware Route Planning With an Extended TSP and Double-Layer State Graph: Experimental Evaluation With a Crawler Mobile Robot
inferred← citeshttps://doi.org/10.1109/ieem.2015.7385771openalex-snapshot
Survey on applications of biased-random key genetic algorithms for solving optimization problems
inferred← citeshttps://doi.org/10.1109/tnb.2021.3109067openalex-snapshot
Solving the Family Traveling Salesperson Problem in the Adleman–Lipton Model Based on DNA Computing
inferred← citeshttps://doi.org/10.1111/itor.12085openalex-snapshot
Improved heuristics for the regenerator location problem
inferred← citeshttps://doi.org/10.1111/itor.12109openalex-snapshot
A biased random‐key genetic algorithm for the minimization of open stacks problem
inferred← citeshttps://doi.org/10.1111/itor.12167openalex-snapshot
Hybridizations of GRASP with path relinking for the far from most string problem
inferred← citeshttps://doi.org/10.1111/itor.12252openalex-snapshot
A metaheuristic approach to fisheries survey route planning
inferred← citeshttps://doi.org/10.1111/itor.12322openalex-snapshot
A biased‐randomized metaheuristic for the capacitated location routing problem
inferred← citeshttps://doi.org/10.1111/itor.12330openalex-snapshot
Metaheuristics based on decision hierarchies for the traveling purchaser problem
inferred← citeshttps://doi.org/10.1111/itor.12379openalex-snapshot
An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
inferred← citeshttps://doi.org/10.1111/itor.12641openalex-snapshot
Model and methods to address urban road network problems with disruptions
inferred← citeshttps://doi.org/10.1111/itor.12771openalex-snapshot
Heuristic approaches for the family traveling salesman problem
inferred← citeshttps://doi.org/10.1111/itor.12985openalex-snapshot
A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
inferred← citeshttps://doi.org/10.1111/itor.12991openalex-snapshot
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
inferred← citeshttps://doi.org/10.1111/itor.13422openalex-snapshot
The capacitated family traveling salesperson problem
inferred← citeshttps://doi.org/10.1145/3205455.3205545openalex-snapshot
A two-level diploid genetic based algorithm for solving the family traveling salesman problem
inferred← citeshttps://doi.org/10.1145/3665065.3665083openalex-snapshot
Biased random-key genetic algorithms: A tutorial with applications
inferred← citeshttps://doi.org/10.11606/t.3.2016.tde-23062016-154154openalex-snapshot
Métodos mono e multiobjetivo para o problema de escalonamento de técnicos de campo.
inferred← citeshttps://doi.org/10.18522/2311-3103-2023-3-108-118openalex-snapshot
SEQUENTIAL HYBRIDIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM SOLVING
inferred← citeshttps://doi.org/10.4304/risti.13.17-33openalex-snapshot
Sistema de Apoio à Decisão para o Transporte Não Urgente de Doentes em Veículo Partilhado
inferred← citeshttps://doi.org/10.59254/sbpo-2018-85287openalex-snapshot
Algoritmo genético multiobjetivo com chaves aleatórias viezadas para o problema de escalonamento de técnicos de campo
inferred← citeshttps://doi.org/10.65206/pajes.34901openalex-snapshot
A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem
inferred← citeshttps://doi.org/10.7287/peerj-cs.972v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.972v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.972v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.972v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Solving the clustered traveling salesman problem via traveling salesman problem methods (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.972openalex-snapshot
Solving the clustered traveling salesman problem via traveling salesman problem methods
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.