The following pages link to Pieter Vansteenwegen (Q296577):
Displaying 34 items.
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← links)
- (Q319916) (redirect page) (← links)
- A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
- An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems (Q322829) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling (Q1041406) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
- The grid based approach, a fast local evaluation technique for line planning (Q2095522) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- Algorithm selection for the team orienteering problem (Q2163778) (← links)
- Improving the robustness in railway station areas (Q2256230) (← links)
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
- A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
- A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
- A metaheuristic solution approach for the time-constrained project scheduling problem (Q2362168) (← links)
- A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- Developing railway timetables which guarantee a better service (Q2491798) (← links)
- A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
- Heuristics for the Traveling Repairman Problem with Profits (Q2917285) (← links)
- A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops (Q6064160) (← links)
- Large neighborhood search for the bike request scheduling problem (Q6069919) (← links)
- Timetable compression using max-plus automata applied to large railway networks (Q6113561) (← links)
- A demand‐responsive feeder service with a maximum headway at mandatory stops (Q6180044) (← links)
- Speeding up the passenger assignment problem in transit planning by the direct link network representation (Q6568464) (← links)
- Q-learning based framework for solving the stochastic E-waste collection problem (Q6635977) (← links)
