Rui Zhang

Dr. Rui Zhang


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2019 in INFORMS Journal on Optimization
Verified
Journal Article
Closed access
SRS. Raghavan
S. Raghavan
RZRui Zhang
Rui Zhang
The study of viral marketing strategies on social networks has become an area of significant research interest. In this setting, we consider a combinatorial optimization problem, referred to as the weighted target set selection (WTSS) problem. Earlier research has focused on approximation algorithms for the unweighted case of the problem, which is known to be NP-hard. Motivated by the desire to develop a better understanding of the fundamental problems in social network analytics, we seek to develop mathematical programming approaches to solve the WTSS problem exactly. We build upon a tight and compact extended formulation for the WTSS problem on trees described in a companion paper and show that it is also a tight and compact extended formulation for directed acyclic graphs (DAGs). On the basis of the observation that the influence propagation network in any arbitrary graph is acyclic, we add an exponential set of inequalities that enforce this condition and show how to apply the extended formulation for DAGs to arbitrary graphs. Using this idea, we develop and implement a branch-and-cut approach to solve the WTSS problem on arbitrary graphs. Our computational experience on a test-bed of 180 real-world graph instances (with up to approximately 155,000 nodes and 327,000 edges) demonstrates the quality and efficacy of our solution approach. The branch-and-cut approach finds solutions that are on average 0.90% from optimality and solves 60 of the 180 instances to optimality. On the other hand, the best heuristic solutions generated are on average 5.46 times worse than the solutions generated by the branch-and-cut approach.

1 July 2016 in Computers & Operations Research
Verified
Journal Article
Closed access
XWXingyin Wang
Xingyin Wang
BGBruce Golden
Bruce Golden
EWEdward Wasil
Edward Wasil
RZRui Zhang
Rui Zhang

26 November 2019 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
DGDilek Günneç
Dilek Günneç
SRS. Raghavan
S. Raghavan
RZRui Zhang
Rui Zhang
Viral-marketing strategies are of significant interest in the online economy. Roughly, in these problems, one seeks to identify which individuals to strategically target in a social network so that...

1 January 2024 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
SRS. Raghavan
S. Raghavan
RZRui Zhang
Rui Zhang
Problem definition: Last-mile delivery is a critical component of logistics networks, accounting for approximately 30%–35% of costs. As delivery volumes have increased, truck route times have become unsustainably long. To address this issue, many logistics companies, including FedEx and UPS, have resorted to using a “driver aide” to assist with deliveries. The aide can assist the driver in two ways. As a “jumper,” the aide works with the driver in preparing and delivering packages, thus reducing the service time at a given stop. As a “helper,” the aide can independently work at a location delivering packages, and the driver can leave to deliver packages at other locations and then return. Given a set of delivery locations, travel times, service times, jumper’s savings, and helper’s service times, the goal is to determine both the delivery route and the most effective way to use the aide (e.g., sometimes as a jumper and sometimes as a helper) to minimize the total routing time. Methodology/results: We model this problem as an integer program with an exponential number of variables and an exponential number of constraints and propose a branch-cut-and-price approach for solving it. Our computational experiments are based on simulated instances built on real-world data provided by an industrial partner and a data set released by Amazon. The instances based on the Amazon data set show that this novel operation can lead to, on average, a 35.8% reduction in routing time and 22.0% in cost savings. More importantly, our results characterize the conditions under which this novel operation mode can lead to significant savings in terms of both the routing time and cost. Managerial implications: Our computational results show that the driver aide with both jumper and helper modes is most effective when there are denser service regions and when the truck’s speed is higher (≥10 miles per hour). Coupled with an economic analysis, we come up with rules of thumb (that have close to 100% accuracy) to predict whether to use the aide and in which mode. Empirically, we find that the service delivery routes with greater than 50% of the time devoted to delivery (as opposed to driving) are the ones that provide the greatest benefit. These routes are characterized by a high density of delivery locations. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0211 .

1 July 2020 in Networks
Verified
Journal Article
Closed access
PDF file
DGDilek Günneç
Dilek Günneç
SRS. Raghavan
S. Raghavan
RZRui Zhang
Rui Zhang

1 May 2017 in European Journal of Operational Research
Verified
Journal Article
Closed access
JNJenny Nossack
Jenny Nossack
BGBruce L. Golden
Bruce L. Golden
EPErwin Pesch
Erwin Pesch
RZRui Zhang
Rui Zhang