Search

Minimum cost path problems are considered for time-varying networks which possess piecewise linear travel costs/transit delays on edges and constant parking costs/enterable-unenterable restrictions on nodes. The arrival characteristics and departure characteristics are formulated, and their computation algorithms are designed. These characteristics are not values but curves with respect to generic time, which are novel features contrasted with the conventional time-invariant problems. Piecewise linearity of costs and delays drastically reduces the computational complexity. >

In this paper we consider a sex-fair matching in the stable marriage problem. The sex-fair stable matching defined in this paper has a property that the sum of the partner's rank of each man in his preference list is as close as possible to the sum of the partner's rank of each woman in her preference list. We transform the sex-fair marriage problem into a graph problem which is suitable for a genetic algorithm. We propose a genetic algorithm for the sex-fair stable matching. The transformation into the graph problem makes application of the GA easier and effective. Computer experiments show the effectiveness of the proposed genetic algorithm.