Pages that link to "Item:Q1609914"

The following pages link to A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914):

Displaying 32 items.

• The clustered orienteering problem (Q296772) (← links)
• Tabu search for the real-world carpooling problem (Q306096) (← links)
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• The effective application of a new approach to the generalized orienteering problem (Q972648) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
• A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
• Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
• An iterated local search for a multi‐period orienteering problem arising in a car patrolling application (Q6180047) (← links)
• A cooperative team orienteering optimisation model and a customised resolution metaheuristic (Q6551094) (← links)
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)