Pages that link to "Item:Q1268132"
From MaRDI portal
The following pages link to Genetic algorithms and traveling salesman problems (Q1268132):
Displayed 15 items.
- Genetic algorithms and their statistical applications: an introduction (Q671671) (← links)
- Heuristic approaches for batching jobs in printed circuit board assembly (Q868134) (← links)
- A new genetic algorithm for solving nonconvex nonlinear programming problems (Q924398) (← links)
- Quality inspection scheduling for multi-unit service enterprises (Q953432) (← links)
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791) (← links)
- A dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← links)
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
- An evolutionary algorithm approach to the share of choices problem in the product line design (Q1885999) (← links)
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time (Q2378748) (← links)
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
- Optimality conditions to the acyclic travelling salesman problem. (Q2467841) (← links)
- An effective genetic algorithm approach to large scale mixed integer programming problems (Q2489337) (← links)
- A variable-grouping based genetic algorithm for large-scale integer programming (Q2509223) (← links)
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study (Q5945206) (← links)
- An efficient evolutionary algorithm for accurate polygonal approximation (Q5953123) (← links)