Pages that link to "Item:Q1764755"

The following pages link to A TABU search heuristic for the team orienteering problem (Q1764755):

Displaying 50 items.

• The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• The multi-district team orienteering problem (Q336760) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The capacitated team orienteering problem with incomplete service (Q375974) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
• Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• The undirected capacitated arc routing problem with profits (Q975994) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
• Algorithm selection for the team orienteering problem (Q2163778) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• A memetic algorithm for the multiperiod vehicle routing problem with profit (Q2355888) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• An exact algorithm for team orienteering problems (Q2477614) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
• The split delivery capacitated team orienteering problem (Q2811321) (← links)
• Data-Driven Robust Resource Allocation with Monotonic Cost Functions (Q5031001) (← links)
• The orienteering problem with variable profits (Q5326782) (← links)
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)