Pieter Vansteenwegen

From MaRDI portal
Person:296577

Available identifiers

zbMath Open vansteenwegen.pieterMaRDI QIDQ296577

List of research outcomes





PublicationDate of PublicationType
Q-learning based framework for solving the stochastic E-waste collection problem2024-11-12Paper
Speeding up the passenger assignment problem in transit planning by the direct link network representation2024-07-08Paper
A demand‐responsive feeder service with a maximum headway at mandatory stops2024-01-18Paper
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops2023-12-12Paper
Large neighborhood search for the bike request scheduling problem2023-11-17Paper
Timetable compression using max-plus automata applied to large railway networks2023-07-11Paper
The grid based approach, a fast local evaluation technique for line planning2022-11-17Paper
Algorithm selection for the team orienteering problem2022-08-11Paper
Time dependent orienteering problem with time windows and service time dependent profits2022-06-22Paper
An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits2021-04-20Paper
Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times2019-09-25Paper
Solving the stochastic time-dependent orienteering problem with time windows2018-05-24Paper
The time-dependent orienteering problem with time windows: a fast ant colony system2017-08-25Paper
A metaheuristic solution approach for the time-constrained project scheduling problem2017-07-06Paper
Heuristics for the traveling repairman problem with profits2016-11-10Paper
A memetic algorithm for the travelling salesperson problem with hotel selection2016-11-10Paper
An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems2016-10-07Paper
A two-phase algorithm for the cyclic inventory routing problem2016-10-07Paper
Orienteering problem: a survey of recent variants, solution approaches and applications2016-10-07Paper
A minimum cost network flow model for the maximum covering and patrol routing problem2016-10-06Paper
An iterated local search algorithm for the single-vehicle cyclic inventory routing problem2016-06-23Paper
A fast solution method for the time-dependent orienteering problem2015-07-29Paper
A fast metaheuristic for the travelling salesperson problem with hotel selection2015-04-29Paper
Improving the robustness in railway station areas2015-02-19Paper
A memetic algorithm for the orienteering problem with hotel selection2015-02-04Paper
Heuristics for the traveling repairman problem with profits2012-09-28Paper
The orienteering problem: a survey2011-01-21Paper
A path relinking approach for the team orienteering problem2010-06-11Paper
Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows2010-06-11Paper
Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling2009-12-02Paper
Iterated local search for the team orienteering problem with time windows2009-08-14Paper
A guided local search metaheuristic for the team orienteering problem2009-01-08Paper
Developing railway timetables which guarantee a better service2006-05-29Paper

Research outcomes over time

This page was built for person: Pieter Vansteenwegen