http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 장병만 (검색결과 1,896 건)
- 무료
- 기관 내 무료
- 유료
-
장병만,박순달 한국경영과학회 1984 한국경영과학회지 Vol.9 No.1
This paper presents an algorithm for a crew scheduling problem with dead-head flights. In this paper the problem is transformed to a directed graph G(N,A) where nodes denote flight legs and arcs denote connections between flight i and j, and further a dead-head flight node is divided to two nodes: one for the real team, the other for a dead-head team. By doing so, a multiple traveling salesman algorithm can be applied to the graph so that consequently a solution for the problem is obtained. This paper modifies and improves the Clarke-Wright's saving method for finding multiple salesman tours in the graph.
-
차량 자동안내 체계를 위한 최단시간 소요경로 산출에 관한 연구
장병만 서울産業大學校 1996 논문집 Vol.43 No.1
In a dynamic route guidance system, an algorithm is needed that calculates the time-dependent shortest paths to a given destination node every time interval in a network with time-dependent link cost. This approach attempts to handle both the shortest time paths(i. e., user optimum) and the overall traffic assignment(i. e., system optimum) together. In every time interval, the link costs are calculated with the sigmoid function, which is inversely proportional to traffic congestion and density. All pairs of the shortest time path algorithm is based on the improved Dijkstra method, which have computational complexity of O(m+nC½). Also, alternative paths are presented in the way of choosing the detour of the minimum redyced cost link. The algorithm was implemented and coded on a Sun- Sparc workstation, and tested on a large actual street network. The test result was proven to be good enough to real traffic situations.
-
장병만 서울産業大學校 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.
-
다품종 복수공장 생산에서의 생산 분배 및 수송 계획 문제연구
장병만 한국경영과학회 1993 한국경영과학회 학술대회논문집 Vol.- No.1
This paper presents a model and a heuristic procedure to design production planning and transportation scheduling systems of critical items, components and products on the basis of material requirement planning concept and transportation planning model. These systems are stemmed from a multi-site multi-product provided to validate the heuristic procedure developed.
-
첨단도로 교통체계 차량안내용의 시간종속복수 최단 경로해법
장병만 한국경영과학회 1998 한국경영과학회 학술대회논문집 Vol.- No.1
In a dynamic route guidance, an algorithm is needed that calculates the time - dependent shortest paths to a given destination node for every time step a given time horizon in a network with time dependent link cost. This approach can try to handle simultaneously both the shortest time paths (user optimum) and traffic assignment (system optimum ). It discretizes the horizon of interest into small time intervals. In every time step, the link costs are calculated with the sigmoid function, which is inversely propositional to traffic conjestion and density approximately. And K =3 shortest time paths algorithm is developed with a Double Shortest Arborescence which provides three exposed shortest path between the source and the sink with time complexity O ( n^2 ). T his Double Shortest Arborescence is consisted of a forward shortest arborescence and a backward one with the Dijkstra algorithm. All pair of K =3 shortest time path algorithm are made with repeating the K =3 shortest path algorithm between each node and are computed with complexity O (n^4).
-
-
장병만 한국경영과학회 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.
-
장병만 서울産業大學校 2005 논문집 Vol.54 No.1
본 논문에서는 우회경로를 찾는 해법을 연구하여 복수(K개)의 최단경로를 찾는 해법을 제시하고자 한다. 출발지에서 모든 지점까지의 최단경로나무를 구한 후 목적지까지 가장 짧은 최단 경로를 선정하고, 이 최단경로를 중심으로 각 지점으로 들어가는 K-1개의 짧은 우회경로를 찾아내고, 이 우회경로들의 각 지점으로 들어가면서 기존의 K번째 경로보다 더 짧은 우회경로를 찾아 기존의 K번째의 경로들을 대체하는 방식을 반복하면서, K개의 최단경로를 찾는다. 이 해법은 ITS나 네비게이션 등 첨단 교통시스템의 교통량 분산 등에 사용될 수 있다. This paper presents a new detour algorithm for the K Shortest Path Problem which produces shortest path with Dijkstra algorithm and detouring paths of every vertex of some shortest paths with branch and bound method. K shorter paths are made with detouring edges of a shortest path, and these K paths are replaced with a shorter detouring path which is searched from detouring edges.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
