On the public citation graph
Traveling Salesman Problem, Theory and Applications
0 signed · 324 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/9780470400531.eorms0142openalex-snapshot
C hinese Postman Problem
inferredcites →https://doi.org/10.1002/eji.1830100102openalex-snapshot
Regulatory circuits and antibody responses
inferredcites →https://doi.org/10.1002/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1002/net.21628openalex-snapshot
Dynamic vehicle routing problems: Three decades and counting
inferredcites →https://doi.org/10.1007/0-306-48213-4_2openalex-snapshot
Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP
inferredcites →https://doi.org/10.1007/0-306-48213-4_4openalex-snapshot
Exact Methods for the Asymmetric Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/0-306-48213-4_9openalex-snapshot
Experimental Analysis of Heuristics for the STSP
inferredcites →https://doi.org/10.1007/11536444_34openalex-snapshot
Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules
inferredcites →https://doi.org/10.1007/11823940_22openalex-snapshot
A Population Adaptive Based Immune Algorithm for Solving Multi-objective Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-36626-1_5openalex-snapshot
A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1007/3-540-46004-7_16openalex-snapshot
Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema
inferredcites →https://doi.org/10.1007/978-1-4615-4369-5openalex-snapshot
Efficient and Accurate Parallel Genetic Algorithms
inferredcites →https://doi.org/10.1007/978-1-4615-6325-9_12openalex-snapshot
Dynamic Mission Planning for Multiple Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-540-39930-8_8openalex-snapshot
Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_5openalex-snapshot
An Automatic Method for Solving Discrete Programming Problems
inferredcites →https://doi.org/10.1007/978-3-642-10707-8_14openalex-snapshot
Controller Parameters Optimization on a Representative Set of Systems Using Deterministic-Chaotic-Mutation Evolutionary Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-15328-0_40openalex-snapshot
The Travelling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-77489-8_27openalex-snapshot
Exact Solution of Multiple Traveling Salesman Problems
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/bf00204755openalex-snapshot
A neural network algorithm for the multiple traveling salesmen problem
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1007/bf01022991openalex-snapshot
A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem
inferredcites →https://doi.org/10.1007/bf01415960openalex-snapshot
Optimal control of plotting and drilling machines: A case study
inferredcites →https://doi.org/10.1007/bf01580109openalex-snapshot
Edmonds polytopes and weakly hamiltonian graphs
inferredcites →https://doi.org/10.1007/bf01582008openalex-snapshot
The traveling salesman problem on a graph and some related integer polyhedra
inferredcites →https://doi.org/10.1007/bf01589353openalex-snapshot
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
inferredcites →https://doi.org/10.1007/bf01609016openalex-snapshot
Using cutting planes to solve the symmetric Travelling Salesman problem
inferredcites →https://doi.org/10.1007/bf02899482openalex-snapshot
A gene-pool based genetic algorithm for TSP
inferredcites →https://doi.org/10.1007/bfb0032050openalex-snapshot
Local optimization and the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bfb0120888openalex-snapshot
On the symmetric travelling salesman problem: A computational study
inferredcites →https://doi.org/10.1007/springerreference_63062openalex-snapshot
Traveling Salesman Problem (TSP)
inferredcites →https://doi.org/10.1016/0166-218x(86)90087-9openalex-snapshot
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
inferredcites →https://doi.org/10.1016/0166-218x(87)90016-3openalex-snapshot
Primal-dual algrorithms for the assignment problem
inferredcites →https://doi.org/10.1016/0167-2789(81)90072-5openalex-snapshot
The decay of turbulence in the burgers model
inferredcites →https://doi.org/10.1016/0167-2789(90)90072-wopenalex-snapshot
A Rosetta stone for connectionism
inferredcites →https://doi.org/10.1016/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(89)90037-0openalex-snapshot
Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
inferredcites →https://doi.org/10.1016/0305-0483(83)90043-9openalex-snapshot
Combinatorial analysis for route first-cluster second vehicle routing
inferredcites →https://doi.org/10.1016/0305-0483(88)90047-3openalex-snapshot
An effective method of balancing the workload amongst salesmen
inferredcites →https://doi.org/10.1016/0375-9601(87)90796-1openalex-snapshot
Fast simulated annealing
inferredcites →https://doi.org/10.1016/0377-2217(85)90284-xopenalex-snapshot
Integer programming formulations of vehicle routing problems
inferredcites →https://doi.org/10.1016/0377-2217(92)90138-yopenalex-snapshot
The traveling salesman problem: An overview of exact and approximate algorithms
inferredcites →https://doi.org/10.1016/0377-2217(92)90192-copenalex-snapshot
The vehicle routing problem: An overview of exact and approximate algorithms
inferredcites →https://doi.org/10.1016/0893-6080(89)90021-xopenalex-snapshot
A new approach for finding the global minimum of error function of neural networks
inferredcites →https://doi.org/10.1016/0893-6080(90)90029-kopenalex-snapshot
Experiments in nonconvex optimization: Stochastic approximation with function smoothing and simulated annealing
inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50034-4openalex-snapshot
PARALLEL GENETIC ALGORITHMS IN COMBINATORIAL OPTIMIZATION
inferredcites →https://doi.org/10.1016/j.cor.2007.11.008openalex-snapshot
A comparative analysis of several asymmetric traveling salesman problem formulations
inferredcites →https://doi.org/10.1016/j.engappai.2003.11.001openalex-snapshot
The design of the global navigation satellite system surveying networks using genetic algorithms
inferredcites →https://doi.org/10.1016/j.ins.2008.12.016openalex-snapshot
A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem
inferredcites →https://doi.org/10.1016/j.neucom.2004.02.006openalex-snapshot
An expanding self-organizing neural network for the traveling salesman problem
inferredcites →https://doi.org/10.1016/j.neucom.2006.03.013openalex-snapshot
A new approach to solve the traveling salesman problem
inferredcites →https://doi.org/10.1016/j.omega.2004.10.004openalex-snapshot
The multiple traveling salesman problem: an overview of formulations and solution procedures
inferredcites →https://doi.org/10.1016/j.trb.2003.09.001openalex-snapshot
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
inferredcites →https://doi.org/10.1016/s0020-0255(00)00063-3openalex-snapshot
Physical model of immune inspired computing
inferredcites →https://doi.org/10.1016/s0022-5193(86)80224-7openalex-snapshot
A neural network model based on the analogy with the immune system
inferredcites →https://doi.org/10.1016/s0166-218x(99)00172-9openalex-snapshot
Algorithms and codes for dense assignment problems: the state of the art
inferredcites →https://doi.org/10.1016/s0167-8191(03)00045-0openalex-snapshot
Parallel branch and cut for capacitated vehicle routing
inferredcites →https://doi.org/10.1016/s0303-2647(97)01708-5openalex-snapshot
Ant colonies for the travelling salesman problem
inferredcites →https://doi.org/10.1016/s0303-2647(99)00093-3openalex-snapshot
A formal model of an artificial immune system
inferredcites →https://doi.org/10.1016/s0305-0483(02)00059-2openalex-snapshot
Scheduling pre-printed newspaper advertising inserts using genetic algorithms
inferredcites →https://doi.org/10.1016/s0305-0548(02)00070-9openalex-snapshot
A heuristic approach to the overnight security service problem
inferredcites →https://doi.org/10.1016/s0360-8352(97)00171-xopenalex-snapshot
A competitive neural network algorithm for solving vehicle routing problem
inferredcites →https://doi.org/10.1016/s0377-2217(03)00133-4openalex-snapshot
A crane scheduling method for port container terminals
inferredcites →https://doi.org/10.1016/s0377-2217(99)00284-2openalex-snapshot
An effective implementation of the Lin–Kernighan traveling salesman heuristic
inferredcites →https://doi.org/10.1016/s0377-2217(99)00380-xopenalex-snapshot
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
inferredcites →https://doi.org/10.1016/s0377-2217(99)00468-3openalex-snapshot
Construction heuristics for the asymmetric TSP
inferredcites →https://doi.org/10.1016/s0893-6080(03)00056-xopenalex-snapshot
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/s0893-6080(05)80043-7openalex-snapshot
Solving inequality constrained combinatorial optimization problems by the hopfield neural networks
inferredcites →https://doi.org/10.1016/s0893-6080(99)00063-5openalex-snapshot
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem
inferredcites →https://doi.org/10.1016/s0895-7177(99)00222-8openalex-snapshot
Efficient coordinated motion
inferredcites →https://doi.org/10.1016/s0925-2312(02)00627-6openalex-snapshot
Digital hardware realization of a recurrent neural network for solving the assignment problem
inferredcites →https://doi.org/10.1016/s0950-7051(01)00088-0openalex-snapshot
A resource limited artificial immune system for data analysis
inferredcites →https://doi.org/10.1016/s0965-8564(00)00037-9openalex-snapshot
Local truckload pickup and delivery with hard time window constraints
inferredcites →https://doi.org/10.1038/326689a0openalex-snapshot
An analogue approach to the travelling salesman problem using an elastic net method
inferredcites →https://doi.org/10.1049/el:19920664openalex-snapshot
Analogue neural network for solving the assignment problem
inferredcites →https://doi.org/10.1057/jors.1975.151openalex-snapshot
Some Simple Applications of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1057/jors.1980.188openalex-snapshot
A Cutting Planes Algorithm for the m-Salesmen Problem
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1080/00207729108910772openalex-snapshot
Programming an automated punch or drill
inferredcites →https://doi.org/10.1080/03155986.1989.11732113openalex-snapshot
A Generalized K-Opt Exchange Procedure For The MTSP
inferredcites →https://doi.org/10.1090/s0002-9904-1958-10224-4openalex-snapshot
Outline of an algorithm for integer solutions to linear programs
inferredcites →https://doi.org/10.1109/20.717694openalex-snapshot
A study on comparison of optimization performances between immune algorithm and other heuristic algorithms
inferredcites →https://doi.org/10.1109/3468.867862openalex-snapshot
A novel genetic algorithm based on immunity
inferredcites →https://doi.org/10.1109/3477.484454openalex-snapshot
Convergence acceleration of the Hopfield neural network by optimizing integration step sizes
inferredcites →https://doi.org/10.1109/72.363424openalex-snapshot
Limitations of neural networks for solving traveling salesman problems
inferredcites →https://doi.org/10.1109/72.572114openalex-snapshot
Primal and dual assignment networks
inferredcites →https://doi.org/10.1109/72.737495openalex-snapshot
Extended Hopfield models for combinatorial optimization
inferredcites →https://doi.org/10.1109/72.80232openalex-snapshot
A theoretical investigation into the performance of the Hopfield model
inferredcites →https://doi.org/10.1109/81.224297openalex-snapshot
Global convergence and suppression of spurious states of the Hopfield neural networks
inferredcites →https://doi.org/10.1109/cec.2001.934338openalex-snapshot
Dynamic traveling salesman problem based on evolutionary computation
inferredcites →https://doi.org/10.1109/cec.2002.1004382openalex-snapshot
Towards an artificial immune system for network intrusion detection: an investigation of dynamic clonal selection
inferredcites →https://doi.org/10.1109/cec.2003.1299769openalex-snapshot
Solving dynamic TSP with evolutionary approach in real time
inferredcites →https://doi.org/10.1109/icmlc.2004.1382208openalex-snapshot
An approach to dynamic traveling salesman problem
inferredcites →https://doi.org/10.1109/icmlc.2005.1527510openalex-snapshot
A fast evolutionary algorithm for combinatorial optimization problems
inferredcites →https://doi.org/10.1109/icnn.1988.23941openalex-snapshot
Determination of parameters in a Hopfield/Tank computational network
inferredcites →https://doi.org/10.1109/icnn.1988.23942openalex-snapshot
A traveling salesman objective function that works
inferredcites →https://doi.org/10.1109/icnn.1994.375004openalex-snapshot
Solving vehicle routing problems using elastic nets
inferredcites →https://doi.org/10.1109/icnn.1994.375010openalex-snapshot
A stability criterion for Hopfield networks based on Popov theorem
inferredcites →https://doi.org/10.1109/icnn.1996.548946openalex-snapshot
A noise annealing neural network for global optimization
inferredcites →https://doi.org/10.1109/icsmc.2002.1175628openalex-snapshot
Devising adaptive migration policies for cooperative distributed genetic algorithms
inferredcites →https://doi.org/10.1109/ijcnn.2003.1223777openalex-snapshot
Extended simulated annealing for augmented TSP and multi-salesmen TSP
inferredcites →https://doi.org/10.1109/ijcnn.2005.1555948openalex-snapshot
A new kind of Hopfield networks for finding global optimum
inferredcites →https://doi.org/10.1109/ipmm.1999.791495openalex-snapshot
Team scheduling by genetic search
inferredcites →https://doi.org/10.1109/iscas.1991.176682openalex-snapshot
A study of feature-mapped approach to the multiple travelling salesmen problem
inferredcites →https://doi.org/10.1109/isda.2006.253773openalex-snapshot
Improved Ant Colony Algorithm and its Applications in TSP
inferredcites →https://doi.org/10.1109/sbrn.2000.889718openalex-snapshot
An evolutionary immune network for data clustering
inferredcites →https://doi.org/10.1109/tsmcb.2002.804367openalex-snapshot
An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem
inferredcites →https://doi.org/10.1109/wcica.2002.1021392openalex-snapshot
An implementation of evolutionary computation for path planning of cooperative mobile robots
inferredcites →https://doi.org/10.1109/wcica.2004.1341994openalex-snapshot
TSP problem based on dynamic environment
inferredcites →https://doi.org/10.1109/wcica.2006.1712966openalex-snapshot
A New Algorithm for TSP Based on Swarm Intelligence
inferredcites →https://doi.org/10.1109/wsc.1998.745084openalex-snapshot
Reactive Tabu Search in unmanned aerial reconnaissance simulations
inferredcites →https://doi.org/10.1111/j.1475-3995.1999.tb00175.xopenalex-snapshot
A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems
inferredcites →https://doi.org/10.1111/j.1540-5915.1992.tb00387.xopenalex-snapshot
A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem
inferredcites →https://doi.org/10.1111/j.1600-065x.1989.tb00025.xopenalex-snapshot
Immune Network Theory
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/1.9780898718515.ch13openalex-snapshot
13. Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers
inferredcites →https://doi.org/10.1137/1.9780898718515.ch2openalex-snapshot
2. Branch-And-Bound Algorithms for the Capacitated VRP
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/212066.212081openalex-snapshot
Exact solution of large-scale, asymmetric traveling salesman problems
inferredcites →https://doi.org/10.1145/321043.321046openalex-snapshot
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/mnsc.16.6.b373openalex-snapshot
Printing Press Scheduling for Multi-Edition Periodicals
inferredcites →https://doi.org/10.1287/mnsc.18.6.b279openalex-snapshot
Computer-Assisted School Bus Scheduling
inferredcites →https://doi.org/10.1287/mnsc.19.7.790openalex-snapshot
Computational Experience with an M-Salesman Traveling Salesman Algorithm
inferredcites →https://doi.org/10.1287/mnsc.22.6.704openalex-snapshot
Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
inferredcites →https://doi.org/10.1287/mnsc.26.5.495openalex-snapshot
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
inferredcites →https://doi.org/10.1287/moor.11.4.537openalex-snapshot
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.11.6.972openalex-snapshot
An Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
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.1287/opre.33.5.1050openalex-snapshot
Optimal Routing under Capacity and Distance Restrictions
inferredcites →https://doi.org/10.1287/opre.35.5.772openalex-snapshot
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
inferredcites →https://doi.org/10.1360/04yf0458openalex-snapshot
Adaptive chaos clonal evolutionary programming algorithm
inferredcites →https://doi.org/10.1360/jos182700openalex-snapshot
An Immune Clonal Algorithm for Dynamic Multi-Objective Optimization
inferredcites →https://doi.org/10.1515/9780691187563openalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.2307/3006767openalex-snapshot
Recent Advances in Mathematical Programming
inferredcites →https://doi.org/10.5755/j01.itc.34.4.12028openalex-snapshot
ITERATED TABU SEARCH FOR THE TRAVELING SALESMAN PROBLEM: NEW RESULTS
inferredcites →https://doi.org/10.5772/5578openalex-snapshot
A Recurrent Neural Network to Traveling Salesman Problem
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119792642.ch23openalex-snapshot
Pufferfish Optimization Algorithm: A Bioinspired Optimizer
inferred← citeshttps://doi.org/10.1002/cta.1823openalex-snapshot
Implementation of cellular genetic algorithms on a CNN chip: Simulations and experimental results
inferred← citeshttps://doi.org/10.1007/978-1-4471-2386-6_52openalex-snapshot
Traveling Salesman Problems on a Cuboid using Discrete Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-7131-2_110202openalex-snapshot
Crowdsourced Social Data for Recommending Tourist Itineraries
inferred← citeshttps://doi.org/10.1007/978-3-030-01313-4_41openalex-snapshot
Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-28565-4_27openalex-snapshot
Effective Covering of Supplied Nanostores in Emerging Cities
inferred← citeshttps://doi.org/10.1007/978-3-030-31362-3_19openalex-snapshot
The Simulation Study of Recursive ABC Method for Warehouse Management
inferred← citeshttps://doi.org/10.1007/978-3-030-49345-5_17openalex-snapshot
Traveler Behavior Cognitive Reasoning Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-030-73050-5_22openalex-snapshot
Hybrid Genetic Algorithms to Solve the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-90877-5_12openalex-snapshot
Distribution of Personal Protective Equipment, Derived from the Presence of the COVID-19 Virus in Mexico
inferred← citeshttps://doi.org/10.1007/978-3-031-08223-8_3openalex-snapshot
Route Scheduling System for Multiple Self-driving Cars Using K-means and Bio-inspired Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-14537-7_1openalex-snapshot
The Bees Algorithm—A Gentle Introduction
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_10openalex-snapshot
On the Longest Flip Sequence to Untangle Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-031-63110-8_10openalex-snapshot
A Hybrid Algorithm Based on Tabu Search and K-Means for Solving the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-66200-3_1openalex-snapshot
Der Bienenalgorithmus – eine sanfte Einführung
inferred← citeshttps://doi.org/10.1007/978-3-032-19763-4_9openalex-snapshot
Fusion of UAV Images for 3D Road Defect Analysis: A Context-Enhanced Framework for Depth and Geospatial Mapping
inferred← citeshttps://doi.org/10.1007/978-3-032-23604-3_31openalex-snapshot
Multi-objective Optimization for Synthetic-to-Real Style Transfer
inferred← citeshttps://doi.org/10.1007/978-3-032-26319-3_39openalex-snapshot
Metaheuristic Performance on TSP Benchmarks: A Comparative Study
inferred← citeshttps://doi.org/10.1007/978-3-319-00542-3_6openalex-snapshot
Utilising the Chaos-Induced Discrete Self Organising Migrating Algorithm to Schedule the Lot-Streaming Flowshop Scheduling Problem with Setup Time
inferred← citeshttps://doi.org/10.1007/978-3-319-00951-3_11openalex-snapshot
On the Nearest Neighbor Algorithms for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-02141-6_4openalex-snapshot
Improved and Discrete Cuckoo Search for Solving the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07401-6_14openalex-snapshot
Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-07692-8_9openalex-snapshot
A Performance Comparison of Genetic Algorithm’s Mutation Operators in n-Cities Open Loop Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-15765-8_15openalex-snapshot
A Mathematical Model to Optimize Transport Cost and Inventory Level in a Single Level Logistic Network
inferred← citeshttps://doi.org/10.1007/978-3-319-19216-1_12openalex-snapshot
Optimization of Couriers’ Routes by Determining Best Route for Distributing Parcels in Urban Traffic
inferred← citeshttps://doi.org/10.1007/978-3-319-39384-1_42openalex-snapshot
Use of Different Movement Mechanisms in Cockroach Swarm Optimization Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-67618-0_21openalex-snapshot
Increasing the Efficiency of Logistics in Warehouse Using the Combination of Simple Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-68783-4_25openalex-snapshot
DTRP: A Flexible Deep Framework for Travel Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_26openalex-snapshot
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-21222-2_2openalex-snapshot
Comparative Analysis of Recombination Operators in Genetic Algorithms for the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-30976-2_60openalex-snapshot
A Novel Two-Level Hybrid Algorithm for Multiple Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-45483-1_14openalex-snapshot
A Parallel Discrete Firefly Algorithm on GPU for Permutation Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-981-15-1842-3_4openalex-snapshot
Review of Tour Generation for Solving Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/978-981-15-3836-0_2openalex-snapshot
Combinatorial Optimization Space
inferred← citeshttps://doi.org/10.1007/978-981-95-5429-4_7openalex-snapshot
BSD-MTSP Solver: A Tool for Bounded Single Depot Multiple Travelling Salesman Problems
inferred← citeshttps://doi.org/10.1007/978-981-97-0126-1_50openalex-snapshot
Multi-trip Optimization Model for Municipal Solid Waste Collection Systems Under Capacity and Operational Time Constraints
inferred← citeshttps://doi.org/10.1007/978-981-99-3970-1_5openalex-snapshot
Benchmarking for Discrete Cuckoo Search: Three Case Studies
inferred← citeshttps://doi.org/10.1007/s00291-024-00754-2openalex-snapshot
Optimizing combined tours: The truck-and-cargo-bike case
inferred← citeshttps://doi.org/10.1007/s00500-014-1219-7openalex-snapshot
Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time
inferred← citeshttps://doi.org/10.1007/s00500-014-1220-1openalex-snapshot
Utilization of analytic programming for the evolutionary synthesis of the robust multi-chaotic controller for selected sets of discrete chaotic systems
inferred← citeshttps://doi.org/10.1007/s00500-014-1222-zopenalex-snapshot
Particle swarm optimization algorithm driven by multichaotic number generator
inferred← citeshttps://doi.org/10.1007/s00500-014-1322-9openalex-snapshot
Random-key cuckoo search for the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s00500-016-2432-3openalex-snapshot
A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s00521-014-1717-7openalex-snapshot
A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s10462-025-11267-xopenalex-snapshot
Solving the traveling salesman problem with machine learning: a review of recent advances and challenges
inferred← citeshttps://doi.org/10.1007/s11277-021-09241-1openalex-snapshot
An Energy-efficient Data Collection Scheme by Mobile Element based on Markov Decision Process for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11704-024-40490-yopenalex-snapshot
A survey on deep learning-based algorithms for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s40295-025-00487-6openalex-snapshot
Optimal Multi-Client Trajectory Planning for A Low-Thrust Servicing Satellite in the Presence of Perturbations
inferred← citeshttps://doi.org/10.1007/s41207-024-00703-zopenalex-snapshot
Methods for improving macro- and micro-routing problems of municipal solid waste: a literature review
inferred← citeshttps://doi.org/10.1007/s41965-025-00200-4openalex-snapshot
Dissecting OLMS membrane algorithms: understanding the role of communication and evolutionary operators in optimization strategies
inferred← citeshttps://doi.org/10.1007/s42979-023-02053-zopenalex-snapshot
Scheduling System for Multiple Self-driving Cars Using K-Means and Bio-inspired Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/s43684-025-00103-2openalex-snapshot
Automated reinforcement learning for sequential ordering problem using hyperparameter optimization and metalearning
inferred← citeshttps://doi.org/10.1016/b978-0-12-815715-2.00014-2openalex-snapshot
On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art
inferred← citeshttps://doi.org/10.1016/b978-0-12-819714-1.00020-8openalex-snapshot
Traveling salesman problem: a perspective review of recent research and new results with bio-inspired metaheuristics
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105887openalex-snapshot
Discrete Spider Monkey Optimization for Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.108469openalex-snapshot
Discrete sparrow search algorithm for symmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.asr.2024.04.003openalex-snapshot
Optimal strategies for the exploration of near-by stars
inferred← citeshttps://doi.org/10.1016/j.camwa.2013.02.008openalex-snapshot
Analytic programming in the task of evolutionary synthesis of a controller for high order oscillations stabilization of discrete chaotic systems
inferred← citeshttps://doi.org/10.1016/j.cie.2016.10.022openalex-snapshot
Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.10.012openalex-snapshot
Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.02.018openalex-snapshot
A new mathematical programming formulation for the Single-Picker Routing 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.engappai.2022.104848openalex-snapshot
A graph convolutional encoder and multi-head attention decoder network for TSP via reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.12.047openalex-snapshot
Mix-opt: A new route operator for optimal coverage path planning for a fleet in an agricultural environment
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.04.023openalex-snapshot
Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113426openalex-snapshot
H2-SLAN: A hyper-heuristic based on stochastic learning automata network for obtaining, storing, and retrieving heuristic knowledge
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114639openalex-snapshot
A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115353openalex-snapshot
Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115556openalex-snapshot
A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115948openalex-snapshot
Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection
inferred← citeshttps://doi.org/10.1016/j.ipm.2014.10.003openalex-snapshot
On planning sightseeing tours with TripBuilder
inferred← citeshttps://doi.org/10.1016/j.jclepro.2017.04.005openalex-snapshot
Combining operational research and Life Cycle Assessment to optimize municipal solid waste collection in a district in Lima (Peru)
inferred← citeshttps://doi.org/10.1016/j.jmsy.2019.11.003openalex-snapshot
Resource management in decentralized industrial Automated Guided Vehicle systems
inferred← citeshttps://doi.org/10.1016/j.knosys.2021.107199openalex-snapshot
Development of Deer Hunting linked Earthworm Optimization Algorithm for solving large scale Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.procs.2017.11.165openalex-snapshot
Parallelizing an exact algorithm for the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.tre.2023.103168openalex-snapshot
Predicting drivers’ route trajectories in last-mile delivery using a pair-wise attention-based pointer neural network
inferred← citeshttps://doi.org/10.1049/tje2.12303openalex-snapshot
Reinforcement learning for the traveling salesman problem: Performance comparison of three algorithms
inferred← citeshttps://doi.org/10.1049/tje2.12393openalex-snapshot
Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem
inferred← citeshttps://doi.org/10.1080/13640461.2022.2078550openalex-snapshot
Reduction of incompatible intermixing of different steel grades in continuous casting by optimizing the casting sequence
inferred← citeshttps://doi.org/10.1080/24725854.2023.2213754openalex-snapshot
The drop box location problem
inferred← citeshttps://doi.org/10.1080/25765299.2019.1615172openalex-snapshot
Permutation rules and genetic algorithm to solve the traveling salesman problem
inferred← citeshttps://doi.org/10.1088/1742-6596/1373/1/012047openalex-snapshot
Minimizing Total Cost in Integrated Scheduling of Production and Distribution Using Ant Colony Optimization
inferred← citeshttps://doi.org/10.1088/1757-899x/1047/1/012080openalex-snapshot
Cooperative self-configuring nature-inspired algorithm for a scheduling problem
inferred← citeshttps://doi.org/10.1088/1757-899x/878/1/012026openalex-snapshot
Transportation modelling and solving Travelling Salesman problem
inferred← citeshttps://doi.org/10.1103/physreve.109.054114openalex-snapshot
Unified scaling for the optimal path length in disordered lattices
inferred← citeshttps://doi.org/10.1109/access.2020.3036702openalex-snapshot
Optimal Management of Mobile Energy Generation and Storage Systems
inferred← citeshttps://doi.org/10.1109/access.2021.3099425openalex-snapshot
Equidistributed Search+Probability Based Tracking Strategy to Locate an Air Pollutant Source With Two UAVs
inferred← citeshttps://doi.org/10.1109/access.2021.3133493openalex-snapshot
An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP
inferred← citeshttps://doi.org/10.1109/ccdc55256.2022.10034033openalex-snapshot
An Algorithm Framework for Traveling Salesman Problem Using Geometric Information
inferred← citeshttps://doi.org/10.1109/cec.2014.6900273openalex-snapshot
Scatter Search Algorithm with chaos based stochasticity
inferred← citeshttps://doi.org/10.1109/cec.2014.6900274openalex-snapshot
Chaos-driven Discrete Artificial Bee Colony
inferred← citeshttps://doi.org/10.1109/cec.2015.7257285openalex-snapshot
Using genetic algorithms to minimize the distance and balance the routes for the multiple Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/ceec.2016.7835918openalex-snapshot
Clonal Selection Algorithm parallelization with MPJExpress
inferred← citeshttps://doi.org/10.1109/cipls.2014.7007161openalex-snapshot
A genetic algorithm with an embedded Ikeda map applied to an order picking problem in a multi-aisle warehouse
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708338openalex-snapshot
Learning-driven Evolutionary Optimization for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/csis-iac70275.2026.11585063openalex-snapshot
Large Language Models for Designing Heuristic Components in Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1109/cts59431.2023.10288899openalex-snapshot
Planning of Drones Flight of Routes when Group Patrolling of Large Extended Territories
inferred← citeshttps://doi.org/10.1109/eurosim.2013.40openalex-snapshot
Path Planning Using Non-Euclidean Metric
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054054openalex-snapshot
Energy-Efficient 3D UAV Trajectory Design for Data Collection in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icbir61386.2024.10875933openalex-snapshot
Hybrid Ant Colony Optimization Method for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icbir69932.2026.11584862openalex-snapshot
Ant Colony Optimization for Solving Electric Vehicle Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622745openalex-snapshot
High-Precision Crop Monitoring Through UAV-Aided Sensor Data Collection
inferred← citeshttps://doi.org/10.1109/iceast64767.2025.11088197openalex-snapshot
A Hybrid Greedy Algorithm for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1109/icemis.2017.8273004openalex-snapshot
A transformation for multiple depot multiple traveling salesman problem
inferred← citeshttps://doi.org/10.1109/iciccs48265.2020.9120880openalex-snapshot
Improved Genetic Algorithm to Solve Small Scale Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icmlc.2012.6359531openalex-snapshot
A classification method based on Immune Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/icmsao.2017.7934866openalex-snapshot
Solving an Open Path Multiple Depot Multiple Traveling Salesman Problem after transformation
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561608openalex-snapshot
Behavior-Tree-Based Person Search for Symbiotic Autonomous Mobile Robot Tasks
inferred← citeshttps://doi.org/10.1109/infotech.2019.8860897openalex-snapshot
Adaptive Ant Colony Optimization Algorithm for Hierarchical Scheduling Problem
inferred← citeshttps://doi.org/10.1109/jiot.2024.3363139openalex-snapshot
Efficient Path Planning for UAVs to Recognize Chimneys With Excessive Exhaust Emissions
inferred← citeshttps://doi.org/10.1109/lars/sbr/wre.2018.00086openalex-snapshot
Autonomous Shopping Cart: A New Concept of Service Robot for Assisting Customers
inferred← citeshttps://doi.org/10.1109/sde.2013.6601451openalex-snapshot
Scheduling the Lot-Streaming Flowshop scheduling problem with setup time with the chaos-induced Enhanced Differential Evolution
inferred← citeshttps://doi.org/10.1109/tase.2021.3087353openalex-snapshot
Skeleton Curve-Guided Five-Axis Sweep Scanning for Surface With Multiple Holes
inferred← citeshttps://doi.org/10.1109/tla.2020.9049466openalex-snapshot
Development of a Pedagogical Graphical Interface for the Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tsp.2016.7760861openalex-snapshot
Traveling Salesman Problem optimization by means of graph-based algorithm
inferred← citeshttps://doi.org/10.1109/uksim.2014.18openalex-snapshot
Path Planning for Process Modelling in Chemical Engineering
inferred← citeshttps://doi.org/10.1109/uksim.2016.65openalex-snapshot
Solving NP-complete Problems Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1117/12.2501579openalex-snapshot
Solution of travelling salesman problem applied to Wireless Sensor Networks (WSN) through the MST and B&B methods
inferred← citeshttps://doi.org/10.1142/9789813200449_0042openalex-snapshot
An improved genetic algorithm based on k-means clustering for solving traveling salesman problem
inferred← citeshttps://doi.org/10.1142/s2301385014500046openalex-snapshot
3D Minimum Fuel Route Planning and Path Generation for a Fuel Cell Powered UAV
inferred← citeshttps://doi.org/10.1145/2743065.2743103openalex-snapshot
A Modified Two Part Chromosome Crossover for Solving MTSP Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1155/2017/8042436openalex-snapshot
Improving the Fine-Tuning of Metaheuristics: An Approach Combining Design of Experiments and Racing Algorithms
inferred← citeshttps://doi.org/10.1155/2018/8072621openalex-snapshot
The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance
inferred← citeshttps://doi.org/10.1155/acis/5324998openalex-snapshot
DNCCLA: Discrete New Caledonian Crow Learning Algorithm for Solving Traveling Salesman Problem
inferred← citeshttps://doi.org/10.11591/tijee.v15i2.1554openalex-snapshot
Heuristic Approaches to Solve Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2021.0193openalex-snapshot
An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0349395openalex-snapshot
Genetic algorithm-based coverage path planning for autonomous aircraft cabin cleaning by reconfigurable robot
inferred← citeshttps://doi.org/10.14393/ufu.di.2020.563openalex-snapshot
Coordenação de Múltiplos Veículos Autônomos de Entrega Usando K-Means e Algoritmos Bio-Inspirados
inferred← citeshttps://doi.org/10.14569/ijacsa.2014.050110openalex-snapshot
Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs
inferred← citeshttps://doi.org/10.1515/jisys-2020-0042openalex-snapshot
MAPSOFT: A Multi-Agent based Particle Swarm Optimization Framework for Travelling Salesman Problem
inferred← citeshttps://doi.org/10.15598/aeee.v14i3.1166openalex-snapshot
Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Discrete Chaotic LOZI Map
inferred← citeshttps://doi.org/10.15622/ia.24.3.3openalex-snapshot
Planning UAV Flight Trajectories for Monitoring Large Areas
inferred← citeshttps://doi.org/10.17516/1997-1397-2017-10-4-463-473openalex-snapshot
Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.17587/mau.24.374-381openalex-snapshot
Planning of UAV Flight Routes in the Problems of Group Patrolling of the Extended Territories
inferred← citeshttps://doi.org/10.17770/etr2013vol2.867openalex-snapshot
Path Planning Usage for Autonomous Agents
inferred← citeshttps://doi.org/10.17770/etr2015vol3.188openalex-snapshot
Path Planning Methods in Chemical Engineering
inferred← citeshttps://doi.org/10.17993/3ctecno.2018.v7n1e25.20-42openalex-snapshot
ESTUDIO Y DISEÑO DE UNA RED DE TRANSPORTE PÚBLICO INTERURBANO EN LAS COMARCAS DE “L’ALCOIÀ” Y “EL COMTAT”
inferred← citeshttps://doi.org/10.18201/ijisae.2019252784openalex-snapshot
Solution of Multiple Travelling Salesman Problem using Particle Swarm Optimization based Algorithms
inferred← citeshttps://doi.org/10.18698/0236-3933-2019-3-46-63openalex-snapshot
Nature-Inspired Algorithms for Solving a Hierarchical Scheduling Problem in Short-Term Production Planning
inferred← citeshttps://doi.org/10.20944/preprints202401.0056.v1openalex-snapshot
Optimization of Greedy Randomized Adaptive Search Procedure
inferred← citeshttps://doi.org/10.21580/jnsmr.2021.7.1.3687openalex-snapshot
Minimization of time distribution of ballots with Greedy algorithms in Jombang Regency
inferred← citeshttps://doi.org/10.22214/ijraset.2022.47264openalex-snapshot
Vehicle Routing Using Genetic Algorithm and Machine Learning
inferred← citeshttps://doi.org/10.22441/sinergi.2018.2.010openalex-snapshot
OPTIMIZATION OF GOODS DISTRIBUTION ROUTE ASSISTED BY GOOGLE MAP WITH CHEAPEST INSERTION HEURISTIC ALGORITHM (CIH)
inferred← citeshttps://doi.org/10.22487/2540766x.2022.v19.i1.15807openalex-snapshot
Optimasi Rute Distribusi Koran Radar Sulteng Palu Menggunakan Algoritma Genetika
inferred← citeshttps://doi.org/10.2514/1.g008961openalex-snapshot
Rapid Cost Evaluation Model for Order-Undetermined Multi-Asteroid Rendezvous Missions
inferred← citeshttps://doi.org/10.2514/1.i010452openalex-snapshot
Dynamic Resource Allocation for Efficient Sharing of Services from Heterogeneous Autonomous Vehicles
inferred← citeshttps://doi.org/10.2514/6.2015-2331openalex-snapshot
Dynamic Resource Allocation for Sharing Multi-UAV Services
inferred← citeshttps://doi.org/10.26686/wgtn.28049429openalex-snapshot
Error Space Search for Combinatorial Optimization
inferred← citeshttps://doi.org/10.30837/2522-9818.2019.7.102openalex-snapshot
DETERMINATION OF THE OPTIMAL CIRCULAR ROUTE PASSING THROUGH THE GIVEN SET OF POINTS ON THE MAP
inferred← citeshttps://doi.org/10.3390/app14083151openalex-snapshot
An Efficiency Boost for Genetic Algorithms: Initializing the GA with the Iterative Approximate Method for Optimizing the Traveling Salesman Problem—Experimental Insights
inferred← citeshttps://doi.org/10.3390/electronics9122093openalex-snapshot
A Multimodal User Interface for an Assistive Robotic Shopping Cart
inferred← citeshttps://doi.org/10.3390/math10193647openalex-snapshot
An Optimized Discrete Dragonfly Algorithm Tackling the Low Exploitation Problem for Solving TSP
inferred← citeshttps://doi.org/10.3390/mca18030459openalex-snapshot
A Parametric Hybrid Method for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.3390/su132112325openalex-snapshot
Adriatic Sea Hub Ports Feeder Service Optimization Using Multi-Criteria Decision-Making Methods
inferred← citeshttps://doi.org/10.3390/su15021298openalex-snapshot
Using Transport to Quantify the Impact of Vertical Integration on the Construction Supply Chain: A New Zealand Assessment
inferred← citeshttps://doi.org/10.3390/wevj15090383openalex-snapshot
Energy-Aware 3D Path Planning by Autonomous Ground Vehicle in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.34288/jri.v1i3.35openalex-snapshot
IMPLEMENTASI ALGORITMA HILL CLIMBING PADA PENENTUAN JARAK TERPENDEK KOTA WISATA DI INDONESIA
inferred← citeshttps://doi.org/10.37394/23209.2024.21.18openalex-snapshot
The Solution of Traveling Salesman Problem with Time Windows by MILP in Matlab Code
inferred← citeshttps://doi.org/10.3991/ijim.v9i1.4196openalex-snapshot
Impact of Crossover Probability on Symmetric Travel Salesman Problem Efficiency
inferred← citeshttps://doi.org/10.4018/ijamc.2015010103openalex-snapshot
An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality
inferred← citeshttps://doi.org/10.46254/an14.20240339openalex-snapshot
A Time-Discretized Linear Integer Programming Model for Vacation Route Planning
inferred← citeshttps://doi.org/10.5121/ijcses.2016.7102openalex-snapshot
Non - Euclidean Metric and Path Planning
inferred← citeshttps://doi.org/10.52998/trjmms.1531141openalex-snapshot
A Novel Energy-Aware Path Planning by Autonomous Underwater Vehicle in Underwater Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5505/pajes.2015.38981openalex-snapshot
A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
inferred← citeshttps://doi.org/10.5505/pajes.2016.38981openalex-snapshot
A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
inferred← citeshttps://doi.org/10.5555/2694443.2694462openalex-snapshot
Excel solvers for the traveling salesman problem
inferred← citeshttps://doi.org/10.5604/01.3001.0012.7153openalex-snapshot
LOGISTIC-COMBINATORIAL DUALISM OF SETTING THE TRAVELLING SALESMAN
inferred← citeshttps://doi.org/10.5772/intechopen.78197openalex-snapshot
Novel Trends in the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/intechopen.93125openalex-snapshot
CUDA Accelerated 2-OPT Local Search for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.70675/7e3efae5zc471z461ezbec7zfb023a3edba1openalex-snapshot
Considération de la dimension humaine dans l'optimisation de tournées de soins et services à domicile soumises à des perturbations
inferred← citeshttps://doi.org/10.9790/5728-1205058084openalex-snapshot
A Tabu Search Approximation for finding the Shortest distance using Traveling Salesman 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.