publications

2026

1. 2026

   Data and Code for the Pickup-and-Delivery Problem with Online Transfers (PDPOT)

   • Paul Bouman, 
   • Gizem Özbaygın, 
   • and Rick Willemsen

   Misc

   DOI Bib URL

   @misc{https://doi.org/10.5281/zenodo.19480902,
     doi = {10.5281/ZENODO.19480902},
     url = {https://zenodo.org/doi/10.5281/zenodo.19480902},
     author = {Bouman, Paul and Özbaygın, Gizem and Willemsen, Rick},
     title = {Data and Code for the Pickup-and-Delivery Problem with Online Transfers (PDPOT)},
     publisher = {Zenodo},
     year = {2026},
     copyright = {GNU Affero General Public License v3.0 only}
   }

2025

1. Oct 2025

   Susceptibilities of Democratic Electoral Systems

   • Tomasz Raducha, 
   • Jarosław Klamut, 
   • Roger Cremades, 
   • Paul Bouman, 
   • and Mateusz Wiliński

   IEEE Transactions on Computational Social Systems

   Abs DOI Bib

   The two most common families of electoral systems (ESs), defining the rules used to elect assemblies and legislative institutions, are proportional representation (PR) and plurality (Bormann and Golder, 2013; Farrell, 2011). When they are evaluated, most often the arguments come from social choice theory and political science. The former overall uses an axiomatic approach that includes a list of mathematical criteria a system should fulfill (Urken et al., 1995; Sen, 1995). The latter predominantly focuses on the tradeoff between proportionality of apportionment and governability (Monroe, 1994; Carey and Hix, 2011). However, there is an ongoing discussion about which ES is the best (Bowler et al., 2005; Farrell and Gallagher, 1999) and which set of indexes and measures would be the most important in such assessment (Pennisi, 1998). Although previous research addressed various perceptions of fairness related to the proportionality of different ESs (Blau, 2004; Plescia et al., 2020), the sensitivity of ES to efforts that influence opinions has been neglected. Here, we address this research gap with a framework that can measure ESs’ susceptibility to different means of influence. Using a simulation study, we show that plurality ESs are less stable than PR. They are more susceptible to coordinated efforts to influence opinions, for example, by political agitators and media propaganda. A review of real-world ES reveals possible improvements in their design, leading to lower susceptibility. Additionally, our simulation framework allows the computation of popular indexes, such as the Gallagher index and the effective number of parties, in different scenarios. Our work provides a new tool for dealing with modern threats to democracy that could destabilize voting processes (Hyde, 2020). Furthermore, our results add an important argument to a longstanding discussion on the evaluation of ES.

   @article{877853e7da77451192811b1989167e8a,
     title = {Susceptibilities of Democratic Electoral Systems},
     author = {Raducha, Tomasz and Klamut, Jaros{\l}aw and Cremades, Roger and Bouman, Paul and Wili{\'n}ski, Mateusz},
     note = {Publisher Copyright: {\textcopyright} 2014 IEEE.},
     year = {2025},
     month = oct,
     doi = {10.1109/TCSS.2024.3464092},
     language = {English},
     volume = {12},
     pages = {2186--2201},
     journal = {IEEE Transactions on Computational Social Systems},
     issn = {2329-924X},
     publisher = {Institute of Electrical and Electronics Engineers Inc.},
     number = {5}
   }

2. May 2025

   Evaluating ship-to-shore schedules using simulation

   • Mette Wagenvoort, 
   • Paul Bouman, 
   • Martijn van Ee, 
   • and Kerry Malone

   Journal of Defense Modeling and Simulation

   Abs DOI Bib

   During military operations in coastal regions, resources, such as personnel and vehicles, are brought from large amphibious ships to the shore using smaller ships and helicopters. The aim is to transport these resources as fast as possible while adhering to different types of constraints. This is called the ship-to-shore problem and has been solved assuming deterministic parameters regarding the speed and (un)loading time of the connectors. These schedules might therefore not be robust to delays. We developed a simulation model to analyze the effect of uncertainty in these parameters on the execution of a schedule. We analyze (1) whether these discrete time periods are able to capture the delays, (2) the effect of using more conservative parameters when constructing a schedule, and (3) the effect of being less rigid in the execution, i.e., when being allowed to depart a limited time ahead of schedule. We find that significant delays occur and that using more conservative parameters for the (un)loading time can have a positive significant effect on the duration of the operation. Being less rigid can also have a positive significant effect on the duration; however, it comes at the cost of violating constraints regarding the grouped delivery of resources.

   @article{59756e3e444d4e4fa7eba9dd836d73fd,
     title = {Evaluating ship-to-shore schedules using simulation},
     author = {Wagenvoort, Mette and Bouman, Paul and \{van Ee\}, Martijn and Malone, Kerry},
     note = {Publisher Copyright: {\textcopyright} The Author(s) 2025.},
     year = {2025},
     month = may,
     day = {15},
     doi = {10.1177/15485129251338299},
     language = {English},
     journal = {Journal of Defense Modeling and Simulation},
     issn = {1548-5129},
     publisher = {SAGE Publications}
   }

3. Jan 2025

   P

   Exact and heuristic approaches for the ship-to-shore problem

   • M. Wagenvoort, 
   • P. C. Bouman, 
   • M. van Ee, 
   • T. Lamballais Tessensohn, 
   • and K. Postek

   European Journal of Operational Research

   Abs DOI Bib

   After a natural disaster such as a hurricane or flooding, the navy can help by bringing supplies, clearing roads, and evacuating victims. If destinations cannot be reached over land, resources can be transported using smaller ships and helicopters, called connectors. To start aid on land as soon as possible this must be done efficiently. In the ship-to-shore problem, trips with their accompanying resources are determined while minimising the makespan. Limited (un)loading capacities, heterogeneous connector characteristics and constraints posed by priority of the resources and grouping of the resources (resource sets) all require that the connector trips are carefully coordinated. Despite the criticality of this coordination, existing literature does not consider resource sets and has only developed heuristics. We provide a formulation that incorporates resource sets and develop (i) an exact branch-and-price algorithm and (ii) a tailored greedy heuristic that can provide upper bounds. We find that 84% of our 98 practical instances terminate within an hour in on average 80 s. Our greedy heuristic can find optimal solutions in two-thirds of these instances, mostly for instances that are very constrained in terms of the delivery order of resources. When improvements are found by the branch-and-price algorithm, the average gap with the makespan of the greedy solution is 40% and, in most cases, these improvements are obtained within three minutes. For the 20 artificial instances, the greedy heuristic has consistent performance on the different types of instances. For these artificial instances improvements of on average 35% are found in reasonable time.

   @article{e2fc3c008d2f4b2599797a9579c3a18f,
     title = {Exact and heuristic approaches for the ship-to-shore problem},
     author = {Wagenvoort, M. and Bouman, \{P. C.\} and \{van Ee\}, M. and \{Lamballais Tessensohn\}, T. and Postek, K.},
     note = {Publisher Copyright: {\textcopyright} 2024 The Author(s)},
     year = {2025},
     month = jan,
     day = {1},
     doi = {10.1016/j.ejor.2024.08.017},
     language = {English},
     volume = {320},
     pages = {115--131},
     journal = {European Journal of Operational Research},
     issn = {0377-2217},
     publisher = {Elsevier},
     number = {1}
   }

2024

1. Jan 2024

   24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)

   • Paul C. Bouman, 
   • and Spyros C. Kontogiannis

   OASIcs, Volume 123, ATMOS 2024, Complete Volume, editor

   DOI Bib URL

   @proceedings{https://doi.org/10.4230/oasics.atmos.2024,
     doi = {10.4230/OASICS.ATMOS.2024},
     url = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2024},
     author = {Bouman, Paul C. and Kontogiannis, Spyros C.},
     booktitle = {OASIcs, Volume 123, ATMOS 2024, Complete Volume},
     keywords = {OASIcs, Volume 123, ATMOS 2024, Complete Volume},
     language = {en},
     title = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)},
     publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
     year = {2024},
     copyright = {Creative Commons Attribution 4.0 International license}
   }

