• Title/Summary/Keyword: LINGO

Search Result 35, Processing Time 0.023 seconds

Development of DSS Tool for Mailbag Routing Problem (우편수송경로 결정을 위한 DSS Tool 개발)

  • 조용철;최민구;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.05a
    • /
    • pp.71-76
    • /
    • 2000
  • 본 논문에서는 우편사업의 효율적 운영을 위해 추진중인 우편집중국의 건설과 관련하여 기존에 발표된 우편집중국의 건설에 관한 연구보고서 등을 통해서 우편집중국의 운영에 관한 연구 둥을 분석한다. 또한, 우편집중국간의 우편수송경로결정 의사결정지원 시스템을 개발하기 위해 우편물 수송모델을 수송수단에 따른 복수계층 네트워크(Multi layer network)로 구성하여, 이를 다품목네트워크 흐름문제로 수송모델을 정의하고, 정수선형계획문제로 정식화하여 최적화 S/W LINGO를 이용하여 구한 해의 결과를 분석하여 향후 우편수송경로결정을 위한 의사결정지원시스템의 기본으로 활용하고자 한다.

  • PDF

Multiple Objective Manpower planing Model Considered with Advance Rate for Officer's Native (장교 출신별 진출율을 고려한 다목표 인력계획모형)

  • 민계료
    • Journal of the military operations research society of Korea
    • /
    • v.24 no.1
    • /
    • pp.157-175
    • /
    • 1998
  • This paper develops multiple objective manpower planning model in order to design and adjust manpower structure and flow when advance rate for officer's native is considered. The state transition in manpower structure is analyzed using Markov chains. Multiple objectives in the model are security of advance rate, satisfaction of rank's number of personnel, and stability of the number of recruit personnel for officer's native. Trade - off of these objectives is made to evaluate manpower structure and flow. Solutions of this model are obtained by LINGO package.

  • PDF

A Study on the Development of Transportation Module for Mail Transportation Decision Support System (우편수송DSS를 위한 수송 MODULE 구축에 관한 연구)

  • 최민구;김영민;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.101-104
    • /
    • 2000
  • 본 연구는 우편물의 효율적인 수송을 위해 복합연계수송 개념을 도입한 Multi-commodity, Multi-modal Network Model과 이를 토대로 정식화하고 이를 적용 한 LHGO programming Model를 제안하고자 한다. 구축된 LINGO Model은 응용 Application내에 장착되어지는 Module로 구성가능하며 이를 GIS Tool인 GEOmania를 이용한 우편물 수송 DSS을 위한 Application 개발에 활용하고자 한다.

  • PDF

Improvement of Optimal Bus Scheduling Model Reflecting Bus Passenger's Degree of Satisfaction (이용자 만족도를 반영한 최적 버스 배차 간격 설정 모형의 개발)

  • Bae, Sang-Hoon;Kim, Tag-Young;Ryu, Byung-Yong
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.3
    • /
    • pp.12-23
    • /
    • 2007
  • The purpose of this studγ if to understand problem of present bus scheduling system and to develop optimal bus scheduling model which improve bus passenger's degree of satisfaction(DOS) and bus company's operation efficiency at the same time. This study developed optimal bus scheduling model, which reflected bus passenger's degree of satisfaction(DOS), applied to existing model that summery of bus operation cost($C_o$), passenger queuing time cost($C_{pw}$) and passenger travel time cost($C_{pl}$). And optimal bus scheduling model which developed in this study is optimized that using LINGO program based on linear program. Also by using the general case in Busan, compare total cost of present bus scheduling system and existing scheduling model with total cost of optimal bus scheduling model which reflected bus passenger's degree of satisfaction(DOS).

  • PDF

