Routing electrical wires on integrated circuits such as the ones used for MEMS is proven to be an NP-hard problem, for which therefore heuristics specific to the application and optimized for it need to be developed. This work approaches the problem using a graph representation and develops a set of heuristics to achieve wire routing in the MEMS periphery while taking into account wire length and number of turns, as well as allowing to match length and capacitance between pairs of wires.