Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

Commercial plant breeders improve economically important traits by selectively mating individuals from a given breeding population. Potential pairings are evaluated before the growing season using Monte Carlo simulation, and a mating design is created to allocate a fixed breeding budget across the parent pairs to achieve desired population outcomes. We introduce a novel objective function for t...

The efficiency of any metaheuristic algorithm largely depends on the way of balancing local intensive exploitation and global diverse exploration. Studies show that bat algorithm can provide a good balance between these two key components with superior efficiency. In this paper, we first review some commonly used metaheuristic algorithms, and then compare the performance of bat algorithm with t...

We consider the problem of efficient mechanism design for multilateral trading of multiple goods with independent private types for players and incomplete information among them. The problem is partly motivated by an efficient resource allocation problem in communication networks where there are both buyers and sellers. In such a setting, ex post budget balance and individual rationality are ke...

We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to truthfully report their cost, and maximizes the buyer’s value while guaranteeing that the total payment does not exceed her budget. Such budget feasible mecha...

The dense wavelength division multiplexing routing and provisioning problem with uncertain demands and a fixed budget is modeled as a multicriteria optimization problem. To obtain a robust design for this problem, the primary objective is to minimize a regret function that models the total amount of over and/or under provisioning in the network resulting from uncertainty in a demand forecast. P...

The microprocessor chip designer must solve the problem of partitioning millions of transistors into an arbitrary number of hardware structures within a nite chip area toward achieving maximumperformance. This combinative complexity is compounded by a lengthy performance evaluation of each proposed design. We present the application of a real-valued multiobjective genetic algorithm on an asynch...