In　the　paper,　a　three-level　search　algorithm　is　proposed　for　getting　reasonable　carpool　match　result.　The　first　level　selection　is　according　to　time　and　circuitous　constraint,　the　second　level　selection　is　according　to　nearby　principle,　the　third　level　selection　is　according　to　user＇s　likelihood.　Taking　advantage　of　uploading　the　ride　query　and　drive　query　separately　and　dynamically　a　s　well　as　heuristic　algorithm,　the　carpool　system　can　match　the　drivers　and　riders　quickly　responding　to　real　time　requirement.　An　in-depth　experimental　performance　analysis　of　the　proposed　method　on　real　road　networks　shows　the　efficiency　of　the　method.