Scheduling fixtures for New Zealand cricket

Management Science

Keywords

Scheduling, timetabling, sport, metaheuristics, simulated annealing, subcost guided search

Research output: Working paper

Published

Standard

Scheduling fixtures for New Zealand cricket. / Wright, M B.
Lancaster University: The Department of Management Science, 2003. (Management Science Working Paper Series).

Research output: Working paper

Harvard

Wright, MB 2003 'Scheduling fixtures for New Zealand cricket' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

Wright, M. B. (2003). Scheduling fixtures for New Zealand cricket. (Management Science Working Paper Series). The Department of Management Science.

Vancouver

Wright MB. Scheduling fixtures for New Zealand cricket. Lancaster University: The Department of Management Science. 2003. (Management Science Working Paper Series).

Author

Wright, M B. / Scheduling fixtures for New Zealand cricket. Lancaster University : The Department of Management Science, 2003. (Management Science Working Paper Series).

Bibtex

@techreport{cdf9977c7b9943f9ad47adf7cef893f4,

title = "Scheduling fixtures for New Zealand cricket",

abstract = "This paper describes the problem faced every year by New Zealand Cricket in scheduling the principal inter-regional fixtures. This is a combinatorial optimization problem with few constraints but many objectives, which are described in detail. A technique known as Subcost-Guided Simulated Annealing is used to solve this problem, producing one or more schedules of high quality. One particular feature of the problem requires great care - the determination of adequate neighbourhoods for such a tightly constrained problem, where most simple changes lead to infeasibility. The approach adopted is to use a complex and unorthodox definition of a perturbation, each one leading to several possible neighbouring solutions which are generated by means of a tree search procedure. The system will be used in practice for the 2003-4 cricket season and beyond.",

keywords = "Scheduling, timetabling, sport, metaheuristics, simulated annealing, subcost guided search",

author = "Wright, {M B}",

year = "2003",

language = "English",

series = "Management Science Working Paper Series",

publisher = "The Department of Management Science",

type = "WorkingPaper",

institution = "The Department of Management Science",

}

RIS

TY - UNPB

T1 - Scheduling fixtures for New Zealand cricket

AU - Wright, M B

PY - 2003

Y1 - 2003

N2 - This paper describes the problem faced every year by New Zealand Cricket in scheduling the principal inter-regional fixtures. This is a combinatorial optimization problem with few constraints but many objectives, which are described in detail. A technique known as Subcost-Guided Simulated Annealing is used to solve this problem, producing one or more schedules of high quality. One particular feature of the problem requires great care - the determination of adequate neighbourhoods for such a tightly constrained problem, where most simple changes lead to infeasibility. The approach adopted is to use a complex and unorthodox definition of a perturbation, each one leading to several possible neighbouring solutions which are generated by means of a tree search procedure. The system will be used in practice for the 2003-4 cricket season and beyond.

AB - This paper describes the problem faced every year by New Zealand Cricket in scheduling the principal inter-regional fixtures. This is a combinatorial optimization problem with few constraints but many objectives, which are described in detail. A technique known as Subcost-Guided Simulated Annealing is used to solve this problem, producing one or more schedules of high quality. One particular feature of the problem requires great care - the determination of adequate neighbourhoods for such a tightly constrained problem, where most simple changes lead to infeasibility. The approach adopted is to use a complex and unorthodox definition of a perturbation, each one leading to several possible neighbouring solutions which are generated by means of a tree search procedure. The system will be used in practice for the 2003-4 cricket season and beyond.

KW - Scheduling

KW - timetabling

KW - sport

KW - metaheuristics

KW - simulated annealing

KW - subcost guided search

M3 - Working paper

T3 - Management Science Working Paper Series

BT - Scheduling fixtures for New Zealand cricket

PB - The Department of Management Science

CY - Lancaster University

ER -

Research

Keywords