Pieter Vansteenwegen

Orcid: 0000-0002-5646-669X

According to our database1, Pieter Vansteenwegen authored at least 78 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A demand-responsive feeder service with a maximum headway at mandatory stops.
Networks, January, 2024

A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area.
J. Rail Transp. Plan. Manag., 2024

Speeding up the Passenger Assignment Problem in transit planning by the Direct Link Network representation.
Comput. Oper. Res., 2024

Joint optimization of train platforming and shunting with service scheduling at a railway hub.
Comput. Ind. Eng., 2024

The traveling purchaser problem for perishable foods.
Comput. Ind. Eng., 2024

A simulation-based genetic algorithm for a semi-automated warehouse scheduling problem with processing time variability.
Appl. Soft Comput., 2024

Reschedule the Shunting and Service Scheduling Plan After Disturbances at a Chinese High-Speed Railway Depot.
IEEE Access, 2024

Q-Learning Based Framework for Solving the Stochastic E-waste Collection Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

2023
An efficient multi-agent approach to order picking and robot scheduling in a robotic mobile fulfillment system.
Simul. Model. Pract. Theory, September, 2023

Differences in Optimised Trajectories Under Selfish and collaborative Behaviour of multi-class Freeway Traffic.
Proceedings of the 8th International Conference on Models and Technologies for Intelligent Transportation Systems, 2023

A Tabu Search Algorithm for the Traveling Purchaser Problem with Transportation Time Limit.
Proceedings of the Computational Logistics - 14th International Conference, 2023

GRASP Solution Approach for the E-Waste Collection Problem.
Proceedings of the Computational Logistics - 14th International Conference, 2023

2022
Solving the Agile Earth Observation Satellite Scheduling Problem With Time-Dependent Transition Times.
IEEE Trans. Syst. Man Cybern. Syst., 2022

A survey on the transit network design and frequency setting problem.
Public Transp., 2022

A column generation algorithm for the demand-responsive feeder service with mandatory and optional, clustered bus-stops.
Networks, 2022

Designing bus line plans for realistic cases - the Utrecht case study.
Expert Syst. Appl., 2022

The design of a flexible bus line plan.
Expert Syst. Appl., 2022

Time dependent orienteering problem with time windows and service time dependent profits.
Comput. Oper. Res., 2022

Two-phase Matheuristic for the vehicle routing problem with reverse cross-docking.
Ann. Math. Artif. Intell., 2022

The grid based approach, a fast local evaluation technique for line planning.
4OR, 2022

Algorithm Selection for the Team Orienteering Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022

2021
The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach.
Comput. Ind. Eng., 2021

A matheuristic algorithm for the vehicle routing problem with cross-docking.
Appl. Soft Comput., 2021

Vehicle Routing Problem with Forward and Reverse Cross-Docking: Formulation and Matheuristic Approach.
Proceedings of the 17th IEEE International Conference on Automation Science and Engineering, 2021

2020
Large neighborhood search for the bike request scheduling problem.
Int. Trans. Oper. Res., 2020

Considering emissions in the transit network design and frequency setting problem with a heterogeneous fleet.
Eur. J. Oper. Res., 2020

An Exact Algorithm for Agile Earth Observation Satellite Scheduling with Time-Dependent Profits.
Comput. Oper. Res., 2020

A Matheuristic Algorithm for Solving the Vehicle Routing Problem with Cross-Docking.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm.
Proceedings of the Computational Logistics - 11th International Conference, 2020

Adaptive Large Neighborhood Search for Vehicle Routing Problem with Cross-Docking.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Towards a conflict prevention strategy applicable for real-time railway traffic management.
J. Rail Transp. Plan. Manag., 2019

Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times.
Comput. Oper. Res., 2019

Simulated annealing for the single-vehicle cyclic inventory routing problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Simulated Annealing for the Multi-Vehicle Cyclic Inventory Routing Problem.
Proceedings of the 15th IEEE International Conference on Automation Science and Engineering, 2019

2017
A metaheuristic solution approach for the time-constrained project scheduling problem.
OR Spectr., 2017

Optimization of supplements and buffer times in passenger robust timetabling.
J. Rail Transp. Plan. Manag., 2017

