http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
송성헌,박순달 한국경영과학회 1989 한국경영과학회 학술대회논문집 Vol.- No.1
This paper presents a heuristic algorithm for the standard vehicle routing problem. We call it the node position movement procedure, which improves a feasible solution by moving each node position and gives a good quality solution. The procedure is illustrated through an example. The performance is experimentally compared with the well known heuristics in quality aspects.
宋省憲 弘益大學校 1988 弘大論叢 Vol.20 No.2
In many maintenance services the maintenance unit usually visits a number of demand points in a single tour. The multistop location problem is to find the depot location for the maintenance unit. We focus on locating p depots in a specified region where numerous demand points requiring maintenance services are scattered. We call it the multistop location problem of multiple facility maintenance centers. The method proposed here for the above problem can be uesfully applied to the situations where the service time performing maintenance operation is relatively short and the demand points are densely located in small area.
宋省憲 弘益大學校 科學技術硏究所 1994 科學技術硏究論文集 Vol.4 No.-
The vehicle requirement planning in a company is very important not only for the stable procurement of vehicles in order to supply goods to its customers at right times and at right places, but also for the compilation of logistics budget. The purpose of this paper is to suggest a systematic approach to establish the requirement planning for the full load vehicles. Since the algorithm developed here is based on the historical vehicle routes information, the vehicle requirement planning that is close to reality can be prepared.
宋省獻,嚴春植 弘益大學校 科學技術硏究所 2001 科學技術硏究論文集 Vol.12 No.-
One of the important components in designing logistics network is facility location problem. It is possible to solve the real world location problem using the mathematical model included in the package because of the growth of computer hardware technology. In this paper the package is developed to find the optimal network flows and the relevant transportation cost according to the location alternatives of distribution centers in the two stage logistics network. For the given logistics network there are two types of the distribution schema according to the service area constraint of demand points. The one is the minimum cost network flow problem that is solved by the network simplex method and another is the integer programming problem that is solved by the branch & bound method. And the package extracts the distance data that is needed in the optimal model from the geographical data of GIS. The optimal solution can be found using the package developed in this research and the result cab be displayed on GIS map. And also a numerical example is illustrated.
宋省憲 弘益大學校 1987 弘大論叢 Vol.19 No.2
A primal-dual algorithm is developed to solve the specialized transportation problem efficiently,and the performance of this algorithm is analytically compared with the well known algorithm. This algorithm can be well applied to the multiple traveling salesman problem and the vehicle routing problem.
宋省憲 弘益大學校 1985 弘大論叢 Vol.17 No.2
Various heuristic algorithms for the traveling salesman, and vehicle routing problems are classified by their peculiar criteria and their interrelations are discussed. An efficient refinement procedure is presented to improve any results by the existing heuristic algorithms which is not optimal.