Process control in agile supply chain network.

The work comprises a new theoretical development applied to aid decision making in an increasingly important commercial sector. Agile supply, where small volumes of high margin, short life cycle innovative products are offered, is increasingly carried out through a complex global supply chain network. We outline an equilibrium solution in such a supply chain network, which works through limited cooperation and coordination along edges (links) in the network. The links constitute the stochastic modelling entities rather than the nodes of the network. We utilise newly developed phase plane analysis to identify, model and predict characteristic behaviour in supply chain networks. The phase plane charts profile the flow of inventory and identify out of control conditions. They maintain quality within the network, as well as intelligently track the way the network evolves in conditions of changing variability. The methodology is essentially distribution free, relying as it does on the study of forecasting errors, and can be used to examine contractual details as well as strategic and game theoretical concepts between decision-making components (agents) of a network. We illustrate with typical data drawn from supply chain agile fashion products.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Performance evaluation of the RPL Protocol in fixed and mobile sinks low-power and lossy networks.

Low-Power and Lossy-Network (LLN) are usually composed of static nodes, but the increase demand for mobility in mobile robotic and dynamic environment raises the question how a routing protocol for low-power and lossy-networks such as (RPL) would perform if a mobile sink is deployed. In this paper we investigate and evaluate the behaviour of the RPL protocol in fixed and mobile sink environments with respect to different network metrics such as latency, packet delivery ratio (PDR) and energy consumption. Extensive simulation using instant Contiki simulator show significant performance differences between fixed and mobile sink environments. Fixed sink LLNs performed better in terms of average power consumption, latency and packet delivery ratio. The results demonstrated also that RPL protocol is sensitive to mobility and it increases the number of isolated nodes.