2023

1. Sep 2023

   Simple Policies for Capacitated Resupply Problems

   • Mette Wagenvoort, 
   • Martijn Van Ee, 
   • Paul Bouman, 
   • and Kerry M. Malone

   In 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023

   Abs DOI Bib

   We consider the Capacitated Resupply Problem in which locations with a given demand rate should be resupplied by vehicles such that they do not run out of stock and the number of vehicles is minimised. Compared to related problems, we consider the scenario where the payload of the vehicles may not suffice to bring the stock level back to full capacity. We focus on the Homogeneous Capacitated Resupply Problem and present both simple policies that provide 2-Approximations and an optimal greedy policy that runs in pseudo-polynomial time.

   @inproceedings{0e66266a193a400e8e33496e1030f5a7,
     title = {Simple Policies for Capacitated Resupply Problems},
     author = {Wagenvoort, Mette and Ee, \{Martijn Van\} and Bouman, Paul and Malone, \{Kerry M.\}},
     note = {Publisher Copyright: {\textcopyright} 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.; 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023 ; Conference date: 07-09-2023 Through 08-09-2023},
     year = {2023},
     month = sep,
     doi = {10.4230/OASIcs.ATMOS.2023.18},
     language = {English},
     series = {OpenAccess Series in Informatics},
     publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing},
     editor = {Frigioni, Daniele and Schiewe, Philine},
     booktitle = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023},
     address = {Germany}
   }

