• 제목/요약/키워드: Mixed integer linear program

검색결과 20건 처리시간 0.025초

2단계 VMI 공급사슬에서 통합 재고/차량경로 문제를 위한 유전알고리듬 해법 (A Genetic Algorithm for Integrated Inventory and Routing Problems in Two-echelon VMI Supply Chains)

  • 박양병;박해수
    • 대한산업공학회지
    • /
    • 제34권3호
    • /
    • pp.362-372
    • /
    • 2008
  • Manufacturers, or vendors, and their customers continue to adopt vendor-managed inventory(VMI) program to improve supply chain performance through collaboration achieved by consolidating replenishment responsibility upstream with vendors. In this paper, we construct a mixed integer linear programming model and propose a genetic algorithm for the integrated inventory and routing problems with lost sales maximizing the total profit in the VMI supply chains which comprise of a single manufacturer and multi-retailer. The proposed GA is compared with the mathematical model on the various sized test problems with respect to the solution quality and computation time. As a result, the GA demonstrates the capability of reaching solutions that are very close to those obtained by the mathematical model for small problems and stay within 3.2% from those obtained by the mathematical model for larger problems, with a much shorter computation time. Finally, we investigate the effects of the cost and operation variables on the total profit of the problem as well as the GA performance through the sensitivity analyses.

A Lagrangian Relaxation Approach to Capacity Planning for a Manufacturing System with Flexible and Dedicated Machines

  • Lim, Seung-Kil;Kim, Yeong-Dae
    • 한국경영과학회지
    • /
    • 제23권2호
    • /
    • pp.47-65
    • /
    • 1998
  • We consider a multiperiod capacity planning problem for determining a mix of flexible and dedicated capacities under budget restriction. These capacities are controlled by purchasing flexible machines and/or new dedicated machines and disposing old dedicated machines. Acquisition and replacement schedules are determined and operations are assigned to the flexible or dedicated machines for the objective of minimizing the sum of discounted costs of acquisition and operation of flexible machines, new dedicated machines, and old dedicated machines. In this research, the Problem is formulated as a mixed integer linear Program and solved by a Lagrangian relaxation approach. A subgradient optimization method is employed to obtain lower bounds and a multiplier adjustment method is devised to improve the bounds. We develop a linear programming based Lagrangian heuristic algorithm to find a good feasible solution of the original problem. Results of tests on randomly generated test problems show that the algorithm gives relatively good solutions in a reasonable amount of computation time.

  • PDF

고정비용과 비선형 단위운송비용을 가지는 수송문제를 위한 이단유전알고리즘에 관한 연구 (A Study on the Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost)

  • 성기석
    • 한국경영과학회지
    • /
    • 제41권4호
    • /
    • pp.113-128
    • /
    • 2016
  • This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment.

온실가스 감축정책에 따른 발전사업자의 대응 방안에 관한 연구 (A Study on the GENCO Adaptive Strategy for the Greenhouse Gas Mitigation Policy)

  • 최동찬;한석만;김발호
    • 전기학회논문지
    • /
    • 제61권4호
    • /
    • pp.522-533
    • /
    • 2012
  • This paper presents an adaptive strategy of GENCOs for reducing the greenhouse gas by fuel mix change. Fuel mix stands for generation capacity portfolio composed of different fuel resources. Currently, the generation sector of power industry in Korea is heavily dependent on fossil fuels, therefore it is required to change the fuel mix gradually into more eco-friendly way based on renewable energies. The generation costs of renewable energies are still expensive compared to fossil fueled resources. This is why the adaptive change is more preferred at current stage and this paper proposes an optimal strategy for capacity planning based on multiple environmental scenarios on the time horizon. This study used the computer program tool named GATE-PRO (Generation And Transmission Expansion PROgram), which is a mixed-integer non-linear program developed by Hongik university and Korea Energy Economics Institute. The simulations have been carried out with the priority allocation method in the program to determine the optimal mix of NRE(New Renewable Energy). Through this process, the result proposes an economic fuel mix under emission constraints compatible with the greenhouse gas mitigation policy of the United Nations.

A Dispatching Method for Automated Guided Vehicles to Minimize Delays of Containership Operations

  • Kim, Kap-Hwan;Bae, Jong-Wook
    • Management Science and Financial Engineering
    • /
    • 제5권1호
    • /
    • pp.1-25
    • /
    • 1999
  • There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

  • PDF

