Pages that link to "Item:Q2355862"

The following pages link to An effective PSO-inspired algorithm for the team orienteering problem (Q2355862):

Displaying 23 items.

• Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points (Q299921) (← links)
• A novel multi-objective particle swarm optimization with multiple search strategies (Q320076) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← 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)
• Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm (Q2098052) (← 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)
• 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)
• Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
• A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← 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)
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
• GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method (Q6495385) (← links)