Pages that link to "Item:Q858328"

The following pages link to A random-key genetic algorithm for the generalized traveling salesman problem (Q858328):

Displaying 34 items.

• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
• Path planning on a cuboid using genetic algorithms (Q942312) (← links)
• A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system (Q2017925) (← links)
• A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models (Q2082169) (← links)
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
• Traveling salesman problem across well-connected cities and with location-dependent edge lengths (Q2274794) (← links)
• Discrete heat transfer search for solving travelling salesman problem (Q2668543) (← links)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
• The Generalized Covering Salesman Problem (Q2815466) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
• A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem (Q5011675) (← links)
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
• Algorithm for solving the Discrete-Continuous Inspection Problem (Q5150054) (← links)
• A Sensitive Metaheuristic for Solving a Large Optimization Problem (Q5448681) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation (Q6079857) (← links)
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)
• An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)