Show simple item record

dc.contributor.authorLin, Qun
dc.contributor.authorTordesillas, A.
dc.contributor.editorAibing Yu
dc.contributor.editorKejun Dong
dc.contributor.editorRunyu Yang
dc.contributor.editorStefan Luding
dc.identifier.citationLin, Qun and Tordesillas, Antoinette. 2013. Constrained optimisation in granular network flows: Games with a loaded dice, in Yu, A. and Dong, K. and Yang, R. and Luding, S. (ed), Proceedings of Powders and Grains 2013, Jul 8-12 2013, pp. 547-551. Sydney, NSW: University of New South Wales.

Flows in real world networks are rarely the outcome of unconditional random allocations as, say, the roll of a dice. Think, for example, of force transmission through a contact network in a quasistatically deforming granular material. Forces ‘flow’ through this network in a highly conditional manner. How much force is transmitted between two contacting particles is always conditional not only on all the other forces acting between the particles in question but also on those acting on the other particles in the system. Broadly, we are interested in the nature and extent to which flows through a contact network favour certain pathways over others, and how the mechanisms that govern such biased flows for a given imposed loading history determine the future evolution of the contact network. Our first step is to solve a selection of fundamental combinatorial optimisation problems on the contact network from the perspective of force transmission. Here we report on solutions to the Maximum Flow Minimum Cost Problem for a weighted contact network where the weights assigned to the links of the contact network are varied according to their contact types. We found that those pathways through which the maximum flow of force is transmitted, in the direction of the maximum principal stress, at minimum cost – pass through the great majority of the force chains. Although the majority of the contacts in these pathways are elastic, the plastic contacts bear an undue influence on the minimum cost.

dc.titleConstrained optimisation in granular network flows: Games with a loaded dice
dc.typeConference Paper
dcterms.source.titleAIP Conference Proceedings
dcterms.source.seriesAIP Conference Proceedings
dcterms.source.conferencePowders and Grains 2013
dcterms.source.conference-start-dateJul 8-12 2013
dcterms.source.placeSydney, Australia

NOTICE: This is the author’s version of a work in which changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication.

curtin.accessStatusOpen access

Files in this item


This item appears in the following Collection(s)

Show simple item record