Pages that link to "Item:Q2356249"
From MaRDI portal
The following pages link to A fast solution method for the time-dependent orienteering problem (Q2356249):
Displaying 24 items.
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition (Q1727293) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
- Ant colony optimization for path planning in search and rescue operations (Q2083926) (← links)
- Rollout-based routing strategies with embedded prediction: a fish trawling application (Q2108157) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory (Q2318262) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method (Q6495385) (← links)
