Pages that link to "Item:Q2664363"

The following pages link to A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363):

Displaying 11 items.

• An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← links)
• The synchronized multi-assignment orienteering problem (Q2097466) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• Algorithm selection for the team orienteering problem (Q2163778) (← links)
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
• The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization (Q2676381) (← links)
• The first AI4TSP competition: learning to solve stochastic routing problems (Q6103656) (← links)
• Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)