A simultaneous vehicle routing and crew scheduling problem (SVRCSP) consists of planning routes for a fleet of vehicles and scheduling their crews, with the particularity that the vehicle–crew correspondence is not fixed through time. This allows a greater planning flexibility and a more efficient use of the fleet, but in counterpart it requires high synchronization. In this work, an SVRCSP is presented, where long-distance pickup-and-delivery requests must be fulfilled over a multiday planning horizon, subject to several constraints such as multiple time windows, hour of services regulation, among others. Crews can be composed of one or two drivers and any of them can be relieved in a given set of locations. Also, they are allowed to trave...
Logistics efficiency is critical to the business success of most organizations. Inherent in the logi...
PRATA, B. A. Using a maximal covering approach for the vehicle and crew scheduling: a case of study...
textabstractIn this paper we discuss several methods to solve large real-world instances of the vehi...
This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-di...
This project tackles the study, the design, the implementation, and the analysis of the results of a...
PRATA, B. A. A Multiobjective metaheuristic approach for the integrated vehicle and crew scheduling....
This paper examines time windows for scheduled trips in multiple depot vehicle and crew scheduling ...
We present new metaheuristics for solving real crew scheduling problems in a public transportation b...
The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has be...
In this dissertation we address the vehicle routing problem with time windows and multiple deliverym...
This paper investigates a real-world distribution problem arising in the vehicle production industry...
Two heuristic algorithms are proposed for a practical but relatively under-studied vehicle routing s...
This study describes a pickup and delivery vehicle routing problem, considering time windows in real...
textabstractIn this paper we discuss several methods to solve large real-world instances of the vehi...
In today’s competitive world, the organizations decide to establish competitive benefits by making b...
Logistics efficiency is critical to the business success of most organizations. Inherent in the logi...
PRATA, B. A. Using a maximal covering approach for the vehicle and crew scheduling: a case of study...
textabstractIn this paper we discuss several methods to solve large real-world instances of the vehi...
This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-di...
This project tackles the study, the design, the implementation, and the analysis of the results of a...
PRATA, B. A. A Multiobjective metaheuristic approach for the integrated vehicle and crew scheduling....
This paper examines time windows for scheduled trips in multiple depot vehicle and crew scheduling ...
We present new metaheuristics for solving real crew scheduling problems in a public transportation b...
The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has be...
In this dissertation we address the vehicle routing problem with time windows and multiple deliverym...
This paper investigates a real-world distribution problem arising in the vehicle production industry...
Two heuristic algorithms are proposed for a practical but relatively under-studied vehicle routing s...
This study describes a pickup and delivery vehicle routing problem, considering time windows in real...
textabstractIn this paper we discuss several methods to solve large real-world instances of the vehi...
In today’s competitive world, the organizations decide to establish competitive benefits by making b...
Logistics efficiency is critical to the business success of most organizations. Inherent in the logi...
PRATA, B. A. Using a maximal covering approach for the vehicle and crew scheduling: a case of study...
textabstractIn this paper we discuss several methods to solve large real-world instances of the vehi...