This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...

this research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. this objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. moreover, this type of problem is np-hard and solving this probl...

Genetic algorithms are powerful population based optimization methods. Their multi-objective counterparts have been often used to effectively optimize classification systems, but little is discussed on their computational cost to solve such problems. To better understand this issue, an annealing based approach to optimize a classification system is proposed and discussed. Results are then compa...

The location routing problem with simultaneous pickup and delivery (LRPSPD) is a new variant of the location routing problem (LRP). The objective of LRPSPD is to minimize the total cost of a distribution system including vehicle traveling cost, depot opening cost, and vehicle fixed cost by locating the depots and determining the vehicle routes to simultaneously satisfy the pickup and the delive...

modeling of network security is useful approach to comprehend the status. In this paper, network is modeled in a graph. Security problem is solved in graph as Graph Coloring Problem (GCP). In GCP, two adjacent nodes must have different colors. Thus GCP provides the security in the network. One objective in GCP is chromatic number and another objective is total price. We present a multi-objectiv...

In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

To understand the regulation of the gene expression, the identification of transcription start sites (TSSs) is a primary and important step. With the aim to improve the computational prediction accuracy, we focus on the most challenging task, i.e., to identify the TSSs within 50 bp in non-CpG related promoter regions. Due to the diversity of non-CpG related promoters, a large number of features...