default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPieter Vansteenwegen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Jintang Shi
, Haodong Li, Daoqi Wang, Pieter Vansteenwegen:
Reschedule the Shunting and Service Scheduling Plan After Disturbances at a Chinese High-Speed Railway Depot. IEEE Access 12: 38615-38630 (2024)- [j54]Sander Teck, Reginald Dewil, Pieter Vansteenwegen:
A simulation-based genetic algorithm for a semi-automated warehouse scheduling problem with processing time variability. Appl. Soft Comput. 160: 111713 (2024) - [j53]Ilker Küçükoglu, Pieter Vansteenwegen, Dirk Cattrysse:
The traveling purchaser problem for perishable foods. Comput. Ind. Eng. 195: 110424 (2024) - [j52]Jintang Shi, Haodong Li, Pieter Vansteenwegen:
Joint optimization of train platforming and shunting with service scheduling at a railway hub. Comput. Ind. Eng. 197: 110544 (2024) - [j51]Dilay Aktas, Evert Vermeir, Pieter Vansteenwegen:
Speeding up the Passenger Assignment Problem in transit planning by the Direct Link Network representation. Comput. Oper. Res. 167: 106647 (2024) - [j50]Bryan David Galarza Montenegro, Kenneth Sörensen, Pieter Vansteenwegen:
A demand-responsive feeder service with a maximum headway at mandatory stops. Networks 83(1): 100-130 (2024) - [c22]Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen:
Q-Learning Based Framework for Solving the Stochastic E-waste Collection Problem. EvoStar 2024: 49-64 - 2023
- [j49]Sander Teck, Pieter Vansteenwegen, Reginald Dewil:
An efficient multi-agent approach to order picking and robot scheduling in a robotic mobile fulfillment system. Simul. Model. Pract. Theory 127: 102789 (2023) - [c21]Ilker Küçükoglu, Pieter Vansteenwegen, Dirk Cattrysse:
A Tabu Search Algorithm for the Traveling Purchaser Problem with Transportation Time Limit. ICCL 2023: 248-259 - [c20]Aldy Gunawan, Dang Viet Anh Nguyen, Pham Kien Minh Nguyen, Pieter Vansteenwegen:
GRASP Solution Approach for the E-Waste Collection Problem. ICCL 2023: 260-275 - [c19]Maarten Wens, Mohammad Ali Arman, Ismail M. Abuamer, Chris M. J. Tampère, Pieter Vansteenwegen:
Differences in Optimised Trajectories Under Selfish and collaborative Behaviour of multi-class Freeway Traffic. MT-ITS 2023: 1-6 - 2022
- [j48]Evert Vermeir, Javier Durán-Micco, Pieter Vansteenwegen:
The grid based approach, a fast local evaluation technique for line planning. 4OR 20(4): 603-635 (2022) - [j47]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
Two-phase Matheuristic for the vehicle routing problem with reverse cross-docking. Ann. Math. Artif. Intell. 90(7-9): 915-949 (2022) - [j46]M. Khodadadian, Ali Divsalar, C. Verbeeck, Aldy Gunawan, Pieter Vansteenwegen:
Time dependent orienteering problem with time windows and service time dependent profits. Comput. Oper. Res. 143: 105794 (2022) - [j45]Javier Durán-Micco, Marcel E. van Kooten Niekerk, Pieter Vansteenwegen:
Designing bus line plans for realistic cases - the Utrecht case study. Expert Syst. Appl. 187: 115918 (2022) - [j44]Elina Avila-Ordóñez, Chris M. J. Tampère, Pablo Vanegas Peralta, Pieter Vansteenwegen:
The design of a flexible bus line plan. Expert Syst. Appl. 203: 117352 (2022) - [j43]Bryan David Galarza Montenegro, Kenneth Sörensen, Pieter Vansteenwegen:
A column generation algorithm for the demand-responsive feeder service with mandatory and optional, clustered bus-stops. Networks 80(3): 274-296 (2022) - [j42]Javier Durán-Micco, Pieter Vansteenwegen:
A survey on the transit network design and frequency setting problem. Public Transp. 14(1): 155-190 (2022) - [j41]Guansheng Peng, Guopeng Song, Yongming He, Jing Yu, Shang Xiang, Lining Xing, Pieter Vansteenwegen:
Solving the Agile Earth Observation Satellite Scheduling Problem With Time-Dependent Transition Times. IEEE Trans. Syst. Man Cybern. Syst. 52(3): 1614-1625 (2022) - [c18]Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen:
Algorithm Selection for the Team Orienteering Problem. EvoCOP 2022: 33-45 - 2021
- [j40]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
A matheuristic algorithm for the vehicle routing problem with cross-docking. Appl. Soft Comput. 103: 107163 (2021) - [j39]Vincent F. Yu, Audrey Tedja Widjaja, Aldy Gunawan, Pieter Vansteenwegen:
The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach. Comput. Ind. Eng. 157: 107320 (2021) - [c17]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
Vehicle Routing Problem with Forward and Reverse Cross-Docking: Formulation and Matheuristic Approach. CASE 2021: 1467-1472 - 2020
- [j38]Guansheng Peng, Guopeng Song, Lining Xing, Aldy Gunawan, Pieter Vansteenwegen:
An Exact Algorithm for Agile Earth Observation Satellite Scheduling with Time-Dependent Profits. Comput. Oper. Res. 120: 104946 (2020) - [j37]Javier Durán-Micco, Evert Vermeir, Pieter Vansteenwegen:
Considering emissions in the transit network design and frequency setting problem with a heterogeneous fleet. Eur. J. Oper. Res. 282(2): 580-592 (2020) - [j36]Nicholas Vergeylen, Kenneth Sörensen, Pieter Vansteenwegen:
Large neighborhood search for the bike request scheduling problem. Int. Trans. Oper. Res. 27(6): 2695-2714 (2020) - [c16]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
Adaptive Large Neighborhood Search for Vehicle Routing Problem with Cross-Docking. CEC 2020: 1-8 - [c15]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm. ICCL 2020: 167-182 - [c14]Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu:
A Matheuristic Algorithm for Solving the Vehicle Routing Problem with Cross-Docking. LION 2020: 9-15
2010 – 2019
- 2019
- [j35]Guansheng Peng, Reginald Dewil, Cédric Verbeeck, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen:
Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times. Comput. Oper. Res. 111: 84-98 (2019) - [j34]Sofie Van Thielen, Francesco Corman, Pieter Vansteenwegen:
Towards a conflict prevention strategy applicable for real-time railway traffic management. J. Rail Transp. Plan. Manag. 11 (2019) - [c13]Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen:
Simulated Annealing for the Multi-Vehicle Cyclic Inventory Routing Problem. CASE 2019: 691-696 - [c12]Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen:
Simulated annealing for the single-vehicle cyclic inventory routing problem. GECCO (Companion) 2019: 145-146 - 2017
- [j33]Cédric Verbeeck, Pieter Vansteenwegen, El-Houssaine Aghezzaf:
The time-dependent orienteering problem with time windows: a fast ant colony system. Ann. Oper. Res. 254(1-2): 481-505 (2017) - [j32]Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen, Kun Lu:
Well-tuned algorithms for the Team Orienteering Problem with Time Windows. J. Oper. Res. Soc. 68(8): 861-876 (2017) - [j31]Sofie Burggraeve, Pieter Vansteenwegen:
Optimization of supplements and buffer times in passenger robust timetabling. J. Rail Transp. Plan. Manag. 7(3): 171-186 (2017) - [j30]Cédric Verbeeck, Vincent Van Peteghem, Mario Vanhoucke, Pieter Vansteenwegen, El-Houssaine Aghezzaf:
A metaheuristic solution approach for the time-constrained project scheduling problem. OR Spectr. 39(2): 353-371 (2017) - [c11]Pieter Vansteenwegen, Corrinne Luteyn:
Reducing logistic vehicle kilometers in a city area based on network changes. ISCC 2017: 140-145 - 2016
- [j29]Pieter Vansteenwegen, Thijs Dewilde, Sofie Burggraeve, Dirk Cattrysse:
An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems. Eur. J. Oper. Res. 252(1): 39-53 (2016) - [j28]Masoud Chitsaz, Ali Divsalar, Pieter Vansteenwegen:
A two-phase algorithm for the cyclic inventory routing problem. Eur. J. Oper. Res. 254(2): 410-426 (2016) - [j27]Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen:
Orienteering Problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2): 315-332 (2016) - [j26]Cédric Verbeeck, Pieter Vansteenwegen, El-Houssaine Aghezzaf:
Solving the stochastic time-dependent orienteering problem with time windows. Eur. J. Oper. Res. 255(3): 699-718 (2016) - [j25]Peter Sels, Dirk Cattrysse, Pieter Vansteenwegen:
Automated platforming & routing of trains in all Belgian railway stations. Expert Syst. Appl. 62: 302-316 (2016) - 2015
- [j24]Marco Castro, Kenneth Sörensen, Pieter Vansteenwegen, Peter Goos:
A fast metaheuristic for the travelling salesperson problem with hotel selection. 4OR 13(1): 15-34 (2015) - [j23]Antonio Moreno, Laura Sebastiá, Pieter Vansteenwegen:
Conference Report: Recommender Systems in Tourism. IEEE Intell. Informatics Bull. 16(1): 1-2 (2015) - [j22]Reginald Dewil, Pieter Vansteenwegen, Dirk Cattrysse, Dirk Van Oudheusden:
A minimum cost network flow model for the maximum covering and patrol routing problem. Eur. J. Oper. Res. 247(1): 27-36 (2015) - [c10]Rodrigo Rezende Amaral, El-Houssaine Aghezzaf, Marco Rinaldi, Willem W. E. Himpe, Pieter Vansteenwegen, Chris M. J. Tampère:
An Integrated Perspective on Traffic Management and Logistic Optimization. ITSC 2015: 2166-2171 - [c9]Antonio Moreno, Laura Sebastia, Pieter Vansteenwegen:
TouRS'15: Workshop on Tourism Recommender Systems. RecSys 2015: 355-356 - 2014
- [j21]Thijs Dewilde, Peter Sels, Dirk Cattrysse, Pieter Vansteenwegen:
Improving the robustness in railway station areas. Eur. J. Oper. Res. 235(1): 276-286 (2014) - [j20]Cédric Verbeeck, Kenneth Sörensen, El-Houssaine Aghezzaf, Pieter Vansteenwegen:
A fast solution method for the time-dependent orienteering problem. Eur. J. Oper. Res. 236(2): 419-432 (2014) - [j19]Ali Divsalar, Pieter Vansteenwegen, Kenneth Sörensen, Dirk Cattrysse:
A memetic algorithm for the orienteering problem with hotel selection. Eur. J. Oper. Res. 237(1): 29-49 (2014) - [j18]Pieter Vansteenwegen, Manuel Mateo:
An iterated local search algorithm for the single-vehicle cyclic inventory routing problem. Eur. J. Oper. Res. 237(3): 802-813 (2014) - [c8]Ali Divsalar, Pieter Vansteenwegen, Masoud Chitsaz, Kenneth Sörensen, Dirk Cattrysse:
Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach. EvoCOP 2014: 194-205 - 2013
- [j17]Ander García, Pieter Vansteenwegen, Olatz Arbelaitz, Wouter Souffriau, María Teresa Linaza:
Integrating public transportation in personalised electronic tourist guides. Comput. Oper. Res. 40(3): 758-774 (2013) - [j16]Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen:
Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. 40(7): 1700-1707 (2013) - [j15]Marco Castro, Kenneth Sörensen, Pieter Vansteenwegen, Peter Goos:
A memetic algorithm for the travelling salesperson problem with hotel selection. Comput. Oper. Res. 40(7): 1716-1728 (2013) - [j14]Thijs Dewilde, Peter Sels, Dirk Cattrysse, Pieter Vansteenwegen:
Robust railway station planning: An interaction between routing, timetabling and platforming. J. Rail Transp. Plan. Manag. 3(3): 68-77 (2013) - [j13]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
The Multiconstraint Team Orienteering Problem with Multiple Time Windows. Transp. Sci. 47(1): 53-63 (2013) - 2012
- [j12]Pieter Vansteenwegen, Wouter Souffriau, Kenneth Sörensen:
The travelling salesperson problem with hotel selection. J. Oper. Res. Soc. 63(2): 207-217 (2012) - 2011
- [j11]Pieter Vansteenwegen, Wouter Souffriau, Dirk Van Oudheusden:
The orienteering problem: A survey. Eur. J. Oper. Res. 209(1): 1-10 (2011) - [j10]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
The City Trip Planner: An expert system for tourists. Expert Syst. Appl. 38(6): 6540-6546 (2011) - 2010
- [j9]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Path Relinking approach for the Team Orienteering Problem. Comput. Oper. Res. 37(11): 1853-1859 (2010) - [j8]Pieter Vansteenwegen, Wouter Souffriau, Kenneth Sörensen:
Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. Comput. Oper. Res. 37(11): 1870-1876 (2010) - [j7]Pieter Vansteenwegen, Wouter Souffriau:
Trip Planning Functionalities: State of the Art and Future. J. Inf. Technol. Tour. 12(4): 305-315 (2010) - [c7]Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen:
Heuristics for the Traveling Repairman Problem with Profits. ATMOS 2010: 34-44 - [c6]Ander García, Olatz Arbelaitz, Pieter Vansteenwegen, Wouter Souffriau, María Teresa Linaza:
Hybrid Approach for the Public Transportation Time Dependent Orienteering Problem with Time Windows. HAIS (2) 2010: 151-158 - [c5]Wouter Souffriau, Pieter Vansteenwegen:
Tourist Trip Planning Functionalities: State-of-the-Art and Future. ICWE Workshops 2010: 474-485 - [c4]Ander García, Olatz Arbelaitz, María Teresa Linaza, Pieter Vansteenwegen, Wouter Souffriau:
Personalized Tourist Route Generation. ICWE Workshops 2010: 486-497
2000 – 2009
- 2009
- [j6]Pieter Vansteenwegen:
Planning in tourism and public transportation. 4OR 7(3): 293-296 (2009) - [j5]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12): 3281-3290 (2009) - [j4]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1): 118-127 (2009) - [c3]Ander García, María Teresa Linaza, Olatz Arbelaitz, Pieter Vansteenwegen:
Intelligent Routing System for a Personalised Electronic Tourist Guide. ENTER 2009: 185-197 - [c2]Wouter Souffriau, Joris Maervoet, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Mobile Tourist Decision Support System for Small Footprint Devices. IWANN (1) 2009: 1248-1255 - 2008
- [j3]Wouter Souffriau, Pieter Vansteenwegen, Joris Vertommen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides. Appl. Artif. Intell. 22(10): 964-985 (2008) - [p1]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
Automated Parameterisation of a Metaheuristic for the Orienteering Problem. Adaptive and Multilevel Metaheuristics 2008: 255-269 - 2007
- [j2]Pieter Vansteenwegen, Dirk Van Oudheusden:
The Mobile Tourist Guide: An OR Opportunity. OR Insight 20(3): 21-27 (2007) - 2006
- [j1]Pieter Vansteenwegen, Dirk Van Oudheusden:
Developing railway timetables which guarantee a better service. Eur. J. Oper. Res. 173(1): 337-350 (2006) - [c1]Pieter Vansteenwegen, Dirk Van Oudheusden:
Selection of tourist attractions and routing using personalised electronic guides. ENTER 2006: 55
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
