Bruno Petrato Bruck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bruno Petrato Bruck has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Manuel Iori
DISMI University of Modena and Reggio Emilia Reggio Emilia Italy
5 shared publications - Anand Subramanian
Departamento de Sistemas de Computação, Centro de Informática, Universidade Federal da Paraíba, João Pessoa, Paraíba 58058-600, Brazil
3 shared publications Andre Gustavo dos Santos
Departamento de Informática, UFV - Universidade Federal de Viçsa, MG - Brazil
2 shared publicationsFábio Cruz
Centro de Informática, Universidade Federal da Paraíba, João Pessoa, 58056-010, Brazil
2 shared publications- Carlo Alberto Magni
Department of Economics “Marco Biagi”, School of Doctorate E4E (Engineering for Economics—Economics for Engineering), University of Modena and Reggio Emilia, 41121 Modena, Italy
1 shared publication Daniele Pretolani
Department of Sciences and Methods for Engineering, UNIMORE, Reggio Emilia, Italy
1 shared publication
Latest Publications
- 5 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 325 (1) , 67-80
The Robust Bike sharing Rebalancing Problem: Formulations and a branch-and-cut algorithm
- 5 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 325 (1) , 67-80
The Robust Bike sharing Rebalancing Problem: Formulations and a branch-and-cut algorithm
- 1 July 2024
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 63 (1) , 57-84
Supplier selection for global service providers: a decision support system
- 1 July 2024
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 63 (1) , 57-84
Supplier selection for global service providers: a decision support system
- 9 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (1) , 31-42
An efficient hybrid genetic algorithm for the traveling salesman problem with release dates
- 9 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (1) , 31-42
An efficient hybrid genetic algorithm for the traveling salesman problem with release dates
- 1 May 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (3) , 882-896
The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations
This paper introduces and solves the static bike rebalancing problem with forbidden temporary operations. In this problem, one aims at finding a minimum cost route in which a vehicle performs a series of pickup and delivery operations while satisfying demand and capacity constraints. In addition, a vehicle can visit stations multiple times but cannot use them to temporarily store or provide bikes. Apart from bike rebalancing, the problem also models courier service transportation and repositioning of inventory between retail stores, where temporary operations are frequently disliked because they require additional manual work and service time. We present some theoretical results concerning problem complexity and worst-case analysis, and then propose three exact algorithms based on different mathematical formulations. Extensive computational results on instances involving up to 80 stations show that an exact algorithm based on a minimal extended network produces the best average results. The online appendix is available at https://doi.org/10.1287/trsc.2018.0859 .
- 1 May 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (3) , 882-896
The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations
This paper introduces and solves the static bike rebalancing problem with forbidden temporary operations. In this problem, one aims at finding a minimum cost route in which a vehicle performs a series of pickup and delivery operations while satisfying demand and capacity constraints. In addition, a vehicle can visit stations multiple times but cannot use them to temporarily store or provide bikes. Apart from bike rebalancing, the problem also models courier service transportation and repositioning of inventory between retail stores, where temporary operations are frequently disliked because they require additional manual work and service time. We present some theoretical results concerning problem complexity and worst-case analysis, and then propose three exact algorithms based on different mathematical formulations. Extensive computational results on instances involving up to 80 stations show that an exact algorithm based on a minimal extended network produces the best average results. The online appendix is available at https://doi.org/10.1287/trsc.2018.0859 .
- 6 July 2018
- Published by Springer Nature in 4OR
- Vol. 16 (4) , 447-448
Aggregated formulations, exact and heuristic algorithms for pickup and delivery routing problems
- 6 July 2018
- Published by Springer Nature in 4OR
- Vol. 16 (4) , 447-448
Aggregated formulations, exact and heuristic algorithms for pickup and delivery routing problems
- Open Access
- 1 December 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 65 (6) , 1597-1614
Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
We study the class of one-to-many-to-one single vehicle routing problems with pickups and deliveries, in which a single capacitated vehicle is used to serve a set of customers requiring a delivery, a pickup, or both. These problems have many real-world applications, including beverage distribution, courier service transportation, and reverse logistics. We first concentrate on a well-studied problem in this class, known as the single vehicle routing problem with deliveries and selective pickups (SVRPDSP), in which deliveries are mandatory but pickups are optional and generate a revenue if performed, and customers requiring both a delivery and a pickup (combined demand) can be visited either once or twice. Most exact algorithms in the literature solve SVRPDSP by looking for elementary tours on an extended network that is obtained by transforming each combined demand customer into two different customers, one requiring only the delivery and the other one only the pickup. Because this can result in a significant loss in performance, in this work we focus instead on the original problem network and present formulations that can yield non-elementary tours. Through the use of Benders decomposition, valid inequalities, and tailored optimization techniques based on branch-and-cut frameworks, we develop exact algorithms that outmatch previous results in the literature and obtain proven optimal solutions for all benchmark instances. We then generalize the algorithms to solve several other vehicle routing problems with pickups and deliveries, including the cases of split deliveries, intermediate drop-offs, mandatory pickups, and multiple vehicles. The online appendix is available at https://doi.org/10.1287/opre.2017.1639 .
- 1 December 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 65 (6) , 1597-1614
Open AccessNon-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
We study the class of one-to-many-to-one single vehicle routing problems with pickups and deliveries, in which a single capacitated vehicle is used to serve a set of customers requiring a delivery, a pickup, or both. These problems have many real-world applications, including beverage distribution, courier service transportation, and reverse logistics. We first concentrate on a well-studied problem in this class, known as the single vehicle routing problem with deliveries and selective pickups (SVRPDSP), in which deliveries are mandatory but pickups are optional and generate a revenue if performed, and customers requiring both a delivery and a pickup (combined demand) can be visited either once or twice. Most exact algorithms in the literature solve SVRPDSP by looking for elementary tours on an extended network that is obtained by transforming each combined demand customer into two different customers, one requiring only the delivery and the other one only the pickup. Because this can result in a significant loss in performance, in this work we focus instead on the original problem network and present formulations that can yield non-elementary tours. Through the use of Benders decomposition, valid inequalities, and tailored optimization techniques based on branch-and-cut frameworks, we develop exact algorithms that outmatch previous results in the literature and obtain proven optimal solutions for all benchmark instances. We then generalize the algorithms to solve several other vehicle routing problems with pickups and deliveries, including the cases of split deliveries, intermediate drop-offs, mandatory pickups, and multiple vehicles. The online appendix is available at https://doi.org/10.1287/opre.2017.1639 .
- 1 May 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 81, 40-50
Minimizing CO2 emissions in a practical daily carpooling problem
- 1 May 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 81, 40-50
Minimizing CO2 emissions in a practical daily carpooling problem
- 1 March 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 79, 19-33
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- 1 March 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 79, 19-33
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem