This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. PCA approach that was originally introduced by Sacco for policy optimization. PCA always accepts improved solution...

In this paper we propose a new parallelization scheme for Simulated Annealing — Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, directed at message-passing systems such as clusters. It combines heuristics such as adaptive clustering with SA to achieve more efficiency in local search. Through experiments with various optimization problems and comp...

This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement ...

We investigate cooperative local search to improve upon known results of the office-spaceallocation problem in universities and other organizations. A number of entities (e.g., research students, staff, etc.) must be allocated into a set of rooms so that the physical space is utilized as efficiently as possible while satisfying a number of hard and soft constraints. We develop an asynchronous c...

Consider the semi-parametric linear regression model Y = ′X+ , where has an unknown distribution F0. The semi-parametric MLE
̃ of under this set-up is called the generalized semi-parametric MLE(GSMLE).Although the GSML estimation of the linear regression model is statistically appealing, it has never been attempted due to difficulties with obtaining the GSML estimates of and F until recent work...