• Industrial Engineering and Management Systems
• /
• 제13권4호
• /
• pp.369-382
• /
• 2014

This paper introduces a new multi-product multi-period multi-objective aggregate production planning problem. The proposed problem is modeled using multi-objective mixed-integer mathematical programming. Three objective functions, including minimizing total cost, maximizing customer services level, and maximizing the quality of end-product, are considered, simultaneously. Several constraints such as quantity of production, available time, work force levels, inventory levels, backordering levels, machine capacity, warehouse space and available budget are also considered. Some parameters of the proposed model are assumed to be qualitative and modeled using fuzzy sets. Then, a fuzzy goal programming approach is proposed to solve the model. The proposed approach is applied on a real-world industrial case study of a color and resin production company called Teiph-Saipa. The approach is coded using LINGO software. The efficacy and applicability of the proposed approach are illustrated in the case study. The results of proposed approach are compared with those of the existing experimental methods used in the company. The relative dominance of the proposed approach is revealed in comparison with the experimental method. Finally, a data dictionary, including the way of gathering data for running the model, is proposed in order to facilitate the re-implementation of the model for future development and case studies.

• 한국지능시스템학회논문지
• /
• 제15권3호
• /
• pp.355-356
• /
• 2005

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권4호
• /
• pp.293-298
• /
• 2016

Document summarization is an important task in various areas where the goal is to select a few the most descriptive sentences from a given document as a succinct summary. Even without training data of human labeled summaries, there has been several interesting existing work in the literature that yields reasonable performance. In this paper, within the same unsupervised learning setup, we propose a more principled learning framework for the document summarization task. Specifically we formulate an optimization problem that expresses the requirements of both faithful preservation of the document contents and the summary length constraint. We circumvent the difficult integer programming originating from binary sentence selection via continuous relaxation and the low entropy penalization. We also suggest an efficient convex-concave optimization solver algorithm that guarantees to improve the original objective at every iteration. For several document datasets, we demonstrate that the proposed learning algorithm significantly outperforms the existing approaches.

• Advances in aircraft and spacecraft science
• /
• 제10권5호
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• 대한교통학회지
• /
• 제18권1호
• /
• pp.75-85
• /
• 2000

기존모형을 이용한 연구들은 최적화기법에 있어서 의사결정을 지원할 수 있는 최적해를 도출해내기 위해 목적식이나 제약조건식에 정확한 데이터 값을 입력시켜 최적해를 계산하였다. 또한 현실세계의 불확실하고 주관적인 상황들은 확률적 불확실성으로 간주하여 주관적인 상황들은 배제하였다. 즉, 이러한 최적해는 의사결정자가 의사결정상의 위험을 최소화하기 위하여 경영과학적인 방법들을 적용하는 과정에서 기존모형들의 목적함수를 완전하게 만족시켜 주는 해라고 할 수 있다. 이에 따라 수요량의 변화 및 기타 변수들의 변화에 적절히 대응할 수 없었으며, 입지의사결정자에게 입지결정에 대한 정보의 부족 등으로 선택의 기회를 폭넓게 제공하지 못하는 문제가 있었다. 이러한 배경하에서 본 연구는 의사결정분석에서 엄격히 주어진 제약조건하에서의 목적식을 최적화하는 문제로서 제약조건을 반드시 만족시켜야만 했던 기존의 의사결정문제를 바탕으로, 애매한 환경에서의 의사결정을 주관적인 측면에서 가장 합리적으로 이루어 보려는 의도로 Zadeh교수가 제안한 퍼지이론을 이용하여 물류단지 입지 및 규모결정모형을 개발하고자 하였다. 모형의 현실적 적합성 및 적용가능성을 분석한 결과, 첫째, 입지 및 규모결정시 기존의 연구에서 제시할 수 없었던 현실세계의 유연적이고 융통성있는 측면을 반영하여 입지 및 규모를 결정해 낼 수 있었으며 둘째, 기존의 입지결정 모형에 비해 상대적으로 많은 의사결정 상황을 최종의사결정 자에게 다양한 정보 및 선택의 기회를 제공해 줄 수 있었다. 따라서 이 결과가 반드시 최적의 입지를 제시하고 있다고는 단정할 수 없으나 모든 자료들이 빠짐없이 정확하게 모형에 반영될 경우 현실적 상황에서 모형적용이 가능하다고 하겠으며 이 모형은 현실상황에서 발생하는 기타시설의 입지선정 문제에도 적용할 수 있을 것이라고 판단된다. 수 있을 뿐 아니라, 평가된 지표가 신뢰할 만한 수준이 아니라면, 추정된 결과를 보정할 수 있는 가능성을 제시하고자 한다.or objection to the criticism of eating dog meat is that male and female commonly answered most that ′As dog meat food Is our traditional food culture. it is not the problem to be found fault with by others.′ The second reason for that is followed by iris deliciousness.up compared the service quality perception factor of the food service provider. The result was that the group having both the " will buy the service again" and "will suggest to others" criteria, that is, with higher loyalty, tend to have higher points than other group s in the dimension of ′Employee attitude′ and ′ Cleanliness′(p〈0.05), which means these two dimensions are closely related to customer loyalty. 3) From a regression analysis for the service quality perception level of the food service provider and overall satisfaction, it has been found that :

• 한국항만학회지
• /
• 제11권2호
• /
• pp.191-202
• /
• 1997

As the suitability of berth allocation will ultimately have a significant influence on the performance of a berth, a great deal of attention should be given to berth allocation. Generally, a berth allocation problem has conflicting factors between servers and users. In addition, there is uncertainty in great extent caused by various factors such as departure delay, inclement weather on route, poor handling equipment, a lack of storage space, and other factors contribute to the uncertainty of arrival and berthing time. Thus, it is necessary to establish berth allocation planning which reflects the positions of interested parties and the ambiguity of parameters. For this, a berth allocation problem is formulated by fuzzy 0-1 integer programming introducing the concept of maximum Position Shift(MPS). But, the above approach has limitations in terms of computational time and computer memory when the size of problem is increased. It also has limitations with respect to the integration of other sub-systems such as ship planning system and yard planning system. For solving such problem, this paper focuses particularly on developing an efficient heuristic algorithm as a new technique of getting an effective solution. And also the suggested algorithm is verified through the illustrative examples and empirical appalicaton to BCTOC.