Hudson S: ‘Incremental attribute evaluation: a flexible algorithm for lazy update’, ACM Transactions on Programming Languages and Systems, 13, No 3, pp 315-341 (July 1991).ĭorne R and Voudouris C: ‘HSF: A generic framework to easily design Meta-Heuristic methods’, 4th Metaheuristics International Conference (MIC'2001), Porto, Portugal, pp 423-428 (2001).īräysy O and Gendreau M: ‘Route construction and local search algorithms for the vehicle routing problem with time windows’, Internal Report STF42 A01024 SINTEF Applied Mathematics, Department of Optimisation, University of Oslo, Norway (2001). Hoover R: ‘Incremental graph evaluation’, PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY (1987).
Zanden B V, Halterman R, Myers B A, McDaniel R, Miller R, Szekely P, Giuse D and Kosbie D: ‘Lessons Learned about One-Way, Dataflow Constraints in the Garnet and Amulet Graphical Tool-kits’, Unpublished manuscript (1999).Īlpern B, Hoover R, Rosen B K, Sweeney P F and Zadeck F K: ‘Incremental evaluation of computational circuits’, ACM SIGACTSIAM '89 Conference on Discrete Algorithms, pp 32-42 (1990).
#Ischedule.. software
Voudouris C and Dorne R: ‘Integrating Heuristic Search and One-Way Constraints in the iOpt Tool-kit: Optimisation Software Class Libraries’, in Voss S and Woodruff D (Eds): ‘Operations Research/ Computer Science Interfaces 18’, Chapter 6, Kluwer Academic Publishers, pp 177-192 (2002). Voudouris C, Dorne R, Lesaint D and Liret A: ‘iOpt: a software tool-kit for heuristic search methods’, Principles and Practice of Constraint Programming (CP 2001), in Walsh T (Ed): ‘Lecture Notes in Computer Science 2239’, Springer, pp 716-729 (2001). 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.ĭorne R, Ladde C and Voudouris C: ‘Heuristic search builder: the iOpt tool to visually build metaheuristic algorithms’, 5th Metaheuristics International Conference (MIC'2003), Kyoto, Japan (August 2003). Such an extension of iOpt is the iSchedule framework which can be used to assist non-expert users in modelling scheduling applications. It also offers, as extensions, frameworks that can be used to model specific application domains. 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. To address these issues BT Exact has developed the iOpt tool-kit. 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.
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.
0 kommentar(er)
