Tom Van Woensel
Orcid: 0000-0003-4766-2346
According to our database1,
Tom Van Woensel
authored at least 93 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network.
Eur. J. Oper. Res., March, 2024
Eur. J. Oper. Res., February, 2024
Demand Steering in a Last-Mile Delivery Problem with Home and Pickup Point Delivery Options.
Transp. Sci., 2024
Erratum: "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows".
Transp. Sci., 2024
Comput. Oper. Res., 2024
Comput. Oper. Res., 2024
Comput. Ind. Eng., 2024
2023
Expert Syst. Appl., December, 2023
A Rolling-Horizon Strategy for Dynamic Rebalancing of Free-Floating Bike-Sharing Systems.
IEEE Trans. Intell. Transp. Syst., November, 2023
Expert Syst. Appl., August, 2023
Joint case pack size and unpacking location optimization in a retail supply chain including product returns.
Comput. Ind. Eng., August, 2023
Using the proximal policy optimisation algorithm for solving the stochastic capacitated lot sizing problem.
Int. J. Prod. Res., March, 2023
Transp. Sci., January, 2023
Eur. J. Oper. Res., 2023
Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times.
EURO J. Transp. Logist., 2023
2022
Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand.
Comput. Oper. Res., 2022
Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem.
Comput. Oper. Res., 2022
The pickup and delivery problem with alternative locations and overlapping time windows.
Comput. Oper. Res., 2022
2021
The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information.
Oper. Res. Forum, 2021
Int. J. Prod. Res., 2021
Multi-modal transport of perishable products with demand uncertainty and empty repositioning: A scenario-based rolling horizon framework.
EURO J. Transp. Logist., 2021
Hybrid evolutionary algorithms and Lagrangian relaxation for multi-period star hub median problem considering financial and service quality issues.
Eng. Appl. Artif. Intell., 2021
A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach.
Comput. Oper. Res., 2021
Comput. Oper. Res., 2021
2020
Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers.
Networks, 2020
Eur. J. Oper. Res., 2020
EURO J. Transp. Logist., 2020
The fuel replenishment problem: A split-delivery multi-compartment vehicle routing problem with multiple trips.
Comput. Oper. Res., 2020
Solving a production-routing problem with price-dependent demand using an outer approximation method.
Comput. Oper. Res., 2020
Proceedings of the Enterprise, Business-Process and Information Systems Modeling, 2020
2019
Branch-and-Price-Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci., 2019
Transp. Sci., 2019
Special Issue on Recent Advances in Urban Transport and Logistics Through Optimization and Analytics.
Transp. Sci., 2019
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network.
Networks, 2019
Int. J. Prod. Res., 2019
2018
Transp. Sci., 2018
Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines.
Transp. Sci., 2018
Transp. Sci., 2018
The time-dependent capacitated profitable tour problem with time windows and precedence constraints.
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms.
Comput. Oper. Res., 2018
Comput. Ind. Eng., 2018
2017
Using cost change estimates in a local search heuristic for the pollution routing problem.
OR Spectr., 2017
Eur. J. Oper. Res., 2017
2016
Transp. Sci., 2016
INFOR Inf. Syst. Oper. Res., 2016
Comput. Oper. Res., 2016
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines.
Comput. Oper. Res., 2016
2015
Eur. J. Oper. Res., 2015
A decision support system tool for the transportation by barge of import containers: A case study.
Decis. Support Syst., 2015
A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem.
Proceedings of the Computational Logistics - 6th International Conference, 2015
2014
Oper. Res. Lett., 2014
Interfaces, 2014
Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach.
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
2013
Transp. Sci., 2013
Vehicle routing problem with stochastic travel times including soft time windows and service costs.
Comput. Oper. Res., 2013
Dynamic shortest path problems: Hybrid routing policies considering network disruptions.
Comput. Oper. Res., 2013
Sourcing strategies in supply risk management: An approximate dynamic programming approach.
Comput. Oper. Res., 2013
A new model and a hyper-heuristic approach for two-dimensional shelf space allocation.
4OR, 2013
2012
A study on carbon reduction in the vehicle routing problem with simultaneous pickups and deliveries.
Proceedings of 2012 IEEE International Conference on Service Operations and Logistics, 2012
2011
Ann. Oper. Res., 2011
2010
Manag. Sci., 2010
Int. Trans. Oper. Res., 2010
INFORMS Trans. Educ., 2010
Eur. J. Oper. Res., 2010
On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks.
Eur. J. Oper. Res., 2010
Comput. Oper. Res., 2010
2009
J. Oper. Res. Soc., 2009
2008
Eur. J. Oper. Res., 2008
Comput. Oper. Res., 2008
2007
J. Math. Model. Algorithms, 2007
2006
Validating state-dependent queueing models for uninterrupted traffic flows using simulation.
4OR, 2006
4OR, 2006