Wouter van Heeswijk

ORCID: 0000-0002-5413-9660
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Transportation and Mobility Innovations
  • Supply Chain and Inventory Management
  • Vehicle Routing Optimization Methods
  • Facility Location and Emergency Management
  • Auction Theory and Applications
  • Traffic control and management
  • Transportation Planning and Optimization
  • Reinforcement Learning in Robotics
  • Advanced Manufacturing and Logistics Optimization
  • Robotic Process Automation Applications
  • FinTech, Crowdfunding, Digital Finance
  • Blockchain Technology Applications and Security
  • Urban and Freight Transport Logistics
  • Business Process Modeling and Analysis
  • Spreadsheets and End-User Computing
  • Microfinance and Financial Inclusion
  • Robotic Path Planning Algorithms
  • Cybercrime and Law Enforcement Studies
  • Traffic Prediction and Management Techniques
  • Smart Grid Energy Management
  • Adaptive Dynamic Programming Control
  • Elevator Systems and Control
  • Advanced Clustering Algorithms Research
  • Maritime Ports and Logistics
  • Optimization and Search Problems

University of Twente
2015-2025

Centrum Wiskunde & Informatica
2018-2020

Eindhoven University of Technology
2016

Urban consolidation centers (UCCs) have a key role in many initiatives urban logistics, yet few of them are successful the long run. The high costs often prevent attracting sufficient number UCC users. In this paper, we study sustainable business models and supporting administrative policies. We perform an agent-based simulation applied to city Copenhagen collect data from variety sources model agents. Both case setup validated by means expert interviews. test 1,458 schemes that combine...

10.1080/15568318.2018.1503380 article EN cc-by-nc-nd International Journal of Sustainable Transportation 2019-02-22

Effective humanitarian relief operations are challenging in the aftermath of disasters, as trucks often faced with considerable travel time uncertainties due to damaged transportation networks. Efficient deployment Unmanned Aerial Vehicles (UAVs) potentially mitigates this problem, supplementing truck fleets an impactful manner. To plan last-mile distribution setting, we introduce a multi-trip, split-delivery vehicle routing problem and UAVs, soft windows, stochastic times for distribution,...

10.1016/j.trc.2023.104401 article EN cc-by Transportation Research Part C Emerging Technologies 2023-11-07

Reliable availability to the internet and internet-based services is crucial in today’s world. DDoS attacks pose a severe threat of such online resources – especially owing booters virtually everyone can execute them nowadays. In order appropriately protect oneself against attacks, it essential have good insight into threats that exist. This paper proposes novel hybrid model combines postulates from various models on crime opportunity, analyzing targeted victim infrastructure conjunction. We...

10.22667/jowua.2020.06.30.003 article EN Journal of Wireless Mobile Networks Ubiquitous Computing and Dependable Applications 2020-06-30

Humanitarian logistics operations face increasing difficulties due to rising demands for aid in disaster areas. This paper investigates the dynamic allocation of scarce relief supplies across multiple affected districts over time. It introduces a novel stochastic postdisaster inventory problem (SDPDIAP) with trucks and unmanned aerial vehicles (UAVs) delivering goods under uncertain supply demand. The relevance this humanitarian lies importance considering intertemporal social impact...

10.1287/trsc.2023.0438 article EN Transportation Science 2025-02-27

The logistics industry faces an increasing shortage of truck parking spots. This results in illegal or fatigued driving with hazardous consequences for traffic safety, as drivers have no insight into future availability Accurate short-term predictions lot occupation are required to aid planning their routes and rest stops. To obtain such predictions, this research compares a variety machine learning algorithms, concluding that decision trees most suitable real-time application. model is...

10.1016/j.procs.2022.03.008 article EN Procedia Computer Science 2022-01-01

Massive graphs are becoming increasingly common in a variety of domains such as social networks and web analytics. One approach to overcoming the challenges size is sample graph, perform analytics on smaller graph. However, be useful, must maintain properties interest original In this paper, we analyze quality five representative sampling algorithms how well they preserve graph structure, bisimulation structure particular. As part study, also develop new scalable algorithm for computing...

10.1145/2851613.2851650 article EN 2016-04-04

Large discrete action spaces (LDAS) remain a central challenge in reinforcement learning. Existing solution approaches can handle unstructured LDAS with up to few million actions. However, many real-world applications logistics, production, and transportation systems have combinatorial spaces, whose size grows well beyond millions of actions, even on small instances. Fortunately, such exhibit structure, e.g., equally spaced resource units. With this work, we focus handling structured (SLDAS)...

10.48550/arxiv.2305.19891 preprint EN cc-by arXiv (Cornell University) 2023-01-01

This paper addresses the planning of freight dispatch in flexible transport networks featuring multiple carriers. To deal with computational challenges problem, we develop an Approximate Dynamic Programming (ADP) algorithm that utilizes neural network techniques to learn policies. We test whether policies learned autonomously by carrier agents (based on local information) match quality a central planner full information). Numerical experiments show yield solutions comparable for small...

10.1109/smc.2018.00060 article EN 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2018-10-01

Real-world problems of operations research are typically high-dimensional and combinatorial. Linear programs generally used to formulate efficiently solve these large decision problems. However, in multi-period problems, we must often compute expected downstream values corresponding current decisions. When applying stochastic methods approximate values, linear become restrictive for designing value function approximations (VFAs). In particular, the manual design a polynomial VFA is...

10.48550/arxiv.1902.09855 preprint EN other-oa arXiv (Cornell University) 2019-01-01

Problems in operations research are typically combinatorial and high-dimensional. To a degree, linear programs may efficiently solve such large decision problems. For stochastic multi-period problems, decomposition into sequence of one-stage decisions with approximated downstream effects is often necessary, e.g., by deploying reinforcement learning to obtain value function approximations (VFAs). When embedding VFAs programs, VFA design restricted linearity. This paper presents an integrated...

10.1109/wsc48552.2020.9384078 article EN 2018 Winter Simulation Conference (WSC) 2020-12-14

Humanitarian logistics operations face increasing difficulties due to rising demands for aid in disaster areas. This paper investigates the dynamic allocation of scarce relief supplies across multiple affected districts over time. It introduces a novel stochastic post-disaster inventory problem with trucks and unmanned aerial vehicles delivering goods under uncertain supply demand. The relevance this humanitarian lies importance considering inter-temporal social impact deliveries. We achieve...

10.48550/arxiv.2312.00140 preprint EN cc-by arXiv (Cornell University) 2023-01-01

Smart modular freight containers -- as propagated in the Physical Internet paradigm are equipped with sensors, data storage capability and intelligence that enable them to route themselves from origin destination without manual intervention or central governance. In this self-organizing setting, can autonomously place bids on transport services a spot market setting. However, for individual it may be difficult learn good bidding policies due limited observations. By sharing information costs...

10.48550/arxiv.2005.00565 preprint EN other-oa arXiv (Cornell University) 2020-01-01

This paper presents a multi-agent reinforcement learning algorithm to represent strategic bidding behavior in freight transport markets. Using this algorithm, we investigate whether feasible market equilibriums arise without any central control or communication between agents. Studying such environments may serve as stepping stone towards self-organizing logistics systems like the Physical Internet. We model an agent-based environment which shipper and carrier actively learn strategies using...

10.48550/arxiv.2102.09253 preprint EN other-oa arXiv (Cornell University) 2021-01-01
Coming Soon ...