http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
장병만 서울産業大學校 1990 논문집 Vol.31 No.1
The public Vehicle Routing Problem(PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to enter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.
장병만 서울産業大學校 1986 논문집 Vol.24 No.1
This paper presents an efficient heuristic algorithm for a multidepot crew scheduling with dead-head flights. This algorithm is extended from a Greedy heuristic algorithm for a multi-depot multi-salesman traveling salesman problem. We first transform a given flight schedule into a multi-depot multi-traveling salesman problem, considering aircraft flight and crew management constraints. Then we solve this problem by using this modified Greedy heuristic algorithm.
장병만 한국경영과학회 2004 經營 科學 Vol.21 No.2
This paper presents a review on the operations research models for environmental management including water, land, and air pollution in the environmental chain and including waste treatment, reverse logistics, and product recovery in the supply chain for last 30 years. The integrated and globalized environmental issues have given OR professionals a lot of natural opportunities for an effective environmental management with mathematical programming and computer simulation tool.
Column Generation법에 의한 관광 버스 배차 방법
장병만 서울産業大學校 1987 논문집 Vol.25 No.1
This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and communication services. First this algorithm transforms the problem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second a greedy heuristic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.
장병만 한국경영과학회 1998 經營 科學 Vol.15 No.2
This paper presents a new algorithm for the K Shortest Paths Problem which is developed with a Double Shortest Arborescence and an inward arc breaking method. A Double Shortest Arborescence is made from merging a forward shortest arborescence and a backward one with Dijkstra algorithm, and shows us information about each shorter path to traverse each arc. Then K shorter paths are selected in ascending order of the length of each short path to traverse each arc, and some paths of the K shorter paths need to be replaced with some hidden shorter paths in order to get the optimal paths. And if the cross nodes which have more than 2 inward arcs are found at least three times in K shorter path, the first inward arc of the cross node is broken and a new shorter path is exposed. If this exposed path is shorter than the Kth shorter path, the exposed path replaces the Kth shorter path. This procedure is repeated until the cross nodes are not found in K shorter paths, and then the K shortest paths problem is solved exactly. This algorithm are computed with complexity O(n^3) and especially O(n^2) in the case K=3.
공급체인관리를 위한 O.R 모형 활용에 관한 연구 동향
장병만 한국로지스틱스학회 2001 로지스틱스연구 Vol.9 No.2
본 연구는 공급체인의 설계와 분석에 대한 O.R 모형화와 알고리즘의 활용에 관한 문헌들을 조사 분석한 것이다. 1970년대 이후의 논문들을 전략적 공급체인 설계 모형, 생산-물류 통제 모형과 공급체인 시뮬레이션의 3가지 분야로 나누어서, 다단계로 구성된 여러 유형의 공급체인의 시스템에서 통합적 관리를 위해 각 논문에서 사용한 O.R 모형과 알고리즘과 활용방안 및 고려사항들을 분석하여, O.R을 이용한 접근방법이 공급체인의 부분적이거나 전체적인 성과를 분석하는데 적합함을 보여주고 있다. 또한 전자상거래와 글로벌화된 생산과 물류시스템의 급속한 확산을 뒷받침하고 전세계에 걸친 경쟁력 강화를 도모하기 위해서, 더욱 공급체인의 중요성과 통합성이 강조됨에 따라 점차 복잡해지는 공급체인의 효과적인 전략시스템 구축과 운영관리를 하는데 있어서, O.R을 이용한 모형과 알고리즘 개발에 기여할 여지가 많음을 제시하고 있다. This paper surveys operations research modelling and applications for design and analysis of a supply chain, which is very important in improving the overall performance of the integrated supply chain. The scope includes strategic design, logistics/production coordination, and supply chain simulation models, stemming from the first work in the 1970s. In global supply chain and logistics management, the intensified world-wide competition and increasing manufacturing costs have resulted in the considerable attention on operations research modeling to improve the supply chain, and opened many research opportunities to operational researchers. It is concluded that operations research approach are well suited to analyze the local and some global performances of the supply chain, and the improved operations research models and tools are required in order to enhance the performance.