Pages that link to "Item:Q1919848"
From MaRDI portal
The following pages link to Genetic algorithms for the traveling salesman problem (Q1919848):
Displaying 31 items.
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← links)
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities. (Q1418590) (← links)
- Real-time multiserver and multichannel systems with shortage of maintenance crews. (Q1596982) (← links)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
- Some issues of designing genetic algorithms for traveling salesman problems (Q1764595) (← links)
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- An evolutionary algorithm approach to the share of choices problem in the product line design (Q1885999) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem (Q2198264) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172) (← links)
- A genetic algorithm approach to estimate lower bounds of the star discrepancy (Q3068191) (← links)
- Last-Mile Shared Delivery: A Discrete Sequential Packing Approach (Q3387932) (← links)
- (Q4782946) (← links)
- (Q5321485) (← links)
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem (Q5950645) (← links)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)
- Metaheuristics: A Canadian Perspective (Q6102854) (← links)
- A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework (Q6151605) (← links)
- An improved transformer model with multi-head attention and attention to attention for low-carbon multi-depot vehicle routing problem (Q6589088) (← links)