Luiz Henrique Barbosa - Academia.edu (original) (raw)
Related Authors
Institute of Business Administration, Karachi
Uploads
Papers by Luiz Henrique Barbosa
Brazilian Journal of Operations & Production Management, 2017
This paper presents an Integer Linear Programming model, which enables the scheduling of agents i... more This paper presents an Integer Linear Programming model, which enables the scheduling of agents in call centers according to segmentation by skills, as well as the inclusion of labor law restrictions. The results from the experimental application of this method to situations involving real-time problems are presented, wherein the necessary shifts to meet forecasted demand are provided, in addition to an economically optimum combination of agents and skills, generating a solution, which is sufficient to maintain the desired level of service at the lowest cost possible. The approach proposed in this study presents an alternative worthy of consideration, since it is able to successfully incorporate the flexibility of call centers with skills-based routing in an easy-to-implement model that has proven to be effective in experiments conducted in on-the-job settings. Advances in information technology and telecommunications in recent years have increasingly heightened the presence of call...
Computers & Operations Research, 2020
Abstract The Traveling Salesperson Problem with Hotel Selection (TSPHS) is a realistic extension ... more Abstract The Traveling Salesperson Problem with Hotel Selection (TSPHS) is a realistic extension of the classic Traveling Salesperson Problem recently introduced to the literature. In the TSPHS, there is a time limit that restricts the visits that can be performed in a single day. Therefore, several days may be necessary to visit all clients. The salesperson has to spend the night in one of the available hotels. Previous works focus mainly on metaheuristics and on MIP formulations. This work presents a sophisticated exact algorithm for the TSPHS, a Branch-Cut-and-Price (BCP) algorithm that includes and adapts several features found in state-of-the-art algorithms for vehicle routing. In that algorithm, columns correspond to possible salesperson day trips; subtour elimination cuts, 2-path cuts, and limited-memory subset row cuts are separated. Computational results show that many medium-sized instances, having up to 75 clients and 20 hotels, can be solved to optimality, as well as some larger instances from the literature, with up to 225 clients.
Brazilian Journal of Operations & Production Management, 2017
This paper presents an Integer Linear Programming model, which enables the scheduling of agents i... more This paper presents an Integer Linear Programming model, which enables the scheduling of agents in call centers according to segmentation by skills, as well as the inclusion of labor law restrictions. The results from the experimental application of this method to situations involving real-time problems are presented, wherein the necessary shifts to meet forecasted demand are provided, in addition to an economically optimum combination of agents and skills, generating a solution, which is sufficient to maintain the desired level of service at the lowest cost possible. The approach proposed in this study presents an alternative worthy of consideration, since it is able to successfully incorporate the flexibility of call centers with skills-based routing in an easy-to-implement model that has proven to be effective in experiments conducted in on-the-job settings. Advances in information technology and telecommunications in recent years have increasingly heightened the presence of call...
Computers & Operations Research, 2020
Abstract The Traveling Salesperson Problem with Hotel Selection (TSPHS) is a realistic extension ... more Abstract The Traveling Salesperson Problem with Hotel Selection (TSPHS) is a realistic extension of the classic Traveling Salesperson Problem recently introduced to the literature. In the TSPHS, there is a time limit that restricts the visits that can be performed in a single day. Therefore, several days may be necessary to visit all clients. The salesperson has to spend the night in one of the available hotels. Previous works focus mainly on metaheuristics and on MIP formulations. This work presents a sophisticated exact algorithm for the TSPHS, a Branch-Cut-and-Price (BCP) algorithm that includes and adapts several features found in state-of-the-art algorithms for vehicle routing. In that algorithm, columns correspond to possible salesperson day trips; subtour elimination cuts, 2-path cuts, and limited-memory subset row cuts are separated. Computational results show that many medium-sized instances, having up to 75 clients and 20 hotels, can be solved to optimality, as well as some larger instances from the literature, with up to 225 clients.