We introduce the Mixed Fleet Vehicle Routing Problem with Time Windows and Partial Recharging by Multiple Chargers (MF-VRP-MC). It composes of electric and internal combustion vehicles, and consolidates several aspects in a comprehensive unique model. The MF-VRP-MC considers travelled distance and carried load on vehicles in both emission and energy con-sumption functions. It deals with the minimization of total cost while satisfying customer delivery demands. First, we develop a mixed integer mathematical programming formulation for the MF-VRP-MC. Because of the NP-hardness of the problem, to solve medium and large-size instances, then we develop an Adaptive Large Neighborhood Search (ALNS) based algorithm with intro-ducing new advanced neighborhood mechanisms to successfully handle complex problem con-straints. Meantime, new approaches are tailored for boosting diversification effect in addition to new neighborhood scoring policy and new enhancement procedure. Furthermore, selection of recharging technology among the others at charging station is firstly considered in the solution phase of a mixed fleet problem. Extensive computational results indicate that our ALNS performs quite well on benchmark instances.