• 경영과학
• /
• 제28권3호
• /
• pp.1-13
• /
• 2011

Hub-and-spoke transportation network is a powerful and useful network structure that takes full advantage of economies of scale on routes between hubs. In recent studies, the network structure is extended to hybrid hub-andspoke that allows direct transportation between spokes. In this study, we considered more extended network structure which is called hybrid multiple hub-and-spoke that has multiple hubs and allows direct transportation between spokes. We developed a mathematical optimization model for automotive service parts transportation planning under hybrid multiple hub-and-spoke network structure. The model suggests a long-term transportation route planning and a short-term vehicle assignment planning. The model is verified by simulation and validated in real world application to Hyundai Mobis automotive service parts transportation planning. From the simulation result, the model reduced the transportation cost about 24.7%, the total distance about 6.8% and the CO2 emissions about 8.8%. In real world application for 6 months from July to December 2010, the model reduced the transportation cost about 9.1% by changing the long-term transportation route without daily vehicle assignment planning.

• 산업경영시스템학회지
• /
• 제27권2호
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• 산업공학
• /
• 제20권2호
• /
• pp.204-215
• /
• 2007

This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.

• 한국항만경제학회지
• /
• 제22권1호
• /
• pp.175-198
• /
• 2006

This paper presents a network capacity model that can be used as an analytical tool for strategic planning and resource allocation for multimodal transportation systems. In the context of freight transportation, the multimodal network capacity problem (MNCP) is formulated as a mathematical model of nonlinear bi-level optimization problem. Given network configuration and freight demand for multiple origin-destination pairs, the MNCP model is designed to determine the maximum flow that the network can accommodate. To solve the MNCP, a heuristic solution algorithm is developed on the basis of a linear approximation method. A hypothetical exercise shows that the MNCP model and solution algorithm can be successfully implemented and applied to not only estimate the capacity of multimodal network, but also to identify the capacity gaps over all individual facilities in the network, including intermodal facilities. Transportation agencies and planners would benefit from the MNCP model in identifying investment priorities and thus developing sustainable transportation systems in a manner that considers all feasible modes as well as low-cost capacity improvements.

• 대한교통학회지
• /
• 제5권1호
• /
• pp.47-58
• /
• 1987

A commodity distribution problem with intertemporal storage facilities and dynamic transportation networks is proposed. mathematical integer programming methods and multiobjective programming techniques are used in the model formulation. Dynamic characteristics of commodity distribution problems are taken into account in the model formulation. storage facility location problems and transportation link addition problems are incorporated into the intertemporal multicommodity distribution problem. The model is capable of generating the most efficient and rational commodity distribution system. Therefore it can be utilized to provided the most effective investment plan for the transportation infrastructure development as well as to evaluate the existing commodity distribution system. The model determines simultaneously the most efficient locations, sizes, and activity levels of storage facilities as well as new highway links. It is extended to multiobjective planning situations for the purpose of generating alternative investment plans in accordance to planning situations. sine the investment in transportation network improvement yields w\several external benefits for a regional economy, the induced benefit maximization objective is incorporated into the cost minimization objective. The multiobjective model generates explicitly the trade-off between cost savings and induced benefits of the investment in transportation network improvement.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.36-45
• /
• 1993

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 production company in a international economic zone. An example is provided to validate the heuristic procedure developed.

• 산업공학
• /
• 제16권2호
• /
• pp.174-184
• /
• 2003

This paper addresses a fleet operation planning problem for a static freight container transportation system in which all the transportation requirements are predetermined at the beginning of a planning horizon. In the transportation system under consideration, a number of loaded containers are to be moved between container storage yards. An optimal fleet planning model is used to determine the minimum number of vehicles required. Based on the results from the optimal model, a tabu-search based algorithm is presented to perform a given transportation requirements with the least number of vehicles. The performance of the new procedure is evaluated through some experiments in comparison with two existing methods, and the it is found that our procedure produces good-quality solutions.

• 대한교통학회지
• /
• 제27권5호
• /
• pp.195-208
• /
• 2009

일반적으로 교통망 설계문제는 특정 목적함수를 최소 또는 최대화시키는 도로의 용량이나 대중교통망 노선과 같은 교통망의 속성 값을 구하는 문제이다. 이는 수리적인 모형으로 표현되며, 수학적으로 해결 가능한 문제로 구성되기 위해 실제 교통망에서 발생하는 복잡한 현상들을 최대한 단순화하여 고려하게 된다. 이에 따라 통행수요의 근본적인 동기가 되는 활동수요의 발생과정을 고려하지 못하고, 교통패턴에 큰 영향을 미치는 요인 중 하나인 지역계획 측면의 속성변화를 분석의 틀에 포함시킬 수 없다는 한계가 있다. 본 연구에서는 이러한 한계를 극복하고자 교통망 설계문제를 도시계획 (Urban planning) 범위로 확장한다. 즉, 토지이용 계획과 같은 교통망 계획의 상위에 위치한 계획 속성을 변경했을 때 도시 내의 활동 및 교통 패턴이 어떻게 변화하는지를 모형을 통해 예측하고, 이를 기반으로 도시의 지역 및 교통시스템을 최적화시키는 모형을 제시한다. 본 연구에서 개발된 모형을 실제크기의 지역교통망에 적용해 모형의 실제 적용가능성을 실험하였다.

• 대한교통학회지
• /
• 제23권5호
• /
• pp.65-71
• /
• 2005

지역유형(area type)은 물류수요의 잠재력(potential)과 밀접한 관련이 있다. 물류계획분야에서 지역유형 변수는 특히 발생모형(generation model)에서 물류유입(freight attraction)을 설명하는 모형변수로, 또한 수송수단선택모형(mode choice model)의 모형변수로 포함되는 것이 최근 선진국의 물류계획 실무분야에서 일반적인 추세이다. 하지만 지역유형은 그 동안 개념적으로 명확히 정의되지 못하였으며, 분석모형의 맥락에서 지역유형의 계량적 추정을 다룬 선행연구는 거의 없었다고 할 수 있다. 이런 이유 때문에 중/장기 물류수요예측 및 물류계획에 있어서 인구와 고용의 변화가 지역유형을 어떻게 변화시킬지에 관한 장기적인 예측을 하는 것이 어려웠다. 따라서 본 연구는 물류시설 SOC사업의 성공적 추진을 위하여 물류수요예측의 신뢰수준을 제고하는 데 있어 꼭 필요하고 시급한 연구로서 지역유형(area type)을 고려한 물류수요의 잠재력(potential)분석 방법을 제시하였다.

• 전자공학회논문지
• /
• 제53권11호
• /
• pp.166-174
• /
• 2016

본 논문에서는 스포츠 이벤트에서 선수단 수송 계획을 위한 혼합 정수 선형 계획법 모델을 제안하였다. 선수단 수송 계획은 선수단을 다수의 숙소에서 경기장까지 최소의 비용과 빠른 시간 계획을 찾는 것이다. 운행 회수를 의사결정 변수로 하고, 전체 수송비용은 최소가 되어야 하는 목적함수가 된다. 제안한 방법은 혼합 정수 선형 계획법을 이용하여 전역 최적점을 찾을 수 있는 장점이 있다. 제안한 방식의 유용성을 확인하기 위해서 시뮬레이션을 수행하고 스포츠 이벤트 관리 서비스 플랫폼(SEMSP)에서 수송 계획을 구축하였다.