• Title/Summary/Keyword: Constraint Programming Model

Search Result 99, Processing Time 0.025 seconds

KTX Trainset Maintenance Routing and Allocation System for Korea High-Speed Rail (한국고속철도를 위한 차량운용 및 할당시스템)

  • Hong Soon-Hum;Kim Seongho
    • Journal of the Korean Society for Railway
    • /
    • v.8 no.5
    • /
    • pp.391-397
    • /
    • 2005
  • In this paper we present a model for the maintenance routing construction and the trainset allocation (maintenance routing problem). The model solves the maintenance routing problem using column generation algorithm which was used to combine constraint programming and linear programming. Ilog-cplex was used to solve the linear programming model and Ilog-solver was used to solve the constraint programming model. The computational experience is also provided.

The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming (제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링)

  • Kim, Hak-Jin
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.2
    • /
    • pp.61-80
    • /
    • 2016
  • The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

Evaluation of Environmental Performance of Energy Systems employing Market Allocation Model in Building Sector in Korea (시장분배모형을 이용한 건물부문 에너지 시스템 환경성능평가)

  • Park, Tong-So
    • KIEAE Journal
    • /
    • v.2 no.4
    • /
    • pp.65-72
    • /
    • 2002
  • In this study, the evaluation of environmental performance of the building energy system of domestic commercial sector was carried out. Based on the theory of linear programming model, we established an evaluation model satisfying object functions and constraint conditions. Employing the model, the evaluation of building energy system was performed under the consideration of cost and environmental constraint conditions. As an evaluation tool, MARKAL (MARKet Allocation) known as a market distribution model was employed. We analyzed scenarios of Case I (Base Scenarios) through Case IX established by the combination of the components of building energy system such as glazing, building skin, core, and heat source system. According to the results of the evaluation, highest contribution on the useful energy demand was obtained from the building energy system combined with solar heat source system, when the total amounts of $CO_2$ exhaust as an environmental constraint condition is assumed to be the level of 1995.

FLEXIBLE OPTIMIZATION MODEL FOR LINEAR SCHEDULING PROBLEMS

  • Shu-Shun Liu;Chang-Jung Wang
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.802-807
    • /
    • 2005
  • For linear projects, it has long been known that resource utilization is important in improving work efficiency. However, most existing scheduling techniques cannot satisfy the need for solving such issues. This paper presents an optimization model for solving linear scheduling problems involving resource assignment tasks. The proposed model adopts constraint programming (CP) as the searching algorithm for model formulation, and the proposed model is designed to optimize project total cost. Additionally, the concept of outsourcing resources is introduced here to improve project performance.

  • PDF

A Simulation Study on a Variant Policy of Inventory Replenishment for the Order Consolidation - A Case of Steel Industry (주문 집약을 위한 재고 변용 모델 연구: 제철산업의 소로트 주문 집약 활용을 중심으로)

  • Jung, Jae-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.10-26
    • /
    • 2005
  • In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase constraint. And also, if we order at a certain date which was set by administrative convenience, we have amount constraint to order the consolidated order demands (capacity constraint). We showed this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invented a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

  • PDF

A Simulation Study on a Variant Policy of Inventory Replenishment for the Order Consolidation : A Case of Steel Industry (주문 집약을 위한 재고 변용 모델 연구 : 제철산업의 소로트 주문 집약 활용을 중심으로)

  • Jung Jae-Heon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.99-112
    • /
    • 2006
  • In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

Resource and Sequence Optimization Using Constraint Programming in Construction Projects

  • Kim, Junyoung;Park, Moonseo;Ahn, Changbum;Jung, Minhyuk;Joo, Seonu;Yoon, Inseok
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.608-615
    • /
    • 2022
  • Construction projects are large-scale projects that require extensive construction costs and resources. Especially, scheduling is considered as one of the essential issues for project success. However, the schedule and resource management are challenging to conduct in high-tech construction projects including complex design of MEP and architectural finishing which has to be constructed within a limited workspace and duration. In order to deal with such a problem, this study suggests resource and sequence optimization using constraint programming in construction projects. The optimization model consists of two modules. The first module is the data structure of the schedule model, which consists of parameters for optimization such as labor, task, workspace, and the work interference rate. The second module is the optimization module, which is for optimizing resources and sequences based on Constraint Programming (CP) methodology. For model validation, actual data of plumbing works were collected from a construction project using a five-minute rate (FMR) method. By comparing actual data and optimized results, this study shows the possibility of reducing the duration of plumbing works in construction projects. This study shows decreased overall project duration by eliminating work interference by optimizing resources and sequences within limited workspaces.

  • PDF

On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick;Chamberland Steven;Pesant Gilles
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.85-92
    • /
    • 2006
  • In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

Utilization of a Mathematical Programming Data Structure for the Implementation of a Water Resources Planning System (수자원 운영계획 시스템의 구현을 위한 수리계획 모형 자료구조의 활용)

  • Kim, Jae-Hee;Kim, Sheung-Kown;Park, Young-Joon
    • IE interfaces
    • /
    • v.16 no.4
    • /
    • pp.485-495
    • /
    • 2003
  • This paper reports on the application of the integration of mathematical programming model and database in a decision support system (DSS) for the planning of the multi-reservoir operating system. The DSS is based on a multi-objective, mixed-integer goal programming (MIGP) model, which can generate efficient solutions via the weighted-sums method (WSM). The major concern of this study is seamless, efficient integration between the mathematical model and the database, because there are significant differences in structure and content between the data for a mathematical model and the data for a conventional database application. In order to load the external optimization results on the database, we developed a systematic way of naming variable/constraint so that a rapid identification of variables/constraints is possible. An efficient database structure for planning of the multi-reservoir operating system is presented by taking advantage of the naming convention of the variable/constraint.

On Auxiliary Linear Programming Problems for Fuzzy Goal Programming (퍼지목표계획(目標計劃) 모형(模型)의 보조문제화(補助問題化))

  • Park, Sang-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.20 no.1
    • /
    • pp.101-106
    • /
    • 1992
  • In this paper fuzzy goal programming problems with fuzzy constraints and fuzzy coefficients in both matrix and right hand side of the constraints set are considered. Because of fuzzy coefficients in both members of each constraint ranking methods for fuzzy numbers are considered. An additive model to solve fuzzy goal programming problems is formulated. The diversity of each methods provides a lot of different models of auxiliary linear programming problems from which fuzzy solutions to the fuzzy goal programming problem can be obtained.

  • PDF