Please choose your delivery country and your customer group
Describes a method of partitioning an area containing many geographical locations, each with an associated activity or workload, into districts called 'tours'. The objective is to assign each location to a tour in such a way that the total workload assigned to each tour falls within specified limits and that the total cost to service the locations from a specified set of tour 'centers' is minimized. The present approach is compared and contrasted with other approaches to the problem in several contexts. The actual situation motivating the present work and the derivation of the transportation linear programming model is described. Special attention is given to features which aid implementation and which more realistically model the actual situation by handling the user's implicit constraints, i.e. those not explicitly contained in the transportation formulation. Finally, the results of an actual large-scale problem are presented.