• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.9-17
• /
• 1988

This vehicle scheduling problem with multiple depots and multiple vehicle types (VMM) is to determine the optimal vehicle routes to minimize the total travel costs. The object of this paper is to develope an exact algorithm for the VMM. In this paper the VMM is transformed into a mathematical model of the vehicle problem with multiple depots. Then an efficient branch and bound algorithm is developed to obtain an exact solution for this model. In order to enhance the efficiency, this algorithm emphasizes the follows; First, a heuristic algorithm is developed to get a good initial upper bound. Second, an primal-dual approach is used to solve subproblems which are called the quasi-assignment problem, formed by branching strategy is presented to reduce the number of the candidate subproblems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• 한국항공우주법학회:학술대회논문집
• /
• 2008.05a
• /
• pp.19-30
• /
• 2008

This paper is intended to identify the main problems for attracting inbound tourists in Korea in conjunction with aviation sector. This paper mainly deals with policy issues of tourism-aviation sector. The major impediments in the aviation sector for attracting inbound tourists can be lack of flight seat supply at peak season, flight time schedule, and cooperation of Airlines. Policy suggestions for international tourism promotion in Korea can be summarized as: re-adjustment of flight time schedule between Japan-Korea routes, market promotion for attracting Chinese visitors, development of Korea-China-Japan triangular tourism product, efficient provision of airport facility, and in particular collaboration between government sectors of countries and private sectors of Airlines and travel agencies.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.1084-1092
• /
• 2005

Various urban transport policies have an effect on urban transit riderships. This study reports variations of metropolitan subway travel patterns affected by an enormous change in bus routes and transfer discount policy between subway and bus mode conducted by Seoul city in July 1st of 2004. In an effort to see the difference between the before and the after policies, two datasets are prepared. Firstly, on a daily bassis, an origin-destination trip table of May of 2004 is used. Secondly, on a daily bassis, an origin-destination trip table of August-September of 2004 is used as a counter measure. Even if seasonal variation was not considered. there were increasing riderships of about 0.25 million on a daily basis. Subway line 2 and 7 have an important role in changes. The effects or system changes, however. largely varied on location and subway line numbers.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

• IE interfaces
• /
• v.11 no.1
• /
• pp.183-190
• /
• 1998

This paper is concerned with the bicriteria vehicle routing problems with time window constraints(BVRPTW). The BVRPTW is to determine the most favorable vehicle routes that minimize the total vehicle travel time and the total customer wait time which are, more often than not, conflicting. We construct a linear goal programming (GP) model for the BVRPTW and propose a heuristic algorithm to relieve a computational burden inherent to the application of the GP model. The heuristic algorithm consists of a parallel insertion method for clustering and a sequential linear goal programming procedure for routing. The results of computational experiments showed that the proposed algorithm finds successfully more favorable solutions than the Potvin an Rousseau's method that is known as a very good heuristic for the VRPs with time window constraints, through the change of target values and the decision maker's goal priority structure.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.6
• /
• pp.617-623
• /
• 2014

The rapid urbanization in developing countries has caused trasportation problems that need to be solved. For that reason, the study evaluates the potential of cycling in the densely populated part of Kathmandu valley. Slopes and existing roads have been applied as the input cost rasters for finding the shortest cost routes between stations. By taking the average cycling velocity, time to travel from station to destination were compared with the average commuting time in the public transportation. The result comes out as similar time with the public transportation. Although the cycling seems potential replacement for public transportation commuters, in fact, there are some setbacks needed to be supported by the government to make it reality in future.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.249-263
• /
• 1997

This paper addresses the parts route selection and economic design in flexible manufactuirng system (FMS). Parts are processed through several stage workstations according to operation sequences. The machine of each workstation can do multiple operation functions. And the operation stage of a part can be processed in several workstations, which are non-identical in functional performance. The objective of this paper is to determine the processing routes of parts, number of machine at each workstation, number of vehicle and makespan time. Two models are suggested. One is assumed that the operation stage of parts can be processed at the only one among several available workstations. Other is assumed that the operation stage of parts is allowed to be processed at several workstations. Parts are transported by automated guided vehicles (AGVs). The decision criteria is to minimize the sum of processing cost, travel cost, setup cost and overhead cost. The formulation of models is represented. A solution algorithm is suggested, and a numerical example is shown.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.748-754
• /
• 2006

Small Rapid Transit System(SRTS) will be defined fully automated urban transit system providing a rapid and personalized door to door transport service. Conventional forms of public transit require passengers to collect in groups until a large vehicle is scheduled to travel on predetermined routes. In contrast, SRTS offers personal transport with no waiting, and takes passengers non-stop to their chosen destination. This is a transport system which is as convenient as, or in congested environments more convenient than, the car, but with minimal environmental impact. Accordingly the foundation study of choice system size for development of SRTS

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.10-13
• /
• 2010

컴퓨터의 활용이 다양해 지면서 예전과 다르게 다양한 이유로 많은 사람들이 여행을 하고 나서 여행에 대한 정보 블로그나 웹 상에 저장하고 공개한다. 이렇게 웹 상에 많은 양의 여행 관련 데이터가 존재함에도 불구하고 데이터들이 산발적으로 존재하고 체계적으로 데이터 베이스화 되어 있지 않아서 여전히 정보를 검색하고 여행 일정을 세우는 데에 많은 시간과 노력이 필요하다. 따라서 본 논문은 FP-tree 기반의 빈발 패턴 증가 기법을 이용한 여행 계획 수립 기법을 제안한다. 제안되는 기법에서 데이터들은 FP-tree 방식으로 저장되어 검색에 필요한 시간과 노력을 극적으로 줄이고, FP-growth 마이닝 기법을 이용해 효과적인 여행 경로를 선택할 수 있게 도와준다.