𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

✍ Scribed by Santos, Haroldo G.; Ochi, Luiz S.; Souza, Marcone J.F.

Book ID
121503203
Publisher
Association for Computing Machinery
Year
2005
Tongue
English
Weight
678 KB
Volume
10
Category
Article
ISSN
1084-6654

No coin nor oath required. For personal study only.

✦ Synopsis

The Class/Teacher Timetabling Problem (CTTP) deals with the weekly scheduling of encounters between teachers and classes of an educational institution. Since CTTP is a NP-hard problem for nearly all of its variants, the use of heuristic methods for its resolution is justified. This paper presents an efficient Tabu Search (TS) heuristic with two different memory based diversification strategies for CTTP. Results obtained through an application of the method to a set of real world problems show that it produces better solutions than a previously proposed TS found in the literature and faster times are observed in the production of good quality solutions.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic using genetic di
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
✍ Gilbert Laporte; Jean-Yves Potvin; Florence Quilleret πŸ“‚ Article πŸ“… 1997 πŸ› Springer US 🌐 English βš– 736 KB

The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian Cycle such that the vertices of each cluster are visited contiguously and the clusters are vi

A reactive tabu search meta-heuristic fo
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
✍ Ibrahim H. Osman; Niaz A. Wassan πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction

A Tabu search heuristic for the vehicle
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive