LĨNH VỰC NGHIÊN CỨU

• Vận trù học, tối ưu hóa, trí tuệ nhân tạo ứng dụng trong kinh doanh, sản xuất, giáo dục, y tế

GIẢI THƯỞNG

• Gương mặt trẻ tiêu biểu Đại học Quốc gia Hà Nội (2018).
• Giải nhất (12.000 Euro) cùng nhóm ORLab trong cuộc thi "Tối ưu hóa sử dụng điện năng trong các tòa nhà" trên drivedata.org (một công ty khởi nghiệp của Đại học Harvard) do Schneider Electric tài trợ. http://drivedata.co/blog/power-laws-optimization-winners/.
• Giải nhì Công trình nghiên cứu xuất sắc Trường Đại học Công nghệ, ĐHQGHN. 
• Quả cầu vàng 2017 - lĩnh vực Công nghệ thông tin.

CÔNG TRÌNH KHOA HỌC TIÊU BIỂU

Các bài báo trên tạp chí:

[J24] Y Ancele, QA Pham, Minh Hoàng Hà*, DB Matellini, TT Nguyen. International Journal of Systems Science: Operations & Logistics 11 (1), 2310626Y.

[J23] TT Doan, N Bostel, Minh Hoàng Hà*, VHV Nguyen. New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule. Journal of Combinatorial Optimization 46 (1), 1.

[J22] Minh Anh Nguyen, Minh Hoàng Hà*. The Parallel Drone Scheduling Traveling Salesman Problem with Collective Drones. Transportation Science 57(4):866-888.

[J21] Minh Anh Nguyen, Hai Long Luong, Minh Hoàng Hà, Ha-Bang Ban. An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem. 4OR, 1-29.

[J20] Lam Vu, Duy Manh Vu, Minh Hoàng Hà*, Viet Phuong Nguyen. The two-echelon routing problem with truck and drones. International Transactions in Operational Research 29 (5), 2968-2994 - Q1 on Scimago.

[J19] Minh Anh Nguyen, Giang Thi-Huong Dang, Minh Hoàng Hà*, Minh-Trien Pham. The min-cost parallel drone scheduling vehicle routing problem. DOI: https://doi.org/10.1016/j.ejor.2021.07.008. European Journal of Operational Research 299 (3), 910-930 - Q1 Scimago.

[J18] Quang Minh Hà, Duy Manh Vu, Xuan Thanh Le, Minh Hoàng Hà*. The traveling salesman problem with multi-visit drone. DOI: https://doi.org/10.15625/1813-9663/37/4/16180. Journal of Computer Science and Cybernetics 37 (4), 465-493.

[J17] Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà*. The Vehicle Routing Problem with relaxed priority rules. DOI: https://doi.org/10.1016/j.ejtl.2021.100039 ( in EURO Journal on Transportation and Logistics - Q1 on Scimago).

[J16] Yannis Ancele, Minh Hoàng Hà, Charly Lersteau, Dante Matellini, Trung Thanh Nguyen. Toward a more flexible VRP with pickup, delivery and consolidations. DOI: https://doi.org/10.1016/j.trc.2021.103077 (Transportation Research Part C - Q1 ranking on Scimago).

[J15] Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà. The Capacitated Arc Routing Problem with Time-Dependent Travel Times and Paths. DOI:https://doi.org/10.1287/trsc.2020.1035 (Transportation Science - Q1 ranking on Scimago)

[J14] Minh Hoàng Hà*, Tat Dat Nguyen, Thinh Nguyen Duy, Giang Hoang Pham, Thuy Do, Louis-Martin Rousseau (2020). A new constraint programming model and a linearprogramming-based adaptive large neighborhoodsearch for the vehicle routing problem withsynchronization constraints. Computers and Operations Research 124, 105085 - Q1 ranking on Scimago.

[J13] Minh Hai Nguyen; Minh Hoàng Hà*; Diep Nguyen N.; The Trung Tran (2020). Solving the k-Dominating Set Problem on Very Large-Scale Networks. Computational Social Networks 7 (1), 1-15 (Scopus - Springer)

[J12]. Minh Hoàng Hà*, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, André Langevin, Martin Trépanier (2020). Solving the clustered travelling salesman problem with d-relaxed rule. International Transactions in Operational Research 29 (2), 837-853 - Q1 ranking on Scimago.

[J11]. Quang Minh Hà, Yves Deville, Quang Dung Pham, Minh Hoàng Hà* (2020). A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone. Journal of heuristics, 26 (2), 219-247. (Q2 ranking on Scimago)

[J10]. Quoc Trung Bui, Thibaut Vidal, Minh Hoàng Hà*. (2019). On three soft rectangle packing problems with guillotine constraints. Journal of Global Optimization. Volume 74, Issue 1, pp 45–62. (Q1 ranking on Scimago)

[J9]. Quang Minh Ha, Yves Deville, Quang Dung Pham, Minh Hoàng Hà*, (2018). On the min-cost traveling salesman problem with drone. Transportation Research Part C 86: 597-621. (Q1 ranking on Scimago)

[J8]. Teobaldo Bulhoes, Minh Hoàng Hà, Thibaut Vidal, Rafael Martini (2017). The vehicle routing problem with service level constraints. European Journal of Operational Research, 265, 2:1 544-558. (Q1 ranking on Scimago)

