中文摘要：

The circle geometric constraint model(CGCM) was put forward for resolving the open-pit mine ore-matching problems(OMOMP).By adopting the approaches of graph theory,block model of blasted piles was abstracted into a set of nodes and directed edges,which were connected together with other nodes in the range of circle constraints,to describe the mining sequence.Also,the constructing method of CGCM was introduced in detail.The algorithm of CGCM has been realized in the DIMINE system,and applied to a short-term(5d) program calculation for ore-matching of a cement limestone mine in Hebei Province,China.The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles.This model,which is applicable for resolving OMOMP under complicated geometric constraints with accurate results,provides effective ways to solve the problems of open-pit ore-matching.

英文摘要：

The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.