Pages that link to "Item:Q732904"

The following pages link to Heuristics for the multi-period orienteering problem with multiple time windows (Q732904):

Displaying 36 items.

• Notes on the single route lateral transhipment problem (Q276506) (← links)
• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← 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)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← 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)
• Multi-directional local search (Q339654) (← links)
• The capacitated team orienteering problem with incomplete service (Q375974) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
• The orienteering problem: a survey (Q617509) (← 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)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Vehicle routing with arrival time diversification (Q1711450) (← links)
• The sales force sizing problem with multi-period workload assignments, and service time windows (Q1725834) (← links)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← 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)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) (Q2669724) (← links)
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method (Q6495385) (← links)
• A cooperative team orienteering optimisation model and a customised resolution metaheuristic (Q6551094) (← links)