This book examines the main components affecting the viability of a public-transport service
from both the passenger and agency perspectives, and offers solutions to well-known …

Computational methods for rostering and personnel scheduling has been a subject of
continued research and commercial interest since the 1950s. This annotated bibliography …

We present new multiobjective metaheuristics for solving real-world crew scheduling
problems in public bus transport companies. Since the crews of these companies are …

The problem of rerostering nurse schedules arises in hospitals when at least one nurse
informs that she will be unable to perform the shifts assigned to her on one or more future …

In this paper, the set covering problem (SCP) is considered. Several algorithms have been
suggested in the literature for solving it. We propose a new algorithm for solving the SCP …

A dynamic programming based algorithm for the crew scheduling problem. There are many
papers concerned with the crew scheduling problem in the literature. Most of the research …

We present a probabilistic greedy search method for combinatorial optimisation problems.
This approach is implemented and evaluated for the Set Covering Problem (SCP) and …

Configuration Checking (CC) is a simple tool that can be added to local search algorithms to
prevent cycling. The generic forms of CC and local search may not be suitable to solve large …

Sticker model is one of the basic models in the DNA computer models. This model is coded
with single-double stranded DNA molecules. It has the following advantages that the …

Bus driver scheduling aims to find the minimum number of bus drivers to cover a published
timetable of a bus company. When scheduling bus drivers, contractual working rules must …