in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...

the probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. here we illustrate that a wider context may be considered and show some structural restrictions on the group.

Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...

in this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. after obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. the number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. by exploiting the order, we label the s...

‎in this paper we prove that a simplicial complex is determined‎ ‎uniquely up to isomorphism by its barycentric subdivision as well as‎ ‎its comparability graph‎. ‎we also put together several algebraic‎, ‎combinatorial and topological invariants of simplicial complexes‎.