The unequal area facility design problem has been studied in the literature generally by considering block layout separate from detailed design. This paper shows a tractable method for concurrently optimizing department shape and location within the facility, and selection of the appropriate number of input/output (I/O) stations per department and then optimally locating them. The distance metr...

This paper proposes a new location problem of competitive facilities, e.g. shops. In the most studies of competitive facility location, the distance between the facilities and their customers is represented as the Euclid distance. The proposing location problem introduces the A-distance, proposed by Widmayer etc., for representing the situation that the directions which customers can move are g...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...