Abstract

The goal of hot mix asphalt (HMA) design is optimal material blending to meet Superpave specifications. HMA cost minimization has being modeled as linear programing (LP) (Awuah-Offei et al 2011) and mixed integer LP problems (Brown et al, 2012) and solved with commercial software such as LINDO and CPLEX. Often these software, which are designed to solve general optimization problems, have licenses that cost thousands of dollars. The objective of this study is to develop a novel solution algorithm to the HMA optimization problem presented by Brown et al. (2012), which will negate the need for expensive commercial packages and is specific to this problem. This novel algorithm is based on the branch and bound algorithm for solving mixed integer problems. The algorithm is incorporated into a software package with an easy-touse graphical user interface. The developed algorithm is validated using a real-life HMA problem. Using this solution algorithm will save companies thousands of dollars, otherwise used to purchase software licenses.