• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2854-2874
• /
• 2015

This paper presents a game theoretic approach to analyze the public goods (PGs) allocation in peer-to-peer (p2p) networks. In order to reduce the free-riders and promote the cooperation among peers, we propose an incentive mechanism with cooperation-based game theory. In this paper, we regarded the contributed resources by cooperators as public goods (PGs). We also build the PGs allocation in P2P networks to be the optimization problem, and the optimal solution of PGs allocation satisfies the Bowen-Lindahl-Samuelson equilibrium. Firstly, based on the subscriber mechanism, we analyze the feasibility and prove the validity, which can achieve Nash equilibrium. However, this strategy cannot meet to Bowen-Lindahl-Samuelson equilibrium as the free-riders do not pay with their private goods for consuming the PGs. Secondly, based on the Walker mechanism, we analyze the feasibility and prove the validity for the same allocation problem, which meets to Bowen-Lindahl-Samuelson equilibrium and achieves Pareto efficiency within cooperative game. Simulations show that the proposed walker mechanism can significantly improve the network performance of throughout, and effectively alleviate free-riding problem in P2P networks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.2
• /
• pp.77-95
• /
• 2004

This paper deals with the process planning of flexible manufacturing systems (FMS) with various flexibilities and multiple objectives. The consideration of the manufacturing flexibility is crucial for the efficient utilization of FMS. The machine, tool, sequence, and process flexibilities are considered In this research. The flexibilities cause to increase the Problem complexity. To solve the process planning problem, an this paper an evolutionary algorithm is used as a methodology. The algorithm is named multiobjective competitive evolutionary algorithm (MOCEA), which is developed in this research. The feature of MOCEA is the incorporation of competitive coevolution in the existing multiobjective evolutionary algorithm. In MOCEA competitive coevolution plays a role to encourage population diversity. This results in the improvement of solution quality and, that is, leads to find diverse and good solutions. Good solutions means near or true Pareto optimal solutions. To verify the Performance of MOCEA, the extensive experiments are performed with various test-bed problems that have distinct levels of variations in the four kinds of flexibilities. The experiments reveal that MOCEA is a promising approach to the multiobjective process planning of FMS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1299-1305
• /
• 2017

In this paper, we consider a beamforming game between the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter is able to find a modified strategy from the quantized channel state information (CSI). In the beamforming game, each of the transmitters (i.e., a player) tries to maximize the achievable rate (i.e., a payoff function) via a proper beamforming strategy. In our case, each transmitter's beamforming strategy is represented by a linear combining factor between the maximum ratio transmission (MRT) and the zero forcing (ZF) beamforming vectors, which is the Pareto optimal achieving strategy. With the quantized CSI, the transmitters' strategies may not be valid because of the quantization errors. We propose a modified solution, which takes into account the effects of the quantization errors.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.8
• /
• pp.893-904
• /
• 2013

In this paper, a Kriging metamodel-based multi-objective optimization strategy in conjunction with an NSGA-II(non-dominated sorted genetic algorithm-II) has been employed to optimize the valve-plate shape of the axial piston pump utilizing 3D CFD simulations. The optimization process for minimum pressure ripple and maximum pump efficiency is composed of two steps; (1) CFD simulation of the piston pump operation with various combination of six parameters selected based on the optimization principle, and (2) applying a multi-objective optimization approach based on the NSGA-II using the CFD data set to evaluate the Pareto front. Our exploration shows that we can choose an optimal trade-off solution combination to reach a target efficiency of the axial piston pump with minimum pressure ripple.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.95-108
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.