수직통합 의사결정을 위한 계량분석모형 (A mathematical planning model for vertical integration)

  • 문상원
    • 경영과학
    • /
    • 제10권1호
    • /
    • pp.193-205
    • /
    • 1993
  • This paper presents a mathematical model for a class of vertical integration decisions. The problem structure of interest consists of raw material vendors, components suppliers, components processing plants, final product (assembly) plants and external components buyers. Economic feasibility of operating components plants instead of keeping outside suppliers is our major concern. The model also determines assignment of product lines and production volumes to each open plant considering the cost impacts of economies of scale and plant complexity. The problem formulation leads to a concave, mixed integer mathematical program. Given the state of the art of nonlinear programming techniques, it is often not possible to find global optima for reasonably sized such problems. We developed an optimization solution algorithm within the framework of Benders decomposition for the case of a piecewise linear concave cost function. It is shown that our algorithm generates optimal solutions efficiently.

  • PDF

Clustering and Communications Scheduling in WSNs using Mixed Integer Linear Programming

  • Avril, Francois;Bernard, Thibault;Bui, Alain;Sohier, Devan
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.421-429
    • /
    • 2014
  • We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors.We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm.We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.

RPS(Renewable Portflio Standard) 제도 도입에 따른 국내 장기 전원구성 변화에 관한 연구 (A Study of the Long-term Fuel Mix with the Introduction of Renewable Portfolio Standard)

  • 이정인;한석만;김발호
    • 전기학회논문지
    • /
    • 제58권3호
    • /
    • pp.467-477
    • /
    • 2009
  • Renewable Portfolio Standard (RPS) is a regulatory policy that requires the generation companies to increase the proportion of renewable energy sources such as wind, solar, LFG, fuel cell, and small hydro. Recently, Korean government decided to increase the portion of renewable energy to 3% to total electricity generation by 2012 from the current level of 0.13%. To achieve this goal, an innovative plan for market competitiveness would be required in addition to the present Feed-In-Tariff (FIT). That is Korean government has taken it into consideration to introduce a Renewable Portfolio Standard (RPS) as an alternative to FIT. This paper reviews the impact of RPS on the long-term fuel mix in 2020. The studies have been carried out with the GATE-PRO (Generation And Transmission Expansion PROgram) program, a mixed-integer non-linear program developed by Hongik university and Korea Energy Economics Institute. Detailed studies on long-term fuel mix in Korea have been carried out with four RPS scenarios of 3%, 5%, 10% and 20%. The important findings and comments on the results are given to provide an insight on future regulatory policies.

Joint Antenna Selection and Multicast Precoding in Spatial Modulation Systems

  • Wei Liu;Xinxin Ma;Haoting Yan;Zhongnian Li;Shouyin Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3204-3217
    • /
    • 2023
  • In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

Generation of Business Process Reference Model Considering Multiple Objectives

  • Yahya, Bernardo Nugroho;Wu, Jei-Zheng;Bae, Hye-Rim
    • Industrial Engineering and Management Systems
    • /
    • 제11권3호
    • /
    • pp.233-240
    • /
    • 2012
  • The implementation of business process management (BPM) systems in large number of business organizations transforms BPM system into such a level of maturity and tends to collect large repositories of business process (BP) models. This issue encourages BP flexibility that leads to a large number of process variants derived from the same model, but differing in structure, to be stored in the large repositories of BP models. Therefore, the repositories may include thousands of activities and related business objects with variation of requirements and quality of service. It is a common practice to customize processes from reference processes or templates in order to reduce the time and effort required to design and deploy processes on all levels. In order to address redundancy and underutilization problems, a generic process model, called as reference BP, is absolutely necessary to cover the best of process variants. This study aims to develop multiple-objective business process genetic algorithm (MOBPGA) to find a set of non-dominated (Pareto) solutions of business reference model to enhance conventional approach which considered only a single objective on creating BP reference model by using proximity score measurement. A mixed-integer linear program is constructed to evaluate performance of the proposed MOBPGA on small-scale problems by using standard measures for multiple-objective techniques. The results will show the viability of applying MOBPGA in terms of simultaneously maximizing proximity score measurement, minimizing total duration, and total costs of the selected reference model.