Graph neural networks (GNNs) have emerged as a powerful tool for tackling Nondeterministic Polynomial-time (NP) hard combinatorial optimization (CO) problems which were believed that no algorithm can solve them in polynomial time, such as maximum cut and maximum independent set. The fundamental idea behind these methods is to represent CO problems as graphs, enabling GNNs to learn node or graph embeddings that encode essential combinatorial information. However, the design of GNN architectures for specific CO problems still demands considerable manual effort, relying heavily on domain expertise. Moreover, existing automated GNN architectures are primarily developed for traditional graph learning tasks and are not well-suited for addressing the unique challenges posed by NP-hard CO problems. To bridge this gap, we propose AutoGNP, a novel Automated GNN architecture search framework specifically designed to solve NP-hard combinatorial optimization problems. AutoGNP formulates CO problems using GNNs and focuses on two representative problem types: mixed integer linear programming and quadratic unconstrained binary optimization. The core idea of AutoGNP is to leverage graph neural architecture search algorithms to automatically identify the optimal GNN architecture for a given CO problem, significantly reducing the need for manual intervention and expertise. Unlike existing graph neural architecture search algorithms, AutoGNP incorporates 2-hop message passing operators in its architecture search space, allowing it to capture more intricate dependencies within the graph structure. We implement AutoGNP as an end-to-end learning framework, which is evaluated on benchmark combinatorial optimization datasets to demonstrate its performance. Our experimental results show that AutoGNP outperforms existing state-of-the-art GNN architectures across a variety of combinatorial optimization problems, yielding superior empirical performance.