Exact branch-price-and-cut algorithms for vehicle routing
Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …
Resource constrained routing and scheduling: Review and research prospects
In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks
and meet particular service requirements. What considerably complicates matters is when …
and meet particular service requirements. What considerably complicates matters is when …
Data-driven methodology to support long-lasting logistics and decision making for urban last-mile operations
Last-mile operations in forward and reverse logistics are responsible for a large part of the
costs, emissions, and times in supply chains. These operations have increased due to the …
costs, emissions, and times in supply chains. These operations have increased due to the …
Demand uncertainty in robust home care optimization
Abstract We study the Home Care Problem under uncertainty. Home Care refers to medical,
paramedical and social services that may be delivered to patient homes. The term includes …
paramedical and social services that may be delivered to patient homes. The term includes …
Routing optimization under uncertainty
We consider a class of routing optimization problems under uncertainty in which all
decisions are made before the uncertainty is realized. The objective is to obtain optimal …
decisions are made before the uncertainty is realized. The objective is to obtain optimal …
Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare
This paper, for the first time, studies vehicle routing problems with synchronized visits
(VRPS) and stochastic travel and service times. In addition to considering a home …
(VRPS) and stochastic travel and service times. In addition to considering a home …
The vehicle routing problem with hard time windows and stochastic service times
In this paper we consider the vehicle routing problem with hard time windows and stochastic
service times (VRPTW-ST); in this variant of the classic VRPTW the service times are …
service times (VRPTW-ST); in this variant of the classic VRPTW the service times are …
Heuristics for the robust vehicle routing problem with time windows
Uncertainty is frequently present in logistics and transportation, where vehicle routing
problems play a crucial role. However, due to the complexity inherent in dealing with …
problems play a crucial role. However, due to the complexity inherent in dealing with …
[LIVRE][B] Approximate dynamic programming for dynamic vehicle routing
MW Ulmer - 2017 - Springer
The amount of goods and passengers to transport as well as calls for physical services at
customers increase worldwide, especially within urban areas. Transportation and services …
customers increase worldwide, especially within urban areas. Transportation and services …
Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
We address a routing and appointment scheduling problem with uncertain service and travel
times arising from home service practice. Specifically, given a set of customers within a …
times arising from home service practice. Specifically, given a set of customers within a …