2022

1. Mar 2022

   A next step in disruption management: combining operations research and complexity science

   • Mark M. Dekker, 
   • Rolf N. van Lieshout, 
   • Robin C. Ball, 
   • Paul C. Bouman, 
   • Stefan C. Dekker, 
   • Henk A. Dijkstra, 
   • Rob M. P. Goverde, 
   • Dennis Huisman, 
   • Debabrata Panja, 
   • Alfons A. M. Schaafsma, 
   • and Marjan van den Akker

   Public Transport

   Abs DOI Bib URL

   Railway systems occasionally get into a state of being out-of-control, meaning that barely any train is running, even though the required resources (infrastructure, rolling stock and crew) are available. Because of the large number of affected resources and the absence of detailed, timely and accurate information, currently existing disruption management techniques cannot be applied in out-of-control situations. Most of the contemporary approaches assume that there is only one single disruption with a known duration, that all information about the resources is available, and that all stakeholders in the operations act as expected. Another limitation is the lack of knowledge about why and how disruptions accumulate and whether this process can be predicted. To tackle these problems, we develop a multidisciplinary framework combining techniques from complexity science and operations research, aiming at reducing the impact of these situations and—if possible—avoiding them. The key elements of this framework are (i) the generation of early warning signals for out-of-control situations, (ii) isolating a specific region such that delay stops propagating, and (iii) the application of decentralized decision making, more suited for information-sparse out-of-control situations.

   @article{Dekker2022,
     author = {Dekker, Mark M. and van Lieshout, Rolf N. and Ball, Robin C. and Bouman, Paul C. and Dekker, Stefan C. and Dijkstra, Henk A. and Goverde, Rob M. P. and Huisman, Dennis and Panja, Debabrata and Schaafsma, Alfons A. M. and van den Akker, Marjan},
     title = {A next step in disruption management: combining operations research and complexity science},
     journal = {Public Transport},
     year = {2022},
     month = mar,
     day = {01},
     volume = {14},
     number = {1},
     pages = {5--26},
     issn = {1613-7159},
     doi = {10.1007/s12469-021-00261-5},
     url = {https://doi.org/10.1007/s12469-021-00261-5}
   }

2021

1. Sep 2021

   EP*

   A self-organizing policy for vehicle dispatching in public transit systems with multiple lines

   • Rolf van Lieshout, 
   • Paul Bouman, 
   • Marjan van den Akker, 
   • and Dennis Huisman

   Transportation Research Part B: Methodological

   Abs DOI Bib

   In this paper, we propose and analyze an online, decentralized policy for dispatching vehicles in a multi-line public transit system. In the policy, vehicles arriving at a terminal station are assigned to the lines starting at the station in a round-robin fashion. Departure times are selected to minimize deviations from a certain target headway. We prove that this policy is self-organizing: given that there is a sufficient number of available vehicles, a timetable spontaneously emerges that meets the target headway of every line. Moreover, in case one of the vehicles breaks down, the remaining vehicles automatically redistribute over the network to re-establish such a timetable. We present both theoretical and numerical results on the time until a stable state is reached and on how quickly the system recovers after the breakdown of a vehicle. Experiments on three real-world transit systems show that our policy performs well, even if not all assumptions required for the theoretical analysis are met: if there are enough vehicles, the realized headways are typically close to the target headways. These promising results suggest that our self-organizing policy could be useful in situations where centralized dispatching is impractical or simply impossible due to an abundance of disruptions or the absence of information systems.

   @article{18b92481063f4c0ea83849f47917ed8b,
     title = {A self-organizing policy for vehicle dispatching in public transit systems with multiple lines},
     author = {\{van Lieshout\}, Rolf and Bouman, Paul and \{van den Akker\}, Marjan and Huisman, Dennis},
     note = {This research was funded by NWO, Netherlands, the Netherlands Organisation for Scientific Research , as part of the research programme Complexity in Transport \& Logistics (project number 439.16.111).},
     year = {2021},
     month = sep,
     day = {1},
     doi = {10.1016/j.trb.2021.08.004},
     language = {English},
     volume = {152},
     pages = {46--64},
     journal = {Transportation Research Part B: Methodological},
     issn = {0191-2615},
     publisher = {Elsevier Ltd.}
   }

2020

1. Sep 2020

   P*

   Determining and Evaluating Alternative Line Plans in Out-of-Control Situations

   • Rolf N. van Lieshout, 
   • Paul C. Bouman, 
   • and Dennis Huisman

   Transportation Science

   Abs DOI Bib URL

   From time to time, large disruptions cause heavily utilized railway networks to get into a state of out-of-control, in which hardly any trains are able to run as the result of a lack of accurate and up-to-date information available to dispatchers. In this paper, we develop and test disruption management strategies for dealing with these situations. First, we propose an algorithm that finds an alternative line plan that can be operated in the affected part of the railway network. As the line plan should be feasible with respect to infrastructural and resource restrictions, we integrate these aspects in the algorithm in a Benders-like fashion. Second, to operate the railway system within the disrupted region, we propose several local train dispatching strategies requiring varying degrees of flexibility and coordination. Computational experiments based on disruptions in the Dutch railway network indicate that the algorithm performs well, finding workable and passenger-oriented line plans within a couple of minutes. Moreover, we also demonstrate in a simulation study that the produced line plans can be operated smoothly without depending on central coordination.

   @article{van_Lieshout_2020,
     author = {van Lieshout, Rolf N. and Bouman, Paul C. and Huisman, Dennis},
     title = {Determining and Evaluating Alternative Line Plans in Out-of-Control Situations},
     journal = {Transportation Science},
     volume = {54},
     number = {3},
     pages = {740-761},
     year = {2020},
     doi = {10.1287/trsc.2019.0945},
     url = {https://doi.org/10.1287/trsc.2019.0945},
     eprint = {https://doi.org/10.1287/trsc.2019.0945}
   }

2. Sep 2020

   A New Sequential Approach to Periodic Vehicle Scheduling and Timetabling

   • Paul Bouman, 
   • Alexander Schiewe, 
   • and Philine Schiewe

   In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)

   Abs DOI Bib URL

   When evaluating the operational costs of a public transport system, the most important factor is the number of vehicles needed for operation. In contrast to the canonical sequential approach of first fixing a timetable and then adding a vehicle schedule, we consider a sequential approach where a vehicle schedule is determined for a given line plan and only afterwards a timetable is fixed. We compare this new sequential approach to a model that integrates both steps. To represent various operational requirements, we consider multiple possibilities to restrict the vehicle circulations to be short, as this can provide operational benefits. The sequential approach can efficiently determine public transport plans with a low number of vehicles. This is evaluated theoretically and empirically demonstrated for two close-to real-world instances.

   @inproceedings{bouman_et_al:OASIcs:2020:13142,
     author = {Bouman, Paul and Schiewe, Alexander and Schiewe, Philine},
     title = {{A New Sequential Approach to Periodic Vehicle Scheduling and Timetabling}},
     booktitle = {20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
     pages = {6:1--6:16},
     series = {OpenAccess Series in Informatics (OASIcs)},
     isbn = {978-3-95977-170-2},
     issn = {2190-6807},
     year = {2020},
     volume = {85},
     editor = {Huisman, Dennis and Zaroliagis, Christos D.},
     publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
     address = {Dagstuhl, Germany},
     url = {https://drops.dagstuhl.de/opus/volltexte/2020/13142},
     urn = {urn:nbn:de:0030-drops-131422},
     doi = {10.4230/OASIcs.ATMOS.2020.6},
     annote = {Keywords: Vehicle Scheduling, Timetabling, Integrated Planning}
   }

2018

1. Sep 2018

   Vehicle Scheduling Based on a Line Plan

   • Rolf N. van Lieshout, 
   • and Paul C. Bouman

   In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)

   Abs DOI Bib URL

   We consider the following problem: given a set of lines in a public transportation network with their round trip times and frequencies, a maximum number of vehicles and a maximum number of lines that can be combined into a vehicle circulation, does there exist a set of vehicle circulations that covers all lines given the constraints. Solving this problem provides an estimate of the costs of operating a certain line plan, without having to compute a timetable first. We show that this problem is NP-hard for any restriction on the number of lines that can be combined into a circulation which is equal to or greater than three. We pay special attention to the case where at most two lines can be combined into a circulation, which is NP-hard if a single line can be covered by multiple circulations. If this is not allowed, a matching algorithm can be used to find the optimal solutions, which we show to be a 16/15-approximation for the case where it is allowed. We also provide an exact algorithm that is able to exploit low tree-width of the so-called circulation graph and small numbers of vehicles required to cover single circulations.

   @inproceedings{vanlieshout_et_al:OASIcs:2018:9720,
     author = {van Lieshout, Rolf N. and Bouman, Paul C.},
     title = {{Vehicle Scheduling Based on a Line Plan}},
     booktitle = {18th Workshop on Algorithmic Approaches for Transportation  Modelling, Optimization, and Systems (ATMOS 2018)},
     pages = {15:1--15:14},
     series = {OpenAccess Series in Informatics (OASIcs)},
     isbn = {978-3-95977-096-5},
     issn = {2190-6807},
     year = {2018},
     volume = {65},
     editor = {Bornd{\"o}rfer, Ralf and Storandt, Sabine},
     publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
     address = {Dagstuhl, Germany},
     url = {http://drops.dagstuhl.de/opus/volltexte/2018/9720},
     urn = {urn:nbn:de:0030-drops-97204},
     doi = {10.4230/OASIcs.ATMOS.2018.15},
     annote = {Keywords: Vehicle scheduling, integrated railway planning, (fractional) matching, treewidth}
   }

2. Oct 2018

   Dynamic Programming Approaches for the Traveling Salesman Problem with Drone

   • Paul Bouman, 
   • Niels Agatz, 
   • and Marie Schmidt

   Networks

   Abs DOI Bib

   A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the traveling salesman problem with drone (TSP-D). This paper presents exact solution approaches for the TSP-D based on dynamic programming and provides an experimental comparison of these approaches. Our numerical experiments show that our approach can solve larger problems than the mathematical programming approaches that have been presented in the literature thus far. Moreover, we show that restrictions on the number of locations the truck can visit while the drone is away can help significantly reduce the solution times while having relatively little impact on the overall solution quality.

   @article{a5742664a4a948218fa4a35dd48d4af2,
     title = {Dynamic Programming Approaches for the Traveling Salesman Problem with Drone},
     author = {Bouman, Paul and Agatz, Niels and Schmidt, Marie},
     year = {2018},
     month = oct,
     day = {25},
     doi = {10.1002/net.21864},
     language = {English},
     volume = {72},
     pages = {528--542},
     journal = {Networks},
     issn = {0028-3045},
     publisher = {Wiley-Liss Inc.},
     number = {4}
   }

3. Apr 2018

   P*

   Optimization Approaches for the Traveling Salesman Problem with Drone

   • Niels Agatz, 
   • Paul Bouman, 
   • and Marie Schmidt

   Transportation Science

   Abs DOI Bib

   The fast and cost-ecient home delivery of goods ordered online is logistically chal- lenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much at- tention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call the TSP with drone. In this paper, we model this problem as an IP and develop several fast route rst-cluster second heuristics based on local search and dynamic programming. We prove worst-case approximation ratios for the heuristics and test their performance by comparing the solutions to the optimal solutions for small instances. In addition, we apply our heuristics to several articial instances with dierent characteristics and sizes. Our experiments show that substantial savings are possible with this concept in comparison to truck-only delivery.

   @article{8636cb6664be41b3968b71d37b619505,
     title = {Optimization Approaches for the Traveling Salesman Problem with Drone},
     author = {Agatz, Niels and Bouman, Paul and Schmidt, Marie},
     year = {2018},
     month = apr,
     day = {6},
     doi = {10.1287/trsc.2017.0791},
     language = {English},
     volume = {52},
     pages = {965--981},
     journal = {Transportation Science},
     issn = {0041-1655},
     publisher = {INFORMS Inst.for Operations Res.and the Management Sciences},
     number = {4}
   }

2017

1. Apr 2017

   Synthetic Smart Card Data for the Analysis of Temporal and Spatial Patterns

   • Paul Bouman

   Misc

   DOI Bib

   @misc{7cbea4aca0644b3185c8d33ecfc2d224,
     title = {Synthetic Smart Card Data for the Analysis of Temporal and Spatial Patterns},
     author = {Bouman, Paul},
     year = {2017},
     doi = {10.5281/zenodo.321686},
     language = {English},
     publisher = {Zenodo},
     note = {Dataset used for PhD Thesis ; Conference date: 01-01-2017}
   }

2. Apr 2017

   P*

   The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies

   • Marie Schmidt, 
   • Leo Kroon, 
   • Anita Schöbel, 
   • and Paul Bouman

   Operations Research

   DOI Bib

   @article{schmidt2017,
     author = {Schmidt, Marie and Kroon, Leo and Sch\"{o}bel, Anita and Bouman, Paul},
     title = {The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies},
     journal = {Operations Research},
     volume = {65},
     number = {1},
     pages = {184-199},
     year = {2017},
     doi = {10.1287/opre.2016.1564}
   }

3. Jun 2017

   Passengers, Crowding and Complexity : Models for passenger oriented public transport

   • Paul Bouman

   Phdthesis

   Abs Bib

   Passengers, Crowding and Complexity was written as part of the Complexity in Public Transport (ComPuTr) project funded by the Netherlands Organisation for Scientific Research (NWO). This thesis studies in three parts how microscopic data can be used in models that have the potential to improve utilization, while preventing excess crowding. In the first part, the emergence of crowding caused by interactions between the behavior of passengers and the public transport operators who plan the vehicle capacities is modeled. Using simulations the impact of the information disclosed to the passengers by public transport operators on the utilization and passenger satisfaction is analyzed. A quasi-experiment with a large group of students in a similar setting finds that four types of behavior can be observed. In the second part, algorithms that can extract temporal and spatial patterns from smart card data are developed and a first step to use such patterns in an agent based simulation is made. Furthermore, a way to generate synthetic smart card data is proposed. This is useful for the empirical validation of algorithms that analyze such data. In the third and final part it is considered how individual decision strategies can be developed in situations where there exists uncertainty about the availability and quality of travel options. We investigate how the best strategy for a specific type of objective can be computed. Finally, we analyze which strategies are worthwhile to consider for a very broad set of objectives.

   @phdthesis{c26fa573cf1a4f42bf9612f81a1360af,
     title = {Passengers, Crowding and Complexity : Models for passenger oriented public transport},
     author = {Bouman, Paul},
     year = {2017},
     month = jun,
     day = {15},
     language = {English},
     isbn = {9789058924827},
     series = {ERIM PhD Series in Research in Management},
     publisher = {Erasmus Universiteit Rotterdam (EUR)},
     school = {Erasmus University Rotterdam}
   }

2016

1. Jun 2016

   Rotterdam: Revenue Management in Public Transportation with Smart-Card Data Enabled Agent-Based Simulations

   • Paul Bouman, 
   • and Milan Lovric

   Book Chapter in The Multi-Agent Transport Simulation MATSim

   DOI Bib

   @incollection{bouman2016matsim,
     author = {Bouman, Paul and Lovric, Milan},
     title = {Rotterdam: Revenue Management in Public Transportation with Smart-Card Data Enabled Agent-Based Simulations},
     editor = {Horni, Andreas and Nagel, Kai and Axhausen, Kay},
     booktitle = {The Multi-Agent Transport Simulation MATSim},
     publisher = {Ubiquity Press},
     address = {London},
     year = {2016},
     pages = {477--480},
     chapter = {81},
     doi = {10.5334/baw.81}
   }

2. Jun 2016

   P

   Decomposition approaches for recoverable robust optimization problems

   • Marjan van den Akker, 
   • Paul Bouman, 
   • Han Hoogeveen, 
   • and Denise Tönissen

   European Journal of Operational Research

   DOI Bib

   @article{van2016decomposition,
     title = {Decomposition approaches for recoverable robust optimization problems},
     author = {van den Akker, Marjan and Bouman, Paul and Hoogeveen, Han and {T{\"o}nissen}, Denise},
     journal = {European Journal of Operational Research},
     volume = {251},
     number = {3},
     pages = {739--750},
     year = {2016},
     publisher = {Elsevier},
     doi = {10.1016/j.ejor.2015.12.008}
   }

3. Sep 2016

   S

   Capacity, information and minority games in public transport

   • P.C. Bouman, 
   • Leo Kroon, 
   • Peter Vervest, 
   • and Gábor Maróti

   Transportation Research Part C: Emerging Technologies

   DOI Bib URL

   @article{Bouman_2016,
     doi = {10.1016/j.trc.2016.05.007},
     url = {https://doi.org/10.1016%2Fj.trc.2016.05.007},
     year = {2016},
     month = sep,
     publisher = {Elsevier {BV}},
     volume = {70},
     pages = {157--170},
     author = {Bouman, P.C. and Kroon, Leo and Vervest, Peter and Mar{\'{o}}ti, G{\'{a}}bor},
     title = {Capacity, information and minority games in public transport},
     journal = {Transportation Research Part C: Emerging Technologies}
   }

2013

1. Sep 2013

   Detecting activity patterns from smart card data

   • Paul Bouman, 
   • Leo Kroon, 
   • Ting Li, 
   • and Peter Vervest

   Belgian/Netherlands Artificial Intelligence Conference

   Abs Bib

   During the past decades, the modelling of transport demand by activity based methods has gained considerable attention from the scientific community. Such demand models offer a greater modelling flexibility than traditional models, by modelling transport demand as a phenomenon which emerges from the desire to perform activities at different locations, as opposed to more traditional models where an origin destination demand matrix of trips is distributed over different routes and modes. One of the drawbacks of the activity based paradigm is that data related to activities is more difficult to collect than traffic counts. Modern technologies, such as smart card ticketing systems and smart phones, allow us to collect more detailed accounts of the movements of individual passengers. This gives us the possibility to analyse consecutive journeys and therefore the time a passenger spends in a certain location. This information can be very useful from an activity based modelling perspective. In this paper we take an exploratory approach to derive important activity time intervals from smart card data. We apply a clustering algorithm on the intervals observed at individual stations to detect which time intervals capture enough activities. We then construct a tree-based labelling algorithm that allows us to label the activities and analyse activity chains of individual passengers. We count pairs of consecutive activity labels, visualise the results as a network and calculate which triplets of consecutive activities occur most often. Using this approach, we are able to identify activity patterns that differ from the typical time windows associated with home-work activities.

   @article{1b3e1e52225b4769a25aa05b7fdd51d7,
     title = {Detecting activity patterns from smart card data},
     author = {Bouman, Paul and Kroon, Leo and Li, Ting and Vervest, Peter},
     note = {Funding Information: We would like to thank the Netherlands Organisation for Scientific Research (NWO) for funding the Complexity in Public Transport project (ComPuTr, grant \#600.645.000.09) and the anonymous reviewers for their useful feedback. Funding Information: Acknowledgements WewouldliketothanktheNetherlandsOrganisationforScientificResearch(NWO) for funding the Complexity in Public Transport project (ComPuTr, grant \#600.645.000.09) and the anonymous reviewers for their useful feedback. Publisher Copyright: {\textcopyright} 2013 University of Groningen. All rights reserved.; 25th Benelux Conference on Artificial Intelligence, BNAIC 2013 ; Conference date: 07-11-2013 Through 08-11-2013},
     year = {2013},
     language = {English},
     pages = {9--16},
     journal = {Belgian/Netherlands Artificial Intelligence Conference},
     issn = {1568-7805},
     publisher = {University of Groningen}
   }

2. Sep 2013

   Network reduction and dynamic forecasting of passenger flows for disruption management

   • E Hurk, 
   • LG Kroon, 
   • G Maroti, 
   • Paul Bouman, 
   • and Peter Vervest

   In Proceedings of Rail Copenhagen Conference

   Bib

   @inproceedings{69399b40f92e452bb81b7b790b628e16,
     title = {Network reduction and dynamic forecasting of passenger flows for disruption management},
     author = {Hurk, E and Kroon, LG and Maroti, G and Bouman, Paul and Vervest, Peter},
     year = {2013},
     language = {English},
     booktitle = {Proceedings of Rail Copenhagen Conference}
   }

3. Sep 2013

   Passenger Route Choice in Case of Disruptions

   • Paul Bouman, 
   • LG Kroon, 
   • Marie Schmidt, 
   • and A Schöbel

   In Proceedings of the 16th International IEEE Conference on Intelligent Transport Systems

   Bib

   @inproceedings{4bedc0d521de48629ed92ed8e0031816,
     title = {Passenger Route Choice in Case of Disruptions},
     author = {Bouman, Paul and Kroon, LG and Schmidt, Marie and Sch{\"o}bel, A},
     year = {2013},
     language = {English},
     booktitle = {Proceedings of the 16th International IEEE Conference on Intelligent Transport Systems}
   }

2012

1. Sep 2012

   Recognizing demand patterns from smart card data for agent-based micro-simulation of public transport

   • Paul Bouman, 
   • Milan Lovric, 
   • Ting Li, 
   • Leo Kroon, 
   • and Peter Vervest

   Belgian/Netherlands Artificial Intelligence Conference

   Bib

   @article{354d41ef81ab4b87b28482a84fd5c594,
     title = {Recognizing demand patterns from smart card data for agent-based micro-simulation of public transport},
     author = {Bouman, Paul and Lovric, Milan and Li, Ting and Kroon, Leo and Vervest, Peter},
     year = {2012},
     language = {English},
     journal = {Belgian/Netherlands Artificial Intelligence Conference},
     issn = {1568-7805},
     publisher = {University of Groningen},
     note = {24th Benelux Conference on Artificial Intelligence, BNAIC 2012 ; Conference date: 25-10-2012 Through 26-10-2012}
   }

2. Sep 2012

   Recognizing Demand Patterns from Smart Card Data for Agent-Based Micro-simulation of Public Transport

   • Paul Bouman, 
   • M (Milan) Lovric, 
   • Ting Li, 
   • E Hurk, 
   • LG Kroon, 
   • and Peter Vervest

   In Proceedings of the 7th Workshop on Agents in Traffic and Transportation

   Bib

   @inproceedings{e63554805de146ca8e69e003c90d72d6,
     title = {Recognizing Demand Patterns from Smart Card Data for Agent-Based Micro-simulation of Public Transport},
     author = {Bouman, Paul and Lovric, \{M (Milan)\} and Li, Ting and Hurk, E and Kroon, LG and Vervest, Peter},
     year = {2012},
     language = {Undefined/Unknown},
     editor = {Vasirani, M. and Camponogara, E. and Hiromitsu, H. and Kl{\"u}gl, F.},
     booktitle = {Proceedings of the 7th Workshop on Agents in Traffic and Transportation}
   }

3. Sep 2012

   Recognizing Demand Patterns from Smart Card Data for Agent-Based Micro-simulation of Public Transport

   • Paul Bouman, 
   • Milan Lovric, 
   • Ting Li, 
   • Evelien van der Hurk, 
   • Leo Kroon, 
   • and Peter Vervest

   In Proceedings of the Seventh Workshop on Agents In Traffic and Transportation

   Bib URL

   @inproceedings{bouman2012att,
     author = {Bouman, Paul and Lovric, Milan and Li, Ting and van der Hurk, Evelien and Kroon, Leo and Vervest, Peter},
     title = {Recognizing Demand Patterns from Smart Card Data for Agent-Based Micro-simulation of Public Transport},
     booktitle = {Proceedings of the Seventh Workshop on Agents In Traffic and Transportation},
     year = {2012},
     url = {http://www.ia.urjc.es/att2012/papers/att2012_submission_21.pdf}
   }

2011

1. Sep 2011

   Recoverable Robustness by Column Generation

   • Paul Bouman, 
   • Marjan van den Akker, 
   • and Han Hoogeveen

   Book Chapter in Algorithms ESA 2011

   DOI Bib

   @incollection{Bouman2011ESA,
     year = {2011},
     isbn = {978-3-642-23718-8},
     booktitle = {Algorithms ESA 2011},
     volume = {6942},
     series = {Lecture Notes in Computer Science},
     editor = {Demetrescu, Camil and Halldorsson, Magn\'us M.},
     doi = {10.1007/978-3-642-23719-5\_19},
     title = {Recoverable Robustness by Column Generation},
     publisher = {Springer Berlin Heidelberg},
     author = {Bouman, Paul and van den Akker, Marjan and Hoogeveen, Han},
     pages = {215-226},
     language = {English}
   }

The P*, EP*, P and S labels indicate the position of the different journals on the ERIM Journal List.