Pages that link to "Item:Q2255940"
From MaRDI portal
The following pages link to An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940):
Displaying 16 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Methods for multi-objective optimization: an analysis (Q508908) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
- The synchronized multi-assignment orienteering problem (Q2097466) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← 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)
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)