Well-tuned algorithms for the Team Orienteering Problem with Time Windows.
J. Oper. Res. Soc., 2017

The time-dependent orienteering problem with time windows: a fast ant colony system.
Ann. Oper. Res., 2017

Reducing logistic vehicle kilometers in a city area based on network changes.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

2016
Automated platforming & routing of trains in all Belgian railway stations.
Expert Syst. Appl., 2016

Solving the stochastic time-dependent orienteering problem with time windows.
Eur. J. Oper. Res., 2016

An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems.
Eur. J. Oper. Res., 2016

Orienteering Problem: A survey of recent variants, solution approaches and applications.
Eur. J. Oper. Res., 2016

A two-phase algorithm for the cyclic inventory routing problem.
Eur. J. Oper. Res., 2016

2015
A minimum cost network flow model for the maximum covering and patrol routing problem.
Eur. J. Oper. Res., 2015

Conference Report: Recommender Systems in Tourism.
IEEE Intell. Informatics Bull., 2015

A fast metaheuristic for the travelling salesperson problem with hotel selection.
4OR, 2015

TouRS'15: Workshop on Tourism Recommender Systems.
Proceedings of the 9th ACM Conference on Recommender Systems, 2015

An Integrated Perspective on Traffic Management and Logistic Optimization.
Proceedings of the IEEE 18th International Conference on Intelligent Transportation Systems, 2015

2014
A fast solution method for the time-dependent orienteering problem.
Eur. J. Oper. Res., 2014

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem.
Eur. J. Oper. Res., 2014

A memetic algorithm for the orienteering problem with hotel selection.
Eur. J. Oper. Res., 2014

Improving the robustness in railway station areas.
Eur. J. Oper. Res., 2014

Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2013
The Multiconstraint Team Orienteering Problem with Multiple Time Windows.
Transp. Sci., 2013

Robust railway station planning: An interaction between routing, timetabling and platforming.
J. Rail Transp. Plan. Manag., 2013

Integrating public transportation in personalised electronic tourist guides.
Comput. Oper. Res., 2013

Heuristics for the traveling repairman problem with profits.
Comput. Oper. Res., 2013

A memetic algorithm for the travelling salesperson problem with hotel selection.
Comput. Oper. Res., 2013

2012
The travelling salesperson problem with hotel selection.
J. Oper. Res. Soc., 2012

2011
The City Trip Planner: An expert system for tourists.
Expert Syst. Appl., 2011

The orienteering problem: A survey.
Eur. J. Oper. Res., 2011

2010
Trip Planning Functionalities: State of the Art and Future.
J. Inf. Technol. Tour., 2010

Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows.
Comput. Oper. Res., 2010

A Path Relinking approach for the Team Orienteering Problem.
Comput. Oper. Res., 2010

Tourist Trip Planning Functionalities: State-of-the-Art and Future.
Proceedings of the Current Trends in Web Engineering, 2010

Personalized Tourist Route Generation.
Proceedings of the Current Trends in Web Engineering, 2010

Hybrid Approach for the Public Transportation Time Dependent Orienteering Problem with Time Windows.
Proceedings of the Hybrid Artificial Intelligence Systems, 5th International Conference, 2010

2009
A guided local search metaheuristic for the team orienteering problem.
Eur. J. Oper. Res., 2009

Iterated local search for the team orienteering problem with time windows.
Comput. Oper. Res., 2009

Planning in tourism and public transportation.
4OR, 2009

A Mobile Tourist Decision Support System for Small Footprint Devices.
Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

Intelligent Routing System for a Personalised Electronic Tourist Guide.
Proceedings of the Information and Communication Technologies in Tourism, 2009

2008
Automated Parameterisation of a Metaheuristic for the Orienteering Problem.
Proceedings of the Adaptive and Multilevel Metaheuristics, 2008

A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides.
Appl. Artif. Intell., 2008

2007
The Mobile Tourist Guide: An OR Opportunity.
OR Insight, 2007

2006
Developing railway timetables which guarantee a better service.
Eur. J. Oper. Res., 2006

Selection of tourist attractions and routing using personalised electronic guides.
Proceedings of the Information and Communication Technologies in Tourism, 2006


  Loading...