On the public citation graph

Inver-over operator for the TSP

https://doi.org/10.1007/bfb0056922
0 signed · 185 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.1007/978-3-662-02830-8openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/978-3-662-03315-9openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/bf00202901openalex-snapshot
An evolutionary approach to the traveling salesman problem
inferredcites →https://doi.org/10.1007/bfb0014824openalex-snapshot
The dynamics of evolution strategies in the optimization of traveling salesman problems
inferredcites →https://doi.org/10.1007/bfb0029740openalex-snapshot
Genetic local search algorithms for the traveling salesman problem
inferredcites →https://doi.org/10.1007/bfb0029743openalex-snapshot
On solving travelling salesman problems by genetic algorithms
inferredcites →https://doi.org/10.1007/bfb0029751openalex-snapshot
Application of the Evolutionsstrategie to discrete optimization problems
inferredcites →https://doi.org/10.1016/b978-0-08-050684-5.50020-3openalex-snapshot
The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination
inferredcites →https://doi.org/10.1016/b978-0-08-050684-5.50023-9openalex-snapshot
Evolution in Time and Space – The Parallel Genetic Algorithm
inferredcites →https://doi.org/10.1109/icec.1996.542655openalex-snapshot
A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule
inferredcites →https://doi.org/10.1109/icec.1997.592288openalex-snapshot
Genetic local search for the TSP: new results
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.2307/j.ctv346t9c.13openalex-snapshot
The traveling salesman problem:
inferredcites →https://doi.org/10.9746/sicetr1965.33.939openalex-snapshot
A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119136378.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/pen.20391openalex-snapshot
Defining the configuration of co‐rotating twin‐screw extruders with multiobjective evolutionary algorithms
inferred← citeshttps://doi.org/10.1002/pen.21801openalex-snapshot
Application of evolutionary algorithms to the definition of the optimal twin‐screw extruder configuration for starch cationization
inferred← citeshttps://doi.org/10.1002/pen.26515openalex-snapshot
Optimal design and operation of reactive extrusion processes: Modeling, model validation, and optimization algorithm
inferred← citeshttps://doi.org/10.1007/10721187_21openalex-snapshot
A Shepherd and a Sheepdog to Guide Evolutionary Computation?
inferred← citeshttps://doi.org/10.1007/11903697_31openalex-snapshot
A New Approach to Solving Dynamic Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/3-211-27389-1_45openalex-snapshot
A Multi-Objective Evolutionary Algorithm for Solving Traveling Salesman Problems: Application to the Design of Polymer Extruders
inferred← citeshttps://doi.org/10.1007/3-540-45105-6_90openalex-snapshot
Ant-Based Crossover for Permutation Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-91702-9_10openalex-snapshot
An Enhanced TSP-Based Approach for Active Debris Removal Mission Planning
inferred← citeshttps://doi.org/10.1007/978-3-031-16078-3_13openalex-snapshot
Combining Edge Recombination Crossover with Ant Colony Optimisation for Improved Routing
inferred← citeshttps://doi.org/10.1007/978-3-031-64067-4_22openalex-snapshot
An Efficient Hybrid Algorithm with Novel Inver-over Operator and Ant Colony Optimization for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-03753-0_1openalex-snapshot
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-05458-2_60openalex-snapshot
Heuristic Method of Feature Selection for Person Re-identification Based on Gait Motion Capture Data
inferred← citeshttps://doi.org/10.1007/978-3-319-06932-6_2openalex-snapshot
The exIWO Metaheuristic – A Recapitulation of the Research on the Join Ordering Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-10840-7_24openalex-snapshot
Sim-EA: An Evolutionary Algorithm Based on Problem Similarity
inferred← citeshttps://doi.org/10.1007/978-3-319-11857-4_21openalex-snapshot
Three New Heuristic Strategies for Solving Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-13560-1_1openalex-snapshot
Subpopulation Diversity Based Setting Success Rate of Migration for Distributed Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-20466-6_43openalex-snapshot
Enhancing the Performance of Biogeography-Based Optimization in Discrete Domain
inferred← citeshttps://doi.org/10.1007/978-3-319-24834-9_33openalex-snapshot
Improving the NSGA-II Performance with an External Population
inferred← citeshttps://doi.org/10.1007/978-3-319-24834-9_34openalex-snapshot
Local Search Based on a Local Utopia Point for the Multiobjective Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24652-7_4openalex-snapshot
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-48584-1_9openalex-snapshot
Metaheuristics for University Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-73297-6_14openalex-snapshot
Pareto Evolutionary Algorithm Hybridized with Local Search for Biobjective TSP
inferred← citeshttps://doi.org/10.1007/978-3-540-73956-2_24openalex-snapshot
Kohonen Self-Organizing Map for the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74282-1_24openalex-snapshot
An Improved Genetic Algorithm for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74581-5_7openalex-snapshot
An Evolutionary Algorithm for Dynamic Multi-Objective TSP
inferred← citeshttps://doi.org/10.1007/978-3-540-85930-7_1openalex-snapshot
Adaptive Routing Algorithm in Wireless Communication Networks Using Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-85984-0_21openalex-snapshot
A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP)
inferred← citeshttps://doi.org/10.1007/978-3-642-04962-0_26openalex-snapshot
Distributed Evolutionary Algorithms to TSP with Ring Topology
inferred← citeshttps://doi.org/10.1007/978-3-642-12538-6_8openalex-snapshot
Discovering Beneficial Cooperative Structures for the Automated Construction of Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-15871-1_38openalex-snapshot
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-16388-3_12openalex-snapshot
An Efficient Genetic Algorithm for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-18965-4_5openalex-snapshot
On the Design of Problem-specific Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-20525-5_33openalex-snapshot
Memory-Based Immigrants for Ant Colony Optimization in Changing Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-25944-9_3openalex-snapshot
A Modified Inver-over Operator for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29178-4_52openalex-snapshot
Ant Colony Optimization with Immigrants Schemes for the Dynamic Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-30665-5_13openalex-snapshot
Low-Level Hybridization of Scatter Search and Particle Filter for Dynamic TSP Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_13openalex-snapshot
Ant Colony Optimization Algorithms with Immigrants Schemes for the Dynamic Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-981-10-1023-1_14openalex-snapshot
A Hybrid Algorithm with Modified Inver-Over Operator and Genetic Algorithm Search for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-981-13-2586-1_2openalex-snapshot
Biogeography-Based Optimization
inferred← citeshttps://doi.org/10.1007/978-981-13-6473-0_11openalex-snapshot
Causes of the Imbalance Between Exploration and Exploitation in Evolutionary Computation
inferred← citeshttps://doi.org/10.1007/bf02899482openalex-snapshot
A gene-pool based genetic algorithm for TSP
inferred← citeshttps://doi.org/10.1007/s00500-003-0317-8openalex-snapshot
Some issues of designing genetic algorithms for traveling salesman problems
inferred← citeshttps://doi.org/10.1007/s00500-010-0680-1openalex-snapshot
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s00500-013-1191-7openalex-snapshot
Global migration strategy with moving colony for hierarchical distributed evolutionary algorithms
inferred← citeshttps://doi.org/10.1007/s00500-014-1522-3openalex-snapshot
Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
inferred← citeshttps://doi.org/10.1007/s00500-015-1803-5openalex-snapshot
On the applicability of diploid genetic algorithms in dynamic environments
inferred← citeshttps://doi.org/10.1007/s11047-018-9703-0openalex-snapshot
Scheduling for airport baggage transport vehicles based on diversity enhancement genetic algorithm
inferred← citeshttps://doi.org/10.1007/s11071-010-9889-xopenalex-snapshot
Chaotic ant swarm for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s11390-012-1275-3openalex-snapshot
A Puzzle-Based Genetic Algorithm with Block Mining and Recombination Heuristic for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s13369-018-3617-0openalex-snapshot
Discrete Sine-Cosine Algorithm (DSCA) with Local Search for Solving Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s42979-024-03417-9openalex-snapshot
Hybrid Heuristic for Solving the Euclidean Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2013.05.022openalex-snapshot
Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.06.022openalex-snapshot
Hybrid algorithms for the twin–screw extrusion configuration problem
inferred← citeshttps://doi.org/10.1016/j.buildenv.2021.107721openalex-snapshot
Multi-performance based computational model for the cuboid open traveling salesman problem in a smart floating city
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.06.063openalex-snapshot
Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.chemolab.2006.03.007openalex-snapshot
A new tree structure code for equivalent circuit and evolutionary estimation of parameters
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105359openalex-snapshot
A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
inferred← citeshttps://doi.org/10.1016/j.engappai.2014.01.011openalex-snapshot
Hybrid biogeography-based evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.engappai.2018.11.008openalex-snapshot
TERRA: A path planning algorithm for cooperative UGV–UAV exploration
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.119765openalex-snapshot
Discrete Mayfly Algorithm for spherical asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.inpa.2019.04.002openalex-snapshot
A hybrid weed optimized coverage path planning technique for autonomous harvesting in cashew orchards
inferred← citeshttps://doi.org/10.1016/j.ins.2010.12.006openalex-snapshot
Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.002openalex-snapshot
Ant algorithms with immigrants schemes for the dynamic vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.optlaseng.2011.01.017openalex-snapshot
A novel algorithm for branch cut phase unwrapping
inferred← citeshttps://doi.org/10.1016/j.parco.2003.12.017openalex-snapshot
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.1016/j.procs.2021.08.150openalex-snapshot
Evolutionary Algorithm Using Random Immigrants for the Multiobjective Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.swevo.2018.08.004openalex-snapshot
An artificial bee colony algorithm with a Modified Choice Function for the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.trc.2015.01.010openalex-snapshot
A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods
inferred← citeshttps://doi.org/10.1023/b:jims.0000026570.03851.ccopenalex-snapshot
Flow-shop sequencing using hybrid simulated annealing
inferred← citeshttps://doi.org/10.1080/00295450.2018.1496692openalex-snapshot
Gnowee: A Hybrid Metaheuristic Optimization Algorithm for Constrained, Black Box, Combinatorial Mixed-Integer Design
inferred← citeshttps://doi.org/10.1080/0305215031000109622openalex-snapshot
Heterogeneous Selection Genetic Algorithms For Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1080/0305215x.2011.639370openalex-snapshot
Multi-objective ant colony optimization for the twin-screw configuration problem
inferred← citeshttps://doi.org/10.1080/10556788.2015.1121485openalex-snapshot
Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
inferred← citeshttps://doi.org/10.1108/compel-03-2015-0119openalex-snapshot
A fuzzy-ExIWO method for optimal placement of multiple DSTATCOM/DG and tuning the DSTATCM’s controller
inferred← citeshttps://doi.org/10.1108/ijicc-03-2016-0015openalex-snapshot
Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems
inferred← citeshttps://doi.org/10.1109/4235.771166openalex-snapshot
Parameter control in evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/4235.974843openalex-snapshot
A hybrid heuristic for the traveling salesman problem
inferred← citeshttps://doi.org/10.1109/cdc.2006.377276openalex-snapshot
Optimum Steelmaking Charge Plan with Unknown Charge Number Based on the Pseudo TSP Model
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400914openalex-snapshot
Solve the optimum steelmaking charge plan with unknown charge number using improved DPSO
inferred← citeshttps://doi.org/10.1109/cec.2000.870736openalex-snapshot
Resolution of quadratic assignment problems using an evolutionary algorithm
inferred← citeshttps://doi.org/10.1109/cec.2001.934274openalex-snapshot
Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms
inferred← citeshttps://doi.org/10.1109/cec.2002.1004429openalex-snapshot
Solving traveling salesman problems by combining global and local search mechanisms
inferred← citeshttps://doi.org/10.1109/cec.2003.1299769openalex-snapshot
Solving dynamic TSP with evolutionary approach in real time
inferred← citeshttps://doi.org/10.1109/cec.2003.1299815openalex-snapshot
Using adaptive operator scheduling on problem domains with an operator manifold: applications to the travelling salesman problem
inferred← citeshttps://doi.org/10.1109/cec.2003.1299852openalex-snapshot
Guiding genetic operators with immunology principle: a case study in TSP
inferred← citeshttps://doi.org/10.1109/cec.2004.1331045openalex-snapshot
Benchmarking algorithms for dynamic travelling salesman problems
inferred← citeshttps://doi.org/10.1109/cec.2004.1331070openalex-snapshot
A hybrid evolutionary algorithm for traveling salesman problem
inferred← citeshttps://doi.org/10.1109/cec.2005.1555053openalex-snapshot
An Empirical Analysis of the Grouping Genetic Algorithm: The Timetabling Case.
inferred← citeshttps://doi.org/10.1109/cec.2008.4630839openalex-snapshot
Multi-algorithm co-evolution strategy for Dynamic Multi-Objective TSP
inferred← citeshttps://doi.org/10.1109/cec.2010.5586192openalex-snapshot
Grammatical rules for the automated construction of heuristics
inferred← citeshttps://doi.org/10.1109/cec.2010.5586216openalex-snapshot
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
inferred← citeshttps://doi.org/10.1109/cec.2011.5949792openalex-snapshot
Oppositional biogeography-based optimization for combinatorial problems
inferred← citeshttps://doi.org/10.1109/cec.2012.6252885openalex-snapshot
Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem
inferred← citeshttps://doi.org/10.1109/cec45853.2021.9504893openalex-snapshot
An Ant Colony Optimisation Inspired Crossover Operator for Permutation Type Problems
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870282openalex-snapshot
Bicriterion Coevolution for the Multi-objective Travelling Salesperson Problem
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870437openalex-snapshot
An Interpolated Approach for Active Debris Removal
inferred← citeshttps://doi.org/10.1109/cinc.2009.72openalex-snapshot
A Solution for TSP Based on Artificial Fish Algorithm
inferred← citeshttps://doi.org/10.1109/cipls.2013.6595203openalex-snapshot
SDGP: A developmental approach for traveling salesman problems
inferred← citeshttps://doi.org/10.1109/cis.2011.24openalex-snapshot
Hybrid Genetic Algorithm for TSP
inferred← citeshttps://doi.org/10.1109/cse-euc.2017.73openalex-snapshot
A New Quantum Rotation Angle of Quantum-Inspired Evolutionary Algorithm for TSP
inferred← citeshttps://doi.org/10.1109/csie.2009.468openalex-snapshot
Introducing Gene Clusters into a P2P Based TSP Solving Algorithm
inferred← citeshttps://doi.org/10.1109/icca.2007.4376323openalex-snapshot
A Fast Evolutionary Algorithm for Robot Path Planning
inferred← citeshttps://doi.org/10.1109/iciinfs.2008.4798469openalex-snapshot
A Study of the Traveling Salesman Problem Using Fuzzy Self Organizing Map
inferred← citeshttps://doi.org/10.1109/icisa.2011.5772395openalex-snapshot
Using Self-Organizing Map and Data Mining Measurements to Improve Thai-English Statistical Machine Translation
inferred← citeshttps://doi.org/10.1109/icist.2019.8836906openalex-snapshot
An Empirical Study on Evolutionary Algorithms for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1382208openalex-snapshot
An approach to dynamic traveling salesman problem
inferred← citeshttps://doi.org/10.1109/icmlc.2005.1527510openalex-snapshot
A fast evolutionary algorithm for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1109/icnc.2007.23openalex-snapshot
A Fast Evolutionary Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icnc.2007.400openalex-snapshot
Genetic Algorithm Based on Classification for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icnc.2010.5583529openalex-snapshot
Memetic algorithm based on improved inver-over operator for TSP
inferred← citeshttps://doi.org/10.1109/icnc.2011.6022345openalex-snapshot
Simulated annealing with probabilistic neighborhood for traveling salesman problems
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346043openalex-snapshot
Oppositional biogeography-based optimization
inferred← citeshttps://doi.org/10.1109/indin.2004.1417398openalex-snapshot
Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213270openalex-snapshot
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.1109/isda.2014.7066254openalex-snapshot
A novel evolutionary algorithm with indirect representation and extended nearest neighbor constructive procedure for solving routing problems
inferred← citeshttps://doi.org/10.1109/mec.2011.6026004openalex-snapshot
A novel evolutionary algorithm for the traveling salesman problem
inferred← citeshttps://doi.org/10.1109/sis.2007.368045openalex-snapshot
A Mini-Swarm for the Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1109/smc.2017.8122629openalex-snapshot
An artificial bee colony algorithm with a modified choice function for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/smc52423.2021.9658977openalex-snapshot
Time-Dependent Ant Colony Optimization Algorithm for Solving The Fastest Traffic Path Finding Problem in a Dynamic Environment
inferred← citeshttps://doi.org/10.1109/tcyb.2016.2556742openalex-snapshot
Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1109/tevc.2006.885162openalex-snapshot
Finding Feasible Timetables Using Group-Based Operators
inferred← citeshttps://doi.org/10.1109/tevc.2009.2030331openalex-snapshot
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1109/tits.2022.3150471openalex-snapshot
Memory-Based Ant Colony System Approach for Multi-Source Data Associated Dynamic Electric Vehicle Dispatch Optimization
inferred← citeshttps://doi.org/10.1109/tsmcb.2004.828283openalex-snapshot
An Evolutionary Algorithm for Large Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.2006910openalex-snapshot
Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)
inferred← citeshttps://doi.org/10.1109/wcica.2004.1341994openalex-snapshot
TSP problem based on dynamic environment
inferred← citeshttps://doi.org/10.1142/9789812567796_0008openalex-snapshot
THE USE OF EVOLUTIONARY ALGORITHMS TO SOLVE PRACTICAL PROBLEMS IN POLYMER EXTRUSION
inferred← citeshttps://doi.org/10.1145/1543834.1543969openalex-snapshot
Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP
inferred← citeshttps://doi.org/10.1145/2739480.2754651openalex-snapshot
An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1145/2739480.2754727openalex-snapshot
Evolving Solutions to TSP Variants for Active Space Debris Removal
inferred← citeshttps://doi.org/10.1145/3067695.3076102openalex-snapshot
The MOEA/D algorithm with gaussian neighbourhoods for the multiobjective travelling salesman problem
inferred← citeshttps://doi.org/10.1145/3345252.3345272openalex-snapshot
A genetic approach to the maximum common subgraph problem
inferred← citeshttps://doi.org/10.1145/335603.335869openalex-snapshot
Selection in evolutionary algorithms for the traveling salesman problem
inferred← citeshttps://doi.org/10.1145/3449639.3459349openalex-snapshot
Zoetrope genetic programming for regression
inferred← citeshttps://doi.org/10.1155/2014/831691openalex-snapshot
The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1162/evco_a_00199openalex-snapshot
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.1179/174328904x24920openalex-snapshot
Optimisation-based design of extruders
inferred← citeshttps://doi.org/10.1201/9781420035063.ch8openalex-snapshot
Optimization via Gene Expression Algorithms
inferred← citeshttps://doi.org/10.12785/amis/070637openalex-snapshot
Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints
inferred← citeshttps://doi.org/10.1371/journal.pone.0137724openalex-snapshot
Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.14257/ijca.2017.10.2.16openalex-snapshot
An Improved Particle Swarm Optimization Algorithm for Traveling Salesman Problems
inferred← citeshttps://doi.org/10.17877/de290r-1190openalex-snapshot
Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen
inferred← citeshttps://doi.org/10.2174/1874444301406010699openalex-snapshot
A Kind of Ant Colony Algorithm with Route Evaluation
inferred← citeshttps://doi.org/10.24988/ije.2019342825openalex-snapshot
Gezgin Satıcı Probleminin Genetik Algoritmalar Kullanarak Çözümünde Çaprazlama Operatörlerinin Örnek Olaylar Bazlı İncelenmesi
inferred← citeshttps://doi.org/10.2991/msota-16.2016.59openalex-snapshot
Population Iterative Annealing Algorithm with Improved Inver-over Operator for TSP
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.02675openalex-snapshot
Optimum Steelmaking Charge Plan with Unknown Charge Number Based on the Pseudo TSP Model
inferred← citeshttps://doi.org/10.3233/fi-1998-35123407openalex-snapshot
Evolutionary Algorithm for Economic lot and Delivery Scheduling Problem
inferred← citeshttps://doi.org/10.3390/app10010305openalex-snapshot
A Re-Entry Path Planning Method for Service Robots Based on Dynamic Inver-Over Evolutionary Algorithm
inferred← citeshttps://doi.org/10.3390/app8112042openalex-snapshot
Ant Colony Optimization and Genetic Algorithm for Fuzzy Stochastic Production-Distribution Planning
inferred← citeshttps://doi.org/10.3390/su12051967openalex-snapshot
Optimization of a Low-Carbon Two-Echelon Heterogeneous-Fleet Vehicle Routing for Cold Chain Logistics under Mixed Time Window
inferred← citeshttps://doi.org/10.35378/gujs.1582521openalex-snapshot
Comparison of Genetic Crossover Operators for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.36227/techrxiv.13139042openalex-snapshot
Solve traveling salesman problem using EMF-CE algorithm
inferred← citeshttps://doi.org/10.36227/techrxiv.13139042.v2openalex-snapshot
Solve traveling salesman problem using EMF-CE algorithm
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.01265openalex-snapshot
Immune Algorithm with Selfadaptive Reduction for Large-Scale TSP
inferred← citeshttps://doi.org/10.4018/978-1-4666-3942-3.ch010openalex-snapshot
Biogeography-Based Optimization for Large Scale Combinatorial Problems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/aef.6-7.290openalex-snapshot
Orthogonal Genetic Algorithm and its Application in Traveling Salesman Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.121-126.4410openalex-snapshot
Artificial Fish Algorithm to Solve Traveling Salesman Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.155-156.92openalex-snapshot
Improved Shuffled Frog-Leaping Algorithm and its Application
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.670-671.1499openalex-snapshot
The Attacking Dispersion Optimization in Multi Launch Rocket System Base-On Improved Genetic Algorithm
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.314-316.2191openalex-snapshot
Artificial Bee Colony Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.4108/icst.bict.2014.257888openalex-snapshot
A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX
inferred← citeshttps://doi.org/10.4204/eptcs.26.13openalex-snapshot
Towards the Design of Heuristics by Means of Self-Assembly
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01271openalex-snapshot
Subpopulation Diversity Based Selecting Migration Moment in Distributed Evolutionary Algorithms
inferred← citeshttps://doi.org/10.5220/0004224204510456openalex-snapshot
Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5220/0009832704610469openalex-snapshot
Towards a Better Understanding of Genetic Operators for Ordering Optimization: Application to the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.5772/12949openalex-snapshot
A Fast Evolutionary Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/13034openalex-snapshot
High Performance Immune Clonal Algorithm for Solving Large Scale TSP
inferred← citeshttps://doi.org/10.5772/547openalex-snapshot
Traveling Salesman Problem, Theory and Applications
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.