The Volume-to-Point (VP) problem is a base problem of heat conduction optimization. The nonlinear two-dimensional optimization problem of VP is discretized and transformed to a combinatorial optimization problem, which can be solved by some modern optimization algorithms. Algorithms for VP problem using simulated annealing and genetic algorithm are developed. Results for different cases are obtained using these algorithms. Analyses of the results and algorithms are also presented, that shows these algorithms are better than bionic optimization algorithm and constructal theory for VP problem, and can be generalized to complex conditions. (c) 2006 Elsevier Ltd. All rights reserved.