Incremental graph evaluation (attribute grammar)
Incremental graph evaluation (attribute grammar)
Incremental attribute evaluation: a flexible algorithm for lazy update
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
iOpt: A Software Toolkit for Heuristic Search Methods
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The degree of dynamism for workforce scheduling problem with stochastic task duration
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
On the partitioning of dynamic workforce scheduling problems
Journal of Scheduling
| Hi-index | 0.00 |
In the past few years, metaheuristic algorithms have proved their efficiency when tackling large-scale optimisation problems in various application domains, such as transportation and logistics, manufacturing, and telecommunications. However, despite their success, these methods often require complete re-implementation in order to solve new problems or, in many cases, even variations of the same problem.To address these issues BT Exact has developed the iOpt tool-kit. iOpt provides problem modelling and solving facilities based on metaheuristic algorithms, thus reducing the time necessary to develop efficient solutions to planning and scheduling applications. It also offers, as extensions, frameworks that can be used to model specific application domains. Such an extension of iOpt is the iSchedule framework which can be used to assist non-expert users in modelling scheduling applications.The aim of this paper is to present the iSchedule capabilities as well as to illustrate their use on a particular scheduling problem, the vehicle routing problem, which is of interest to BT in its field service operations.