78 resultados para NP-dur


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Boron nitride nanomaterials have attracted significant interest due to their superior chemical and physical properties. Despite these novel properties, investigation on the interaction between boron nitride nanoparticle (BN NP) and living systems has been limited. In this study, BN NP (100–250 nm) is assessed as a promising biomaterial for medical applications. The toxicity of BN NP is evaluated by assessing the cells behaviours both biologically (MTT assay, ROS detection etc.) and physically (atomic force microscopy). The uptake mechanism of BN NP is studied by analysing the alternations in cellular morphology based on cell imaging techniques. The results demonstrate in vitro cytocompatibility of BN NP with immense potential for use as an effective nanoparticle for various bio-medical applications.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper proposes a new multi-stage mine production timetabling (MMPT) model to optimise open-pit mine production operations including drilling, blasting and excavating under real-time mining constraints. The MMPT problem is formulated as a mixed integer programming model and can be optimally solved for small-size MMPT instances by IBM ILOG-CPLEX. Due to NP-hardness, an improved shifting-bottleneck-procedure algorithm based on the extended disjunctive graph is developed to solve large-size MMPT instances in an effective and efficient way. Extensive computational experiments are presented to validate the proposed algorithm that is able to efficiently obtain the near-optimal operational timetable of mining equipment units. The advantages are indicated by sensitivity analysis under various real-life scenarios. The proposed MMPT methodology is promising to be implemented as a tool for mining industry because it is straightforwardly modelled as a standard scheduling model, efficiently solved by the heuristic algorithm, and flexibly expanded by adopting additional industrial constraints.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Because of the bottlenecking operations in a complex coal rail system, millions of dollars are costed by mining companies. To handle this issue, this paper investigates a real-world coal rail system and aims to optimise the coal railing operations under constraints of limited resources (e.g., limited number of locomotives and wagons). In the literature, most studies considered the train scheduling problem on a single-track railway network to be strongly NP-hard and thus developed metaheuristics as the main solution methods. In this paper, a new mathematical programming model is formulated and coded by optimization programming language based on a constraint programming (CP) approach. A new depth-first-search technique is developed and embedded inside the CP model to obtain the optimised coal railing timetable efficiently. Computational experiments demonstrate that high-quality solutions are obtainable in industry-scale applications. To provide insightful decisions, sensitivity analysis is conducted in terms of different scenarios and specific criteria. Keywords Train scheduling · Rail transportation · Coal mining · Constraint programming