In Handwritten Character Recognition (HCR), interest in feature extraction has been on the increase with the abundance of algorithms derived to increase the accuracy of classification. In this paper, a metaheuristic approach for feature extraction technique in HCR based on Flower Pollination Algorithm (FPA) was proposed. Freeman Chain Code (FCC) was used as data representation. However, the FCC representation is dependent on the route length and branch of the character node. To solve this problem, the metaheuristic approach via FPA was proposed to find the shortest route length and minimum computational time for HCR. At the end, comparison of the result with the previous metaheuristic approaches namely Harmony Search Algorithm (HSA) was performed.