• 한국항해학회지
• /
• 제20권4호
• /
• pp.59-70
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.

• Smart Structures and Systems
• /
• 제33권3호
• /
• pp.177-188
• /
• 2024

The fatigue-induced sequential failure of a structure having structural redundancy requires system-level analysis to account for stress redistribution. System reliability-based design optimization (SRBDO) for preventing fatigue-initiated structural failure is numerically costly owing to the inclusion of probabilistic constraints. This study incorporates the Branch-and-Bound method employing system reliability Bounds (termed the B³ method), a failure-path structural system reliability analysis approach, with a metaheuristic optimization algorithm, namely grey wolf optimization (GWO), to obtain the optimal design of structures under fatigue-induced system failure. To further improve the efficiency of this new optimization framework, an additional bounding rule is proposed in the context of SRBDO against fatigue using the B³ method. To demonstrate the proposed method, it is applied to complex problems, a multilayer Daniels system and a three-dimensional tripod jacket structure. The system failure probability of the optimal design is confirmed to be below the target threshold and verified using Monte Carlo simulation. At earlier stages of the optimization, a smaller number of limit-state function evaluation is required, which increases the efficiency. In addition, the proposed method can allocate limited materials throughout the structure optimally so that the optimally-designed structure has a relatively large number of failure paths with similar failure probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6009-6027
• /
• 2019

Support vector machine (SVM) classifiers have been widely used for object detection. These methods usually locate the object by finding the region with maximal score in an image. With bag-of-features representation, the SVM score of an image region can be written as the sum of its inside feature-weights. As a result, the searching process can be executed efficiently by using strategies such as branch-and-bound. However, the feature-weight derived by optimizing region classification cannot really reveal the category knowledge of a feature-point, which could cause bad localization. In this paper, we represent a region in an image by a collection of local feature-points and determine the object by the region with the maximum posterior probability of belonging to the object class. Based on the Bayes' theorem and Naive-Bayes assumptions, the posterior probability is reformulated as the sum of feature-scores. The feature-score is manifested in the form of the logarithm of a probability ratio. Instead of estimating the numerator and denominator probabilities separately, we readily employ the density ratio estimation techniques directly, and overcome the above limitation. Experiments on a car dataset and PASCAL VOC 2007 dataset validated the effectiveness of our method compared to the baselines. In addition, the performance can be further improved by taking advantage of the recently developed deep convolutional neural network features.

• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.43-54
• /
• 2003

Due to insufficient available bandwidth resources and the continuously growing demand for cellular communication services, the channel assignment problem has become increasingly important. To trace the optimal assignment, several heuristic strategies have been proposed. So far, most of them focus on the small-scale systems containing no more than 25 cells and they use an anachronistic cost model, which does not satisfy the requirements ity. Solving the small-scale channel assignment problems could not be applied into existing large scale cellular networks' practice. This article proposes a decomposition approach to solve the fixed channel assignment problem (FCAP) for large-scale cellular networks through partitioning the whole cellular network into several smaller sub-networks and then designing a sequential branch-and-bound algorithm that is made to solve the FCAP for them sequentially. The key issue of partition is to minimize the dependences of the sub-networks so that the proposed heuristics for solving smaller problems will suffer fewer constraints in searching for better assignments. The proposed algorithms perform well based on experimental results and they were applied to the Taiwan Cellular Cooperation (TCC) in ChungLi city to find better assignments for its network.

• 천문학회보
• /
• 제37권1호
• /
• pp.49.1-49.1
• /
• 2012

Recently it is found that the globular clusters are not only bound in their host galaxies, but also are wandering between galaxies in Virgo and Coma clusters. The cluster-wide distribution of these intracluster globular clusters (IGCs) suggests that IGCs are an important probe to understand hierarchical structure formation. We present a survey of IGCs in Virgo cluster using HST archive images for four HST/ACS fields located from about 9 arcmin to 40 acrmin from the cluster center. We find ten new IGCs and confirm four previously known IGCs. The number density of IGCs decreases as the distance from the cluster center increases. We derive integrated photometry of IGCs. We also obtain photometry of resolved stars in the outer region of each cluster. These IGCs are fainter than $M_V{\approx}-9.5$ and mostly blue in (V-I) color. showing that they are mostly metal poor. The locations of red giant branch stars of IGCs in color-magnitude diagrams also show that they are meal-poor. We discuss the implications of these results.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.179-184
• /
• 2002

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2005년도 공동추계학술대회
• /
• pp.461-470
• /
• 2005

A dynamic supply chain that is composed of many different companies with different rent roles and interests allows free joining and secession. Buyers place orders simultaneously and manufacturers should compete each other for the orders. The purpose of our paper is how to find the optimal formation of supply chain ill a global viewpoint while allowing each member company to pursue his local goal The dynamic nature of supply chain formation causes the variation of cost depending on how many orders a manufacturer would accept. We propose a multi-agent based negotiation protocol that efficiently leads to the formation of optimal supply chain without giving up maximization of the individual profit in multi-agent environment of the make-to-order industry. The goal of the negotiation is to form a supply chain to minimize the overall sum of manufacturers' manufacturing cost, and earliness cost and tardiness cost based on SET model. We compare the negotiation protocol with Branch & Bound method. Finally, the validity and performance of buyer's negotiation has been tested experimentally.

• 한국재료학회지
• /
• 제12권11호
• /
• pp.875-879
• /
• 2002

$Pb_{1-x}$ $Cd_{x}$ $I_2$ (x=0.0, 0.2, 0.5, 0.7, 0.9, 1.0) single crystals were grown by using Bridgman method and their structural and optical properties were investigated from the measurement of X-ray diffraction, optical absorption and photoluminescence. As-grown single crystals have hexagonal closed packed layered structure. The values of lattice constant c decrease with increasing composition x. Direct and indirect transition optical energy band gaps are calculated from optical absorption spectra measured at room temperature. They increase exponentially from 2.3eV to 3.2 eV with increasing composition x. The energies of photoluminescence peak due to donor bound exciton measured at 6K increase with increasing composition . However, the peak energies of donor-acceptor pair (DAP) are independent of the optical energy band gaps of $Pb_{1-x}$/$Cd_{x}$ $I_2$ single crystals.

• 한국인터넷방송통신학회논문지
• /
• 제19권2호
• /
• pp.221-227
• /
• 2019

무기 목표물 배정 문제는 지금까지 다항시간 알고리즘이 제안되지 않는 NP-hard 문제로 알려져 왔다. 그럼에도 불구하고, 본 문제에 대해 가능한 모든 경우수를 검증하는 Brute-Force 법이나 분기한정법으로 최적 해를 구하거나 유전자 알고리즘, 입자군 최적화 등의 인공지능 방법으로 근사 해를 구하는 방법들이 제안되고 있다. 본 논문에서는 단지 무기의 총 대수 k, 무기 종류 수 m, 목표물 개수 n에 대해 O(mn)을 k회 수행하는 O(kmn) 다항시간으로 최적 해를 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 Brute-Force 법에 비해 수행횟수를 최소화 시킬 뿐 아니라 최적해도 구하는 장점을 갖고 있다.

• 대한산업공학회지
• /
• 제37권2호
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.