Bruno Petrato Bruck

Bruno Petrato Bruck
HEC Montréal - École des Hautes Études commerciales | HEC Montreal

Ph.D. in Industrial Innovation Engineering

About

13
Publications
3,117
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
311
Citations
Citations since 2017
7 Research Items
295 Citations
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080

Publications

Publications (13)
Article
In the last decades the intermodal transportation of containers has become a key component of the entire international trade system, as it allows safe and efficient intercontinental door-to-door movement of freight by combining land and sea transportation services. Intermodal railway terminals are special components of these systems that allow cont...
Conference Paper
In this paper, we present a decision support system (DSS) developed for a global service provider (GSP), which solves a real-world supplier selection problem. The GSP operates in the Italian market of facility management, supplying customers with a variety of services. These services are subcontracted to external qualified suppliers spread all over...
Article
This paper describes a decision support system developed to solve a practical attended home services problem faced by Iren Group, an Italian multi-utility company operating in the distribution of electricity, gas and water. The company operates in several regions across Italy and aims to optimize the dispatching of technicians to customer locations...
Article
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 cann...
Article
This paper describes the solution methodology developed to address an attended home delivery problem faced by an Italian provider of gas, electricity, and water services. This company operates in several regions and must dispatch technicians to customer locations where they carry out installation or maintenance activities within time intervals chos...
Article
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 logist...
Article
Governments, as well as companies and individuals, are increasingly aware of the damages to the environment caused by human activities. In this sense, the reduction of CO2 emissions is an important topic that is pursued through a range of practices. A relevant example is carpooling, which is defined as the act of individuals sharing a single car. I...
Article
The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among stations in self-service bike-sharing systems. This problem can be seen as a variant of the one-commodity pickup and delivery vehicle routing problem, where multiple visits are allowed to be performed at each station, i.e., the demand of a station is allowed t...
Conference Paper
We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way...
Conference Paper
In this work we propose some metaheuristics to solve a routing problem with mandatory deliveries and selective pickups. There are two integer programming formulations proposed in the literature but they are able to solve to optimality only small-sized instances. Some greedy heuristics and metaheuristics have also been proposed: Tabu Search, General...
Conference Paper
This paper presents two approaches for the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVRPDSP), where a vehicle departs loaded from the depot and must visit every delivery customer serving a certain demand, but may not visit all the pickup customers, only the ones that are profitable, since for every pickup made, there is...
Conference Paper
This paper presents a hybrid metaheuristic for the single vehicle routing problem with deliveries and selective pickups (SVRPDSP). A vehicle departs loaded from the depot, visit every customer delivering a certain amount of goods according to their demand, and optionally pickup items from those customers, receiving a profit for each pickup realized...

Questions

Question (1)
Question
Hello, in the Analytic Hierarchy Process (AHP) when dealing with judgments of a group, we usually generate a priority vector for each individual and then aggregate the results. Normally for any given priority vector, the sum of its values are 1.
However when using the geometric mean to aggregate the results of a group, the resulting priority vector might not have this property, i.e., the sum of its terms might be different from 1.
Is that ok? If not, is there a widely accepted method to make sure the sum of the aggregated priority vector is 1?
Thank you in advance,
Bruno.

Network

Cited By