He Zhu

ORCID: 0000-0003-1503-6076
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Concrete and Cement Materials Research
  • Innovative concrete reinforcement materials
  • Concrete Properties and Behavior
  • Innovations in Concrete and Construction Materials
  • Concrete Corrosion and Durability
  • Dam Engineering and Safety
  • Microbial Applications in Construction Materials
  • Geotechnical Engineering and Analysis
  • Recycled Aggregate Concrete Performance
  • Fire effects on concrete materials
  • Landslides and related hazards
  • Combustion and flame dynamics
  • Vehicle Routing Optimization Methods
  • Combustion and Detonation Processes
  • Natural Language Processing Techniques
  • Additive Manufacturing and 3D Printing Technologies
  • Geotechnical Engineering and Underground Structures
  • Rock Mechanics and Modeling
  • Radiative Heat Transfer Studies
  • Building materials and conservation
  • Topic Modeling
  • Advanced Semiconductor Detectors and Materials
  • Software Testing and Debugging Techniques
  • Software Engineering Research
  • Coal Combustion and Slurry Processing

Huawei Technologies (China)
2025

University of Michigan
2020-2024

Tsinghua University
1999-2021

State Key Laboratory of Hydrology-Water Resources and Hydraulic Engineering
2015

10.1016/j.cemconcomp.2020.103766 article EN publisher-specific-oa Cement and Concrete Composites 2020-08-10

10.1016/j.conbuildmat.2020.118318 article EN Construction and Building Materials 2020-02-08

First Name is required invalid characters Last Email Address Invalid

10.14359/51733109 article EN ACI Materials Journal 2021-10-09

We present Alkaid-SDVRP, an open-source C++ package for efficiently solving the Vehicle Routing Problem with Split Deliveries (SDVRP), a classical combinatorial optimization problem which is variant of Capacitated where same customer can be served by multiple vehicles. The core algorithm Alkaid-SDVRP designed based on Iterated Local Search and Randomized Variable Neighborhood Descent frameworks are highly configurable extensible. Specifically, we implement number predefined neighborhoods...

10.1287/ijoc.2024.0606.cd article EN INFORMS journal on computing 2025-02-12

In this paper, we present Alkaid-SDVRP, an open-source C++ package for efficiently solving the Vehicle Routing Problem with Split Deliveries (SDVRP), a classical combinatorial optimization problem which is variant of Capacitated where same customer can be served by multiple vehicles. The core algorithm Alkaid-SDVRP designed based on Iterated Local Search and Randomized Variable Neighborhood Descent frameworks, are highly configurable extensible. Specifically, implement number predefined...

10.1287/ijoc.2024.0606 article EN INFORMS journal on computing 2025-03-07
Coming Soon ...