Keynotes Dr. James Smithies: Building the Canterbury Earthquakes Digital Archive Senior Lecturer in Digital Humanities, University of Canterbury Dr. Ray Hidayat: Interesting Algorithms in Telogis Route Telogis Route is full of complex algorithms. When planning driver territories, how can we estimate the required driving time quickly? When optimising routes, how can we discourage routes from ove...

The annual dairy transportation problem involves designing the routes that collect milk from farms and deliver it to processing plants. The demands of these plants can change from one week to the next, but the collection is fixed by contract and must remain the same throughout the year. While the routes are currently designed using the historical average demand from the plants, we show that inc...

Traditionally, traffic assignment allocates trips to links in a traffic network. Nowadays it is also useful to recommend routes. Here, it is interesting to recommend routes that are as close as possible to the system optimum, while also considering the user equilibrium. To compute an approximation of such an assignment, we use a hybrid approach in which an optimization process based on an evolu...

This paper presents cell formation (CF) problem in dynamic condition with multiple alternative process plans and a set of alternative routes for each of process plans. Previous models paid attention to just one of the terms of process plans and routes and also they have not reflected the notion of defect rate after operations. Therefore, this paper also addresses defect rate. The proposed model...

The random assignment problem is to minimize the cost of an assignment in a n×n matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2, . . . , m, for m = n or n, and random permutations of 1, 2, . . . , n for each row, or of 1, 2, . . . , n for the whole matrix. We find the limit of the expected cos...

We study multitasking scheduling and due-window assignment problems in a single machine, which can be found various application domains. In environment, unfinished job always interrupts in-processing job. common due window assignment, the aim is to find optimal minimise value of earliness tardiness penalty. this paper, we two problems, where objective first problem earliness, tardiness, startin...