Pages that link to "Item:Q1848588"

The following pages link to An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588):

Displaying 16 items.

• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Quality inspection scheduling for multi-unit service enterprises (Q953432) (← links)
• Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• The freight consolidation and containerization problem (Q2256168) (← links)
• A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
• Finding the shortest path with vertex constraint over large graphs (Q2325209) (← links)
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
• Advanced planning and scheduling based on precedence and resource constraints for e-plant chains (Q3159643) (← links)
• Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
• Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility (Q5114999) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
• A branch‐and‐dive heuristic for single vehicle snow removal (Q6092642) (← links)