{"id":15,"date":"2016-09-16T19:11:18","date_gmt":"2016-09-17T01:11:18","guid":{"rendered":"http:\/\/rui-zhang.net\/home\/?page_id=15"},"modified":"2026-10-11T15:39:25","modified_gmt":"2026-10-11T21:39:25","slug":"research","status":"publish","type":"page","link":"https:\/\/rui-zhang.org\/index.php\/research\/","title":{"rendered":"Research"},"content":{"rendered":"\r\n

Link to My Google Scholar Page.<\/a><\/p>\r\n\r\n\r\n\r\n

My Erd\u0151s number<\/a> is 3:\u00a0Paul Erd\u0151s –> Daniel J. Kleitman –> Bruce L. Golden –> Rui Zhang<\/p>\r\n\r\n\r\n\r\n

My research interests are:<\/p>\r\n

\r\n

Applications<\/strong>:
Last-Mile Delivery, Routing, Revenue Management, and Influence Maximization on Social Networks.<\/p>\r\n

Methodologies<\/strong>:
Integer Programming, Network Optimization, and Approximate Dynamic Programming.<\/p>\r\n<\/div>\r\n

Publications<\/strong><\/p>\r\n

\r\n\r\n<\/p>\r\n

(Authors indicated with “underlined font<\/span>” are Ph.D. students)<\/p>\r\n

\r\n\r\n<\/p>\r\n

Refereed Journal Papers:<\/strong><\/p>\r\n

21. Branch-Price-and-Cut for the Workforce Scheduling and Routing Problem with Delivery and Pickup at Dispatch Points, with H. Zhuang<\/span>, H. Qin, and J. Li. INFORMS Journal on Computing<\/em>. Forthcoming.
*The instances, detailed results, and source code in this paper can be downloaded here<\/a>.<\/p>\r\n

20. Assortment Optimization for Online Video Games<\/a>, with Y. Wang<\/span>, F. You,<\/span> and T. Vossen. Production and Operations Management, <\/em>35<\/strong>(11) 3958\u20133978, 2026.<\/p>\r\n

\r\n\r\n<\/p>\r\n

19. The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery<\/a>, with J. Yang<\/span>, J. Li, H. Qin, and E Su<\/span>. Transportation Research Part E: Logistics and Transportation Review,<\/em> 205<\/strong>:104538, 2026<\/p>\r\n

18. Branch-and-Price for the Capacitated Autonomous Vehicle Assisted Delivery Problem<\/a>, INFORMS Journal on Computing<\/em>, 37<\/strong>(5):1328-1349, 2025.
*The instances and source code in this paper can be downloaded here<\/a>.<\/p>\r\n

17. On Approximate Linear Programming for a Queueing Control Problem<\/a>, with S. Samiedaluie and D. Zhang, Computers & Operations Research<\/em>, 169<\/strong>, 106711, 2024.<\/span><\/p>\r\n

16. The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery<\/a>, with S. Raghavan, Manufacturing & Service Operations Management<\/em>,\u00a026<\/strong>(1):291-311, 2024.<\/span><\/p>\r\n

15.\u00a0The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches<\/a>, with Y. Luo<\/span> and B. Golden, INFORMS Journal on Computing, <\/em>35<\/strong>(6):1286-1307, 2023.<\/em>
*The instances and source code in this paper can be downloaded here<\/a>.<\/p>\r\n

\r\n\r\n<\/p>\r\n

14. The Paired Mail Carrier Problem<\/a>, with Y. Luo<\/span>, B. Golden, S. Poikonen,\u00a0and E. Wasil,\u00a0European Journal of Operational Research, <\/em>30<\/strong>8<\/strong>(2), 801-817, 2023.<\/em><\/p>\r\n

\r\n\r\n<\/p>\r\n

13. Product-Based Approximate Linear Programs for Network Revenue Management<\/a>, with S. Samiedaluie and\u00a0D. Zhang,\u00a0Operations Research,\u00a0<\/em>70<\/strong>(5):2837-2850, 2022.
*The NRM instances in this paper can be downloaded\u00a0here<\/a>.<\/p>\r\n

\r\n\r\n<\/p>\r\n

12. A Fresh Look at the Traveling Salesman Problem with a Center<\/a>, with Y. Luo<\/span>, B. Golden, and S. Poikonen,\u00a0Computers & Operations Research,\u00a0<\/em>143<\/strong>, 105748, 2022.<\/span><\/p>\r\n

\r\n\r\n<\/p>\r\n

11. Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem<\/a>, with S. Raghavan,\u00a0INFORMS Journal on Computing, <\/em>34<\/strong>(3):1345-1365<\/span>, 2022<\/span>.<\/em>
*The PIDS instances in this paper can be downloaded\u00a0here<\/a>.<\/p>\r\n

\r\n\r\n<\/p>\r\n

10. Influence Maximization with Latency Requirements on Social Networks<\/a>, with S. Raghavan, INFORMS Journal on Computing, <\/em>34<\/strong>(2):<\/span>710-728<\/span>, 2022<\/span>.
*The PIDS-PP instances in this paper can be downloaded\u00a0here<\/a>.<\/p>\r\n

\r\n\r\n<\/p>\r\n

9. The Weighted Target Set Selection Problem on Trees and Cycles<\/a>, with S. Raghavan, Networks,\u00a0<\/em>77<\/strong>(4):587-609, 2021.<\/em><\/p>\r\n

\r\n\r\n<\/p>\r\n

8. A Branch-and-Cut Approach for the Least Cost Influence Problem on Social Networks<\/a>, with D. G\u00fcnne\u00e7 and S. Raghavan, Networks,\u00a0<\/em>76<\/strong>(1):84-105, 2020.<\/em><\/p>\r\n

\r\n\r\n<\/p>\r\n

7. Least Cost Influence Maximization on Social Networks<\/a>, with D. G\u00fcnne\u00e7 and S. Raghavan,\u00a0INFORMS Journal on Computing<\/em>, 32<\/strong>(2):289-302, 2020.<\/span><\/p>\r\n

\r\n\r\n<\/p>\r\n

6. A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks<\/a>, with S. Raghavan,\u00a0INFORMS Journal on Optimization, 1<\/strong><\/span><\/em>(4):304-322,\u00a0<\/span>2019.
*The WTSS instances in this paper can be downloaded here<\/a>.<\/p>\r\n

\r\n\r\n<\/p>\r\n

5. A Hybrid Heuristic Procedure for the Windy Rural Postman Problem with Time-Dependent Zigzag Service<\/a>, with O. Lum, B. Golden, and E. Wasil, Computers & Operations Research<\/em>, 88<\/strong>, 247-257, 2017.<\/p>\r\n

\r\n\r\n<\/p>\r\n

4. The Windy Rural Postman Problem with a Time-Dependent Zigzag Option<\/a>, with J. Nossack, B. Golden, and E. Pesch,\u00a0European Journal of Operational Research, <\/em>258<\/strong>(3), 1131-1142, 2017.<\/p>\r\n

\r\n\r\n<\/p>\r\n

3. The Min-Max Split Delivery Multi-Depot Vehicle Routing Problem with Minimum Service Time Requirement<\/a>, with X. Wang, B. Golden, and E. Wasil,\u00a0Computers & Operations Research,\u00a0<\/em>71<\/strong>,\u00a0110-126,\u00a02016.<\/p>\r\n

\r\n\r\n<\/p>\r\n

2. Robust Optimization Model for Runway Configuration Management<\/a>, with R. Kincaid,\u00a0International Journal of Operations Research and Information Systems<\/em>,\u00a05<\/strong>(3), 1-26, 2014.<\/p>\r\n

\r\n\r\n<\/p>\r\n

1. Rectangles Algorithm for Generating Normal Variates<\/a>, with L. Leemis,\u00a0Naval Research Logistics<\/em>,\u00a059<\/strong>(1), 52-57, 2012.<\/p>\r\n

\r\n\r\n<\/p>\r\n

Refereed Conference Proceedings:<\/strong><\/p>\r\n

\r\n\r\n<\/p>\r\n

2. Robust Optimization Model for Runway Configuration Management<\/a>, with R. Kincaid,\u00a0the Proceedings of the 11th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference<\/em>, September 20-22, 2011, Virginia Beach, VA, AIAA.<\/p>\r\n

\r\n\r\n<\/p>\r\n

1. Routing problems with time dependencies or how different are trash collection or newspaper delivery from street sweeping or winter gritting?<\/a>, with J. Nossack, B. Golden, and E. Pesch, Procedia Engineering<\/em>, 182<\/strong> ( 2017 ), 235 \u2013 240, 2016. Special issue on 7th International Conference on Engineering, Project, and Production Management, 21 – 23 September 2016, Bialystok, Poland.<\/p>\r\n

\r\n\r\n<\/p>\r\n

Under Review\/Revision:<\/strong><\/p>\r\n

11. The Reliable Optical Network Design Problem: A Distributionally Robust Optimization Approach, with M. Li, Y. Xiong<\/span>, and J. Li. INFORMS Journal on Computing<\/em>. Major Revision.<\/p>\r\n

10. Hazmat Transportation Network Design under Uncertainty: Distributionally Robust Location-Routing with a Bidirectional Risk Index, with Y. Yin, Y. Hu<\/span>, D. Wang, and Y. Yu. Under Review.<\/p>\r\n

9. Exact Methods for Shipment Consolidation with Multiple Shipping Methods Under Nonlinear Cost Structures, with B. Zou, Y. Shi<\/span>, and J. Li. Operations Research<\/em>. Major Revision.<\/p>\r\n

8. The Tower Repositioning and Technician Routing Problem for Communication Recovery, with A. Moriakin<\/span>, Z. Luo, and H. Qin. Under Review.<\/p>\r\n

7. The Bus-Assisted Drone Delivery Problem: Integrating Public Transport and Drones for Last-Mile Delivery, with B. Zou, Y. Shi<\/span>, and J. Li. Production and Operations Management. <\/em>Major Revision<\/span>.<\/span><\/p>\r\n

6. The Multi-Commodity Split Shipment Problem: The Value of Routing under Weight and Volume Constraints, with H. Qin, Z. Lu<\/span>, and J. Li. Under Review.<\/p>\r\n

5. Meals on Autonomous Wheels: Delivery with Vehicle-Customer Coordination, with <\/span>D. Li<\/span>, and K. Wang. <\/span>Production and Operations Management. <\/em>Major Revision<\/span>.<\/span><\/p>\r\n

4. The Generator Deployment Problem: Integrating Generator Routing and Cable-Trench Network Design in Emergencies, with A. Moriakin<\/span>, H. Qin, and J. Li. INFORMS Journal on Computing<\/em>. Major Revision.
*The full Electronic Companion of this paper can be found here<\/a>.<\/p>\r\n

3. EFFECTION: An Exact Solution Approach for the Formation and Routing of Worker Teams, with J.Li., J. Yang<\/span>, and N. Huang. INFORMS Journal on Computing<\/em>. Major Revision.
*The detailed results in this paper can be downloaded here<\/a>.<\/p>\r\n

2. Joint Dynamic Optimization of Pricing and Personalized Recommendations in Online Retailing, with Y. Lei, Z. Jiang, and D. Zhang. Under Review.<\/p>\r\n

\r\n
\r\n
\r\n
\r\n

1. The Generalized Driver-Aide Problem: Enhancing the Role of the Aide in Urban Last-Mile Delivery, with M. Chao<\/span>, A. Masone, and B. Golden. Manufacturing & Service Operations Management. <\/em>Major Revision<\/span>.
*<\/em>The Online Appendix is here<\/a>.<\/p>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n

\r\n\r\n<\/p>\r\n

\r\n\r\n<\/p>\r\n

<\/p>","protected":false},"excerpt":{"rendered":"

Link to My Google Scholar Page. My Erd\u0151s number is 3:\u00a0Paul Erd\u0151s –> Daniel J. Kleitman –> Bruce L. Golden –> Rui Zhang My research interests are: Applications:Last-Mile Delivery, Routing, Revenue Management, and Influence Maximization on Social Networks. Methodologies:Integer Programming, Network Optimization, and Approximate Dynamic Programming. Publications (Authors indicated with “underlined font” are Ph.D. students) … Continue reading “Research”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_exactmetrics_skip_tracking":false,"footnotes":""},"class_list":["post-15","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/pages\/15","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/comments?post=15"}],"version-history":[{"count":248,"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/pages\/15\/revisions"}],"predecessor-version":[{"id":683,"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/pages\/15\/revisions\/683"}],"wp:attachment":[{"href":"https:\/\/rui-zhang.org\/index.php\/wp-json\/wp\/v2\/media?parent=15"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}