ABSTRACT
This chapter describes several fundamental problems that have been studied in the field of hub location and present optimisation models for each of the problems. Large-scale transportation networks are characterised by the amount of freight that needs to be shipped between various points on the network, and by the resources available within the existing infrastructure on which shipments are to be made. In situations where hubs can only process a limited amount of flow, one is concerned with determining the number and location of hubs where the flow into a hub is constrained by its capacity. The chapter provides two other types of hub location problems that mainly arise in the distribution of time-sensitive freight, namely the p-hub centre problem and the hub covering problem. These two problems differ from the traditional hub location problems hitherto discussed in the way that they account for cost.
