Pages that link to "Item:Q1317095"

The following pages link to A heuristic for the multiple tour maximum collection problem (Q1317095):

Displaying 42 items.

• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The capacitated team orienteering problem with incomplete service (Q375974) (← 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)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← 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 hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← 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 stochastic time-dependent orienteering problem with time windows (Q1751260) (← 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)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← 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)
• Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
• Fairness in ambulance routing for post disaster management (Q2089315) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems (Q2806998) (← links)
• The split delivery capacitated team orienteering problem (Q2811321) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
• Integrated optimization of planetary rover layout and exploration routes (Q5058710) (← links)
• Solving Relaxation Orienteering Problem Using DCA-CUT (Q5356984) (← links)
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
• A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
• The daily swab test collection problem (Q6547116) (← links)