787 research outputs found
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) is a temporal least
commitment heuristic search planner based on a flexible object-oriented
workbench architecture. Its design clearly separates explicit and symbolic
directed exploration algorithms from the set of on-line and off-line computed
estimates and associated data structures. MIPS has shown distinguished
performance in the last two international planning competitions. In the last
event the description language was extended from pure propositional planning to
include numerical state variables, action durations, and plan quality objective
functions. Plans were no longer sequences of actions but time-stamped
schedules. As a participant of the fully automated track of the competition,
MIPS has proven to be a general system; in each track and every benchmark
domain it efficiently computed plans of remarkable quality. This article
introduces and analyzes the most important algorithmic novelties that were
necessary to tackle the new layers of expressiveness in the benchmark problems
and to achieve a high level of performance. The extensions include critical
path analysis of sequentially generated plans to generate corresponding optimal
parallel plans. The linear time algorithm to compute the parallel plan bypasses
known NP hardness results for partial ordering by scheduling plans with respect
to the set of actions and the imposed precedence relations. The efficiency of
this algorithm also allows us to improve the exploration guidance: for each
encountered planning state the corresponding approximate sequential plan is
scheduled. One major strength of MIPS is its static analysis phase that grounds
and simplifies parameterized predicates, functions and operators, that infers
knowledge to minimize the state description length, and that detects domain
object symmetries. The latter aspect is analyzed in detail. MIPS has been
developed to serve as a complete and optimal state space planner, with
admissible estimates, exploration engines and branching cuts. In the
competition version, however, certain performance compromises had to be made,
including floating point arithmetic, weighted heuristic search exploration
according to an inadmissible estimate and parameterized optimization
Meta-Heuristic Solution in RCPSP
Tato práce se zabývá popisem stavu resource-constrained project scheduling problem. Definuje základní problém a jeho složitost. Také popisuje varianty tohoto problému. Jsou představeny algoritmy pro řešení RCPSP. V práci je důkladně rozebrán heuristický genetický algoritmus GARTH. Je také naznačena implementace dvou prototypů řešících RCPSP pomocí algoritmu GARTH. Je navrhnuto několik vylepšení originálního algoritmu a ty jsou vyhodnoceny.This thesis deals with the description of the state of resource-constrained project scheduling problem. It defines the formal problem and its complexity. It also describes variants of this problem. Algorithms for solving RCPSP are presented. Heuristic genetic algorithm GARTH is analyzed in depth. The implementation of prototypes solving RCPSP using GARTH is outlined. Several improvements to the original algorithm are designed and evaluated.
A Benchmark for ASP Systems: Resource Allocation in Business Processes
The goal of this paper is to benchmark Answer Set Programming (ASP) systems to test their performance when dealing with a complex optimization problem. In particular, the problem tackled is resource allocation in the area of Business Process Management (BPM). Like many other scheduling problems, the allocation of resources and starting times to business process activities is a challenging optimization problem for ASP solvers. Our problem encoding is ASP Core-2 standard compliant and it is realized in a declarative and compact fashion. We develop an instance generator that produces problem instances of different size and hardness with respect to adjustable parameters. By using the baseline encoding and the instance generator, we provide a comparison between the two award-winning ASP solvers clasp and wasp and report the grounding performance of gringo and i-dlv. The benchmark suggests that there is room for improvement concerning both the grounders and the solvers. Fostered by the relevance of the problem addressed, of which several variants have been described in different domains, we believe this is a solid application-oriented benchmark for the ASP community.Series: Working Papers on Information Systems, Information Business and Operation
Recommended from our members
Project schedule optimisation utilising genetic algorithms
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is conducted in this area as well as in the application of other similar meta-heuristics. The review extends previous similar reviews to include PSP utilizing the Design Structure Matrix (DSM), as well as incorporating recent developments.
There is a need within industry for optimisation algorithms that can assist in the identification of optimal schedules when presented with a network that can present a number of possible alternatives. The optimisation requirement may be subtle only performing slight resource levelling or more profound by selecting an optimal mode of execution for a number of activities or evaluating a number of alternative strategies.
This research proposes a unique, efficient algorithm using adaptation based on the fitness improvement over successive generations. The algorithm is tested initially using a MATLAB based implementation to solve instances of the travelling salesman problem (TSP). The algorithm is then further developed both within MATLAB and Microsoft Project Visual Basic to optimise both known versions of the Resource Constrained Project Scheduling Problems as well as investigating newly defined variants of the problem class
A Benchmark for ASP Systems: Resource Allocation in Business Processes
The goal of this paper is to benchmark Answer Set Programming (ASP) systems to test their performance
when dealing with a complex optimization problem. In particular, the problem tackled is resource allocation
in the area of Business Process Management (BPM). Like many other scheduling problems, the allocation
of resources and starting times to business process activities is a challenging optimization problem for ASP
solvers. Our problem encoding is ASP Core-2 standard compliant and it is realized in a declarative and
compact fashion. We develop an instance generator that produces problem instances of different size and
hardness with respect to adjustable parameters. By using the baseline encoding and the instance generator,
we provide a comparison between the two award-winning ASP solvers CLASP and WASP and report the
grounding performance of GRINGO and I-DLV. The benchmark suggests that there is room for improvement
concerning both the grounders and the solvers. Fostered by the relevance of the problem addressed, of which
several variants have been described in different domains, we believe this is a solid application-oriented
benchmark for the ASP community.Austrian Research Promotion Agency (FFG) 845638 (SHAPE
A dynamic scheduling model for construction enterprises
The vast majority of researches in the scheduling context focused on finding optimal or near-optimal predictive schedules under different scheduling problem characteristics. In the construction industry, predictive schedules are often produced in advance in order to direct construction operations and to support other planning activities. However, construction projects operate in dynamic environments subject to various real-time events, which usually disrupt the predictive optimal schedules, leading to schedules neither feasible nor optimal. Accordingly, the development of a dynamic scheduling model which can accommodate these real-time events would be of great importance for the successful implementation of construction scheduling systems.
This research sought to develop a dynamic scheduling based solution which can be practically used for real time analysis and scheduling of construction projects, in addition to resources optimization for construction enterprises. The literature reviews for scheduling, dynamic scheduling, and optimization showed that despite the numerous researches presented and application performed in the dynamic scheduling field within manufacturing and other industries, there was dearth in dynamic scheduling literature in relation to the construction industry. The research followed two main interacting research paths, a path related to the development of the practical solution, and another path related to the core model development.
The aim of the first path (or the proposed practical solution path) was to develop a computer-based dynamic scheduling framework which can be used in practical applications within the construction industry. Following the scheduling literature review, the construction project management community s opinions about the problem under study and the user requirements for the proposed solution were collected from 364 construction project management practitioners from 52 countries via a questionnaire survey and were used to form the basis for the functional specifications of a dynamic scheduling framework. The framework was in the form of a software tool fully integrated with current planning/scheduling practices with all core modelling which can support the integration of the dynamic scheduling processes to the current planning/scheduling process with minimal experience requirement from users about optimization.
The second research path, or the dynamic scheduling core model development path, started with the development of a mathematical model based on the scheduling models in literature, with several extensions according to the practical considerations related to the construction industry, as investigated in the questionnaire survey. Scheduling problems are complex from operational research perspective; so, for the proposed solution to be functional in optimizing construction schedules, an optimization algorithm was developed to suit the problem's characteristics and to be used as part of the dynamic scheduling model's core. The developed algorithm contained few contributions to the scheduling context (such as schedule justification heuristics, and rectification to schedule generation schemes), as well as suggested modifications to the formulation and process of the adopted optimization technique (particle swarm optimization) leading to considerable improvement to this techniques outputs with respect to schedules quality.
After the completion of the model development path, the first research path was concluded by combining the gathered solution's functional specifications and the developed dynamic scheduling model into a software tool, which was developed to verify & validate the proposed model s functionalities and the overall solution s practicality and scalability.
The verification process started with an extensive testing of the model s static functionality using several well recognized scheduling problem sets available in literature, and the results showed that the developed algorithm can be ranked as one of the best state-of-the-art algorithms for solving resource-constrained project scheduling problems. To verify the software tool and the dynamic features of the developed model (or the formulation of data transfers from one optimization stage to the next), a case study was implemented on a construction entity in the Arabian Gulf area, having a mega project under construction, with all aspects to resemble an enterprise structure. The case study results showed that the proposed solution reasonably performed under large scale practical application (where all optimization targets were met in reasonable time) for all designed schedule preparation processes (baseline, progress updates, look-ahead schedules, and what-if schedules).
Finally, to confirm and validate the effectiveness and practicality of the proposed solution, the solution's framework and the verification results were presented to field experts, and their opinions were collected through validation forms. The feedbacks received were very positive, where field experts/practitioners confirmed that the proposed solution achieved the main functionalities as designed in the solution s framework, and performed efficiently under the complexity of the applied case study
Reactive scheduling to treat disruptive events in the MRCPSP
Esta tesis se centra en diseñar y desarrollar una metodología para abordar el MRCPSP con diversas funciones objetivo y diferentes tipos de interrupciones. En esta tesis se exploran el MRCPSP con dos funciones objetivo, a saber: (1) minimizar la duración del proyecto y (2) maximizar el valor presente neto del proyecto. Luego, se tiene en cuenta dos tipos diferentes de interrupciones, (a) interrupción de duración, e (b) interrupción de recurso renovable. Para resolver el MRCPSP, en esta tesis se proponen tres estrategias metaheurísticas: (1) algoritmo memético para minimizar la duración del proyecto, (2) algoritmo adaptativo de forrajeo bacteriano para maximizar el valor presente neto del proyecto y (3) algoritmo de optimización multiobjetivo de forrajeo bacteriano (MBFO) para resolver el MRCPSP con eventos de interrupción. Para juzgar el rendimiento del algoritmo memético y de forrajeo bacteriano propuestos, se ha llevado a cabo un extenso análisis basado en diseño factorial y diseño Taguchi para controlar y optimizar los parámetros del algoritmo. Además se han puesto a prueba resolviendo las instancias de los conjuntos más importantes en la literatura: PSPLIB (10,12,14,16,18,20 y 30 actividades) y MMLIB (50 y 100 actividades). También se ha demostrado la superioridad de los algoritmos metaheurísticos propuestos sobre otros enfoques heurísticos y metaheurísticos del estado del arte. A partir de los estudios experimentales se ha ajustado la MBFO, utilizando un caso de estudio.DoctoradoDoctor en Ingeniería Industria
Meta-heuristic based Construction Supply Chain Modelling and Optimization
Driven by the severe competition within the construction industry, the necessity of improving and optimizing the performance of construction supply chain has been aroused. This thesis proposes three problems with regard to the construction supply chain optimization from three perspectives, namely, deterministic single objective optimization, stochastic optimization and multi-objective optimization respectively. Mathematical models for each problem are constructed accordingly and meta-heuristic algorithms are developed and applied for resolving these three problems
Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning
The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques
- …