[J7]. Tuan Anh Pham, Minh Hoàng Hà, Xuan Hoai Nguyen (2017). Solution methods for the multi-vehicle multi-covering tour problem. Computers & Operations Research 88, 258-278. (Q1 ranking on Scimago)

[J6]. Lu Chen, Michel Gendreau, Minh Hoàng Hà, André Langevin (2016). A robust optimization approach for the road network daily maintenance routing problem with uncertain service time. Transportation Research Part E: Logistics and Transportation Review 85, 40-51. (Q1 ranking on Scimago)

[J5]. Lu Chen, Boxiao Chen, Quoc Trung Bui, Minh Hoàng Hà, (2015). Designing service sectors for daily maintenance operations in a road network. International Journal of Production Research. 55:8, 2251-2265. (Q1 ranking on Scimago)

[J4]. Lu Chen, Minh Hoàng Hà, André Langevin, Michel Gendreau (2014). Optimizing road network daily maintenance operations with stochastic service and travel times. Transportation Research Part E: Logistics and Transportation Review 64, 88-102. (Q1 ranking on Scimago)

[J3]. Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau (2014). An exact algorithm and a metaheuristic for the generalized vehicle routing problem. Computers & Operations Research 43, 9-19. (Q1 ranking on Scimago)

[J2]. Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau (2012). An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. European Journal of Operational Research, Volume 226, Issue 2, 16 April 2013, Pages 211-220. (Q1 ranking on Scimago)

[J1]. Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau (2012). Solving the Close Enough Arc Routing Problem. Networks, 63:1, 107-118. (Q1 ranking on Scimago)

Các bài báo trên hội nghị có bình duyệt:

[O9] HM Nguyen, NH Chu, DN Nguyen, DT Hoang, Minh Hoàng Hà, E Dutkiewicz. Optimal Privacy Preserving in Wireless Federated Learning Over Mobile Edge Computing. ICC 2023-IEEE International Conference on Communications, 2000-2006

[O8] Pham, Q. A., Lau, H. C., Minh Hoàng Hà*, & Vu, L. (2023). An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem. Proceedings of the International Conference on Automated Planning and Scheduling, 33(1), 343-351. (Rank A*)

[O7]. Quang Anh Pham, Minh Hoàng Hà*, Duy Manh Vu, Huy Hoang Nguyen. A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations. Accepted in 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022). Rank A* - Acceptance rate = 85/277= 30%.

[O6]. Quoc Trung Dinh, Duc Dong Do, Minh Hoàng Hà. Ants can solve the parallel drone scheduling traveling salesman problem. In Proceedings of the Genetic and Evolutionary Computation Conference 2021 (GECCO ’21). ACM, New York, NY, USA, 8 pages. Rank A - Acceptance rate = 134/362 = 37%. https://doi.org/10.1145/3449639.3459342.

[O5]. Trung Thanh Nguyen, Duy Manh Vu, Yakov Zinder, Minh Hoàng Hà. On the capacitated scheduling problem with conflict jobs. DOI: https://doi.org/10.1109/KSE.2019.8919323. KSE 2019.

[O4]. Thuy Do, Giang Hoang Pham, Xuan Khoi Tran, Minh Hoang Ha, Bach Do (2017). Solving the staff rescheduling problem in Lai Chau hydropower station. https://doi.org/10.1109/NAFOSTED.2017.8108054. NICS conference 2017.

[O3] Minh Hoàng Hà, Claude-Guy Quimper, Louis-Martin Rousseau (2015). General Bounding Mechanism for Constraint Programs. Principles and Practice of Constraint Programming - Rank A, Volume 9255, Lecture Notes in Computer Science pp 158-172.

[O2]. Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau (2012). An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. In Calors J. Luz and Fernando Valente (Eds) Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES), Vilamoura, Algarve, Portugal, 4-6 February, 2012, pp. 233-239, ISBN: 978-989 8425-97-3.

[O1]. Hà Minh Hoàng, Clautiaux François, Hanafi Saïd, Wilbaut Christophe (2010). New fast heuristics for the 2D strip packing problem with guillotine constraint. In P. Festa (Ed.), SEA 2010, 9th International Symposium on Experimental Algorithms (Rank B), Lecture Notes in Computer Sciences, 6049, pp. 302-313, ISBN 3-642-13192-1.

GIẢNG DẠY

• Lý thuyết đồ thị
• Quy hoạch tuyến tính
• Quản trị chuỗi cung ứng
• Lập trình C/C++
• Toán rời rạc
• Tối ưu hóa
• Phân tích đề xuất (prescriptive analysis)

CÁC ĐỀ TÀI, DỰ ÁN ĐÃ THỰC HIỆN

1- Nghiên cứu phát triển các thuật toán giải quyết bài toán hoạch định tuyến xe và các biến thể mới. Đề tài Nafosted - Chủ nhiệm đề tài - Đã nghiệm thu (2019).

2- Modelling and optimising rail operations for more sustainable urban transport – a passenger-oriented approach, funded by the Royal Academy of Engineering, United Kingdom, 2017-2018. Đồng chủ nhiệm đề tài. 

3- Nghiên cứu giải quyết các bài toán hoạch định tuyến xe với thiết bị bay không người lái. Đề tài Nafosted - Chủ nhiệm đề tài - Đang thực hiện (2024)