2 resultados para Food handling

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Here we describe the stomach contents of nine small mammal species (seven rodents and two didelphid marsupials) co-occurring in an old-growth Atlantic forest area. For four terrestrial rodents, we also compared the importance of arthropods in the diet and the selection of arthropod groups by comparing consumption with availability. Small mammals and arthropods were sampled in a 36-ha grid containing 25 sampling stations spaced every 150 m, and 47 stomach contents were analysed. While plant matter was the predominant item in the stomach contents of two rodents (Oligoryzomys nigripes and Rhipidomys mastacalis), four species presented arthropods as the main food item (the rodents Brucepattersonius soricinus and Oxymycterus dasytrichus, and the marsupials Monodelphis n. sp. and Marmosops incanus) and three consumed more plant matter than arthropods, but had significant amounts of both items (the rodents Delomys sublineatus, Euryoryzomys russatus and Thaptomys nigrita). Our results suggest that differences in diet, coupled with differences in habit and microhabitat preferences, are important factors allowing resource partition among species of the diverse group of co-occurring terrestrial small mammals in Atlantic forest areas. Moreover, arthropods were not preyed opportunistically by any of the four terrestrial rodents, since consumption was not proportional to availability. Rather, selection or rejection of arthropod groups seems to be determined by aspects other than availability, such as nutritional value, easiness of capture and handling or palatability.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.