T. van Woensel’s research while affiliated with Eindhoven University of Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (15)


Integrated People and Freight Transportation: A Literature Review
  • Article
  • Full-text available

October 2024

·

80 Reads

Future Transportation

·

Tom Van Woensel

Increasing environmental and economic pressures have led to numerous innovations in the logistics sector, including integrated people and freight transport (IPFT). Despite growing attention from practitioners and researchers, IPFT lacks extensive research coverage. This study aims to bridge this gap by presenting a general framework and making several key contributions. It identifies, researches, and explains relevant terminologies, such as cargo hitching, freight on transit (FoT), urban co-modality, crowd-shipping (CS), occasional drivers (OD), crowdsourced delivery among friends, and share-a-ride, illustrating the interaction of IPFT with different systems like the sharing economy and co-modality. Furthermore, it classifies IPFT-related studies at strategic, tactical, and operational decision levels, detailing those that address uncertainty. The study also analyzes the opportunities and challenges associated with IPFT, highlighting social, economic, and environmental benefits and examining challenges from a PESTEL (political, economic, social, technological, environmental, and legal) perspective. Additionally, it discusses practical applications of IPFT and offers recommendations for future research and development, aiming to guide practitioners and researchers in addressing existing challenges and leveraging opportunities. This comprehensive framework aims to significantly advance the understanding and implementation of IPFT in the logistics sector.

Download








The pollution-routing problem with speed optimization and uneven topography

July 2022

·

22 Reads

·

1 Citation

This paper considers a joint pollution-routing and speed optimization problem (PRP-SO) where fuel costs and emissions depend on the vehicle speed, arc payloads, and road grades. We present two methods, one approximate and one exact, for solving the PRP-SO. The approximate strategy solves large-scale instances of the problem with a tabu search-based metaheuristic coupled with an efficient fixed-sequence speed optimization algorithm. The second strategy consists of a tailored branch-and-price (BP) algorithm in which speed optimization is managed within the pricing problem. We test both methods on modified Solomon benchmarks and newly constructed real-life instance sets. Our BP algorithm solves most instances with up to 50 customers and many instances with 75 and 100 customers. The heuristic is able to find near-optimal solutions to all instances and requires less than one minute of computational time per instance. Results on real-world instances suggest several managerial insights. First, fuel savings of up to 53\% are realized when explicitly taking into account arc payloads and road grades. Second, fuel savings and emissions reduction are also achieved by scheduling uphill customers later along the routes. Lastly, we show that ignoring elevation information when planning routes leads to highly inaccurate fuel consumption estimates.


Figure 1: General design of the Parallel Adaptive Large Neighborhood Search. ℳ is the number of parallel processes.
Figure 2: Comparison of solution times of MILP and the SCC. Scenario set-route pair indexes are on the x-axis, and the y-axis gives the solution times in seconds. The first number on the left top corner of each subplot is the average optimality gap of the SCC algorithm. The next two numbers in the upper right corner of the subplots correspond to the average solution times when solving the instances with the MILP and the SCC algorithm, respectively.
Figure 3: Gurobi optimality gap for instance R1 with sample scenario 1 from CAP setting S2 (|V | = 21, and |W ′ | = 10)
Average number N of visit attempts per route and average flexibility levels of the routes. The average flexibility is calculated as the maximum percentage of the planning horizon to be used for waiting.
Solution quality comparison (|V | = 21 and |W ′ | = 10)
Attended Home Delivery in Last-Mile Logistics

January 2022

·

221 Reads

·

2 Citations

SSRN Electronic Journal


Citations (5)


... Drawing inspiration from the "Grand Paris" project, Behiri et al. (2018) integrate the goods assignment problem and the train timetabling problem into the Freight-Rail-Transport-Scheduling Problem (FRTSP) in underground logistics, which adjusts the train dwell time based on freight requirements. Following this line, some studies have emerged on urban rail transit for freight transportation (Li et al., 2021, Tundulyasaree et al., 2023, and have started to address the issue of carriage allocation (Di et al., 2022, Xu et al., 2022. Ghilas et al. (2016b) introduce the Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL), which incorporates public transport lines into the urban freight network. ...

Reference:

The vehicle routing problem with underground logistics: Formulation and algorithm
Improving Service Quality by Integrating Passenger and Freight Train Transportation
  • Citing Article
  • January 2023

SSRN Electronic Journal

... ed the importance of VRP with backhauls in modern e-commerce operations. The authors suggested that future research should consider additional constraints like human resource availability and parameter stochasticity, explore heterogeneous vehicle fleets, address mixed products, and investigate multiple product types and package sortation processes.Ozarik et al. (2022) studied AHD with the possibility of revisiting on the same delivery day when the first attempt fails. They formulated the problem as a VRP and scheduling with time-dependent costs and multiple customer visits, representing failed deliveries as customer presence uncertainty. ...

Attended Home Delivery in Last-Mile Logistics
  • Citing Article
  • January 2022

SSRN Electronic Journal

... Özarık et al. [40] considered AHD with the possibility of re-visiting on the same delivery day as when the first attempt fails. A VRP and scheduling with time-dependent costs and multiple customer visits were provided. ...

Attended Home Delivery in Last-Mile Logistics

SSRN Electronic Journal

... The paper [12] examined the problem of constructing an intermodal network for the transportation of food products in order to reduce CO2 emissions into the atmosphere and reduce the burden on the environment. Steadieseifi et al. [13] examined the problem of organizing multimodal transportation of perishable goods in international traffic under conditions of random demand. Freight transportation under competitive conditions on parallel routes was considered by Kozachenko et al. [14] The behavior of carriers in this work was simulated using game theory methods. ...

Multi-Modal Transport of Perishable Products with Demand Uncertainty and Empty RepositioningA Scenario-based Rolling Horizon Framework
  • Citing Article
  • May 2021

EURO Journal on Transportation and Logistics

... Once empty, the trucks return to the depot to resupply, after which they continue serving other stations. At the end of the day, the trucks return to the depot [3]. This problem is called the fuel replenishment problem (FRP), a variant of the multi-trip and multi-compartment vehicle routing problem (MTMCVRP). ...

The Fuel Replenishment Problem: A Split-Delivery Multi-Compartment Vehicle Routing Problem with Multiple Trips
  • Citing Article
  • February 2020

Computers & Operations Research