On the public citation graph

Hybrid Discrete Bacterial Memetic Evolutionary Algorithm for Solving the Traveling Repairman Problem

0 signed · 42 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/int.20338openalex-extracted
Fuzzy rule extraction by bacterial memetic algorithms
inferredcites →https://doi.org/10.1002/int.21893openalex-extracted
An effective Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1002/net.3230200605openalex-extracted
Time‐dependent traveling salesman problem–the deliveryman case
inferredcites →https://doi.org/10.1007/978-3-030-06222-4_13openalex-extracted
Memetic Algorithms for Business Analytics and Data Science: A Brief Survey
inferredcites →https://doi.org/10.1007/978-3-030-21920-8_12openalex-extracted
Intuitionistic Fuzzy Model of Traffic Jam Regions and Rush Hours for the Time Dependent Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-319-91473-2_45openalex-extracted
Discrete Bacterial Memetic Evolutionary Algorithm for the Time Dependent Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-11960-6_40openalex-extracted
Comparison of Various Evolutionary and Memetic Algorithms
inferredcites →https://doi.org/10.1007/bf01585867openalex-extracted
An improved approximation ratio for the minimum latency problem
inferredcites →https://doi.org/10.1007/s00500-008-0354-4openalex-extracted
A case study of memetic algorithms for constraint optimization
inferredcites →https://doi.org/10.1007/s10878-021-00716-2openalex-extracted
A metaheuristic for the delivery man problem with time windows
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-extracted
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/j.asoc.2018.03.048openalex-extracted
Improving variable neighborhood search to solve the traveling salesman problem
inferredcites →https://doi.org/10.1016/j.cie.2017.09.032openalex-extracted
A GRASP with iterated local search for the traveling repairman problem with profits
inferredcites →https://doi.org/10.1016/j.cor.2009.06.014openalex-extracted
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
inferredcites →https://doi.org/10.1016/j.cor.2012.04.017openalex-extracted
Variable neighborhood search for the Vertex Separation Problem
inferredcites →https://doi.org/10.1016/j.cor.2018.01.016openalex-extracted
A branch-and-price algorithm for the Minimum Latency Problem
inferredcites →https://doi.org/10.1016/j.dam.2008.05.009openalex-extracted
A new formulation for the Traveling Deliveryman Problem
inferredcites →https://doi.org/10.1016/j.disopt.2010.04.002openalex-extracted
A General VNS heuristic for the traveling salesman problem with time windows
inferredcites →https://doi.org/10.1016/j.ejor.2012.01.036openalex-extracted
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2014.03.042openalex-extracted
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2022.04.007openalex-extracted
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
inferredcites →https://doi.org/10.1016/j.eswa.2013.05.036openalex-extracted
Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows
inferredcites →https://doi.org/10.1016/j.ins.2017.09.069openalex-extracted
Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization
inferredcites →https://doi.org/10.1016/j.ins.2019.08.017openalex-extracted
Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach
inferredcites →https://doi.org/10.1016/j.ipl.2004.09.009openalex-extracted
Exact algorithms for the minimum latency problem
inferredcites →https://doi.org/10.1016/j.orl.2008.09.006openalex-extracted
Certification of an optimal TSP tour through 85,900 cities
inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-extracted
Variable neighborhood search
inferredcites →https://doi.org/10.1016/s0377-2217(00)00100-4openalex-extracted
Variable neighborhood search: Principles and applications
inferredcites →https://doi.org/10.1051/ita/1986200100791openalex-extracted
The complexity of the travelling repairman problem
inferredcites →https://doi.org/10.1109/91.797983openalex-extracted
Fuzzy system parameters discovery by bacterial evolutionary algorithm
inferredcites →https://doi.org/10.1109/cec.2009.4983031openalex-extracted
Memetic algorithm with Local search chaining for large scale continuous optimization problems
inferredcites →https://doi.org/10.1109/fuzz-ieee.2019.8858853openalex-extracted
Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/icnn.1995.488968openalex-extracted
Particle swarm optimization
inferredcites →https://doi.org/10.1109/sfcs.2003.1238179openalex-extracted
Paths, trees, and minimum latency tours
inferredcites →https://doi.org/10.1109/tcbb.2016.2635143openalex-extracted
A Memetic Algorithm for 3D Protein Structure Prediction Problem
inferredcites →https://doi.org/10.1111/itor.12774openalex-extracted
Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
inferredcites →https://doi.org/10.1137/s0097539701399654openalex-extracted
Approximation Schemes for Minimum Latency Problems
inferredcites →https://doi.org/10.1145/195058.195125openalex-extracted
The minimum latency problem
inferredcites →https://doi.org/10.1287/trsc.1070.0209openalex-extracted
Routing for Relief Efforts
inferredcites →https://doi.org/10.1287/trsc.2013.0474openalex-extracted
Dynamic ng-Path Relaxation for the Delivery Man Problem
inferredcites →https://doi.org/10.2991/ijcis.d.200529.001openalex-extracted
An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem
inferredcites →https://doi.org/10.5555/313852.313909openalex-extracted
An improved approximation ratio for the minimum latency problem
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.