The Assignment-Swap Algorithm for Large-scale Transportation Problem with Incomplete Cost Lists (불완전 비용 리스트를 가진 대규모 수송문제의 배정-교환 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.51-58
    • /
    • 2015
  • This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

Integrating Machine Reliability and Preventive Maintenance Planning in Manufacturing Cell Design

  • Das, Kanchan;Lashkari, R.S.;Sengupta, S.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.113-125
    • /
    • 2008
  • This paper presents a model for designing cellular manufacturing systems (CMS) by integrating system cost, machine reliability, and preventive maintenance (PM) planning. In a CMS, a part is processed using alternative process routes, each consisting of a sequence of visits to machines. Thus, a level of 'system reliability' is associated with the machines along the process route assigned to a part type. Assuming machine reliabilities to follow the Weibull distribution, the model assigns the machines to cells, and selects, for each part type, a process route which maximizes the overall system reliability and minimizes the total costs of manufacturing operations, machine underutilization, and inter-cell material handling. The model also incorporates a reliability based PM plan and an algorithm to implement the plan. The algorithm determines effective PM intervals for the CMS machines based on a group maintenance policy and thus minimizes the maintenance costs subject to acceptable machine reliability thresholds. The model is a large mixed integer linear program, and is solved using LINGO. The results point out that integrating PM in the CMS design improves the overall system reliability markedly, and reduces the total costs significantly.

A study of Multi-commodity Pickup IT Delivery VRSP with Time-window (배달과 수거를 포함한 다품목 수송차량 배차문제에 관한 연구)

  • 조용철;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.91-94
    • /
    • 2000
  • 본 연구에서는 차량용량이 같지 않은 복수의 다른 종류의 차량을 고려하여, 차량이 이동하면서 배달과 수거를 동시에 수행하고 수거지점으로부터 화물을 수거하여 차고지로 운송하는 귀로 화물(Backhauls)을 갖는 PDP(Pickup and Delivery Problem)문제를 그 연구 대상으로 한다. 동시에 차량을 통해 이동되는 품목이 단일 품목이 아니고, 배달 및 수거시간제약조건을 갖는 다품목 시간제약 수송차량 배차문제를 Time-space network를 이용하여 정수선형계획문제로 정식화한다. 이를 최적화 S/W LINGO를 이용하여 위의 모든 제약조건을 만족하면서 운용되는 차량수와 차량의 이동경로를 최소화하는 해를 구하고, 분석한 내용을 보여주고자 한다. 덧붙여 위 문제의 입·출력자료를 데이터베이스화하여 지리정보시스템(Geographic Information System : GIS)과 통합한 차량운행경로결정 지원시스템을 구축하기 위한 방법을 제시하고자 한다.

  • PDF

Optimizing Gate Assignment at Domestic Airport (공항터미널 주기장 배정의 최적화에 대한 연구)

  • 이희남;김연명;이공섭;이창호
    • Journal of the Korea Safety Management & Science
    • /
    • v.4 no.4
    • /
    • pp.129-136
    • /
    • 2002
  • Utilization rate for the restrictive gate and required time and walking distance to board are to be a measure for the gate management and passenger's convenience estimation. So, the main purpose of the gate management are maximization of utilization rate and increment of airport terminal user's convenience through the efficient gate management. This study intends to maximize the utilization rate on usable gates and minimize the passenger's working distance in terminal by concerning about layout, terminal configuration, local passenger of the airport and formulate the gate assignment problem with integer linear programming problem. Then we obtained solution using optimization software LINGO and analyzed that maximize the number of assignment flights and minimize the passenger's walking distance.

A Study on the Quantitative Analysis to Determine the Optimal Train Service Patterns and Train-Sets Necessary under SKIP-STOP Operations in the Metro Railway (광역철도의 SKIP-STOP 운영에서 최적 열차패턴 및 차량소요 산정을 위한 정량분석 연구)

  • 오석문;홍순흠;김형진
    • Proceedings of the KSR Conference
    • /
    • 2002.05a
    • /
    • pp.135-141
    • /
    • 2002
  • Recently, in the metro railways, researches on the skip-stop operation and development of the double deck train-set are active, which is to improve the service quality through reducing the passenger travel time and suppling seating service. Constructing new line or reforming the existent line needs huge amount of budget. Therefore, previous to start these large scale projects, scrutiny on benefit improvement, cost reduction and those optimal trade-off is indispensable. In this paper, a quantitative analysis to determine the optimal train service patterns and train-sets necessary is proposed, under the skip-stop operation condition in the metro railways. The analysis models are formulated in mathematical programming model, and tested validity using the LINGO 7.0.

  • PDF

Zero-one Integer Programming Approach to Determine the Minimum Break Point Set in Multi-loop and Parallel Networks

  • Moirangthem, Joymala;Dash, Subhransu Sekhar;Ramaswami, Ramas
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.2
    • /
    • pp.151-156
    • /
    • 2012
  • The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.