Barrett W. Thomas

Orcid: 0000-0002-6080-6191

According to our database1, Barrett W. Thomas authored at least 54 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Special Issue on Emerging Topics in Transportation Science and Logistics.
Transp. Sci., July, 2023

Same-day delivery with fair customer service.
Eur. J. Oper. Res., July, 2023

Optimizing warfarin dosing using deep reinforcement learning.
J. Biomed. Informatics, January, 2023

Opportunities for reinforcement learning in stochastic dynamic vehicle routing.
Comput. Oper. Res., 2023

Rollout-based routing strategies with embedded prediction: A fish trawling application.
Comput. Oper. Res., 2023

2022
The Value of Autonomous Vehicles for Last-Mile Deliveries in Urban Environments.
Manag. Sci., 2022

Deep Q-learning for same-day delivery with vehicles and drones.
Eur. J. Oper. Res., 2022

2021
The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times.
Transp. Sci., 2021

"Make no little plans": Impactful research to solve the next generation of transportation problems.
Networks, 2021

Managing uncertainty in demand through inventory and workforce development.
Int. J. Prod. Res., 2021

Where the Action is: Let's make Reinforcement Learning for Stochastic Dynamic Vehicle Routing Problems work!
CoRR, 2021

2020
Building Trust in Home Services - Stochastic Team-Orienteering with Consistency Constraints.
Transp. Sci., 2020

Multi-period orienteering with uncertain adoption likelihood and waiting at customers.
Eur. J. Oper. Res., 2020

Meso-parametric value function approximation for dynamic customer acceptances in delivery routing.
Eur. J. Oper. Res., 2020

On modeling stochastic dynamic vehicle routing problems.
EURO J. Transp. Logist., 2020

Same-Day Delivery with Fairness.
CoRR, 2020

2019
The Same-Day Delivery Problem for Online Purchases.
Transp. Sci., 2019

Enough Waiting for the Cable Guy - Estimating Arrival Times for Service Vehicle Routing.
Transp. Sci., 2019

An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems.
Networks, 2019

Team orienteering with uncertain rewards and service times with an application to phlebotomist intrahospital routing.
Networks, 2019

Preemptive depot returns for dynamic same-day delivery.
EURO J. Transp. Logist., 2019

Deep Q-Learning for Same-Day Delivery with a Heterogeneous Fleet of Vehicles and Drones.
CoRR, 2019

2018
Dynamic Orienteering on a Network of Queues.
Transp. Sci., 2018

Special Issue on Uncertainty in Logistics and Transportation Systems.
Transp. Sci., 2018

Same-day delivery with heterogeneous fleets of drones and vehicles.
Networks, 2018

Workforce grouping and assignment with learning-by-doing and knowledge transfer.
Int. J. Prod. Res., 2018

2017
Sugarcane Harvest Logistics in Brazil.
Transp. Sci., 2017

A matheuristic for workforce planning with employee learning and stochastic demand.
Int. J. Prod. Res., 2017

A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs.
Eur. J. Oper. Res., 2017

Multi-period technician scheduling with experience-based service times and stochastic customers.
Comput. Oper. Res., 2017

2016
Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits.
Transp. Sci., 2016

Vehicle routing to minimize time-dependent emissions in urban areas.
Eur. J. Oper. Res., 2016

Data-driven approaches for emissions-minimized paths in urban areas.
Comput. Oper. Res., 2016

Harvest logistics in agricultural systems with multiple, independent producers and no on-farm storage.
Comput. Ind. Eng., 2016

Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning.
Comput. Ind. Eng., 2016

2015
Integer programming techniques for solving non-linear workforce planning models with learning.
Eur. J. Oper. Res., 2015

2014
A priori orienteering with time windows and stochastic wait times at customers.
Eur. J. Oper. Res., 2014

Scheduled penalty Variable Neighborhood Search.
Comput. Oper. Res., 2014

2013
Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits.
Oper. Res., 2013

The probabilistic traveling salesman problem with time windows.
EURO J. Transp. Logist., 2013

The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization.
Appl. Soft Comput., 2013

2012
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem.
Transp. Sci., 2012

Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand.
Eur. J. Oper. Res., 2012

Network design for time-constrained delivery using subgraphs.
Comput. Manag. Sci., 2012

2011
The orienteering problem with stochastic travel and service times.
Ann. Oper. Res., 2011

2009
Minimax flow tree problems.
Networks, 2009

The stochastic p-hub center problem with service-level constraints.
Comput. Oper. Res., 2009

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines.
Comput. Oper. Res., 2009

2008
Route Design for Lean Production Systems.
Transp. Sci., 2008

Probabilistic Traveling Salesman Problem with Deadlines.
Transp. Sci., 2008

2007
Waiting Strategies for Anticipating Service Requests from Known Customer Locations.
Transp. Sci., 2007

A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2007

The dynamic shortest path problem with anticipation.
Eur. J. Oper. Res., 2007

2004
Anticipatory Route Selection.
Transp. Sci., 2004


  Loading...