Pages that link to "Item:Q1926697"
From MaRDI portal
The following pages link to The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697):
Displayed 28 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- 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)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← 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)
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← 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)
- In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
- The bus sightseeing problem (Q6080627) (← links)