• 한국컴퓨터정보학회논문지
• /
• 제20권6호
• /
• pp.51-58
• /
• 2015

본 논문은 불완전 비용 리스트를 가진 대규모 운송 문제의 최적 해를 O(mn) 수행 복잡도로 구하는 배정-교환 알고리즘을 제안한다. 완전 비용 리스트를 가진 운송 문제의 해는 일반적으로 TSM을 적용한다. 그러나 대규모 운송 문제에 대해 TSM을 적용하는데 문제가 있으며, 특히 불완전 비용 리스트를 가진 경우에는 TSM으로 풀기에는 더욱 더 어려움이 가중된다. 따라서, 실무분야 전문가들은 상용화된 선형계획법 패키지를 단순히 활용한다. 제안된 알고리즘은 첫 번째로, 운송비용 오름차순으로 운송량을 배정하는 전략을 수행하였다. 이 결과 공급 여유량을 가진 지역으로 부터 요구량을 충족시키지 못하는 지역에 배정량을 조정하였다. 두 번째로, 2-opt와 1-opt의 교환 최적화 전략을 수행하여 최적 해를 구하였다. 제안된 방법을 $31{\times}15$ 불완전 비용 행렬 문제에 적용한 결과, 배정-교환 방법이 상용 선형계획법 패키지인 LINGO의 해를 보다 개선하는 효과를 보였다.

• 한국콘텐츠학회논문지
• /
• 제10권12호
• /
• pp.254-266
• /
• 2010

본 연구는 천안시를 대상으로 도시교통문제를 다루었다. 본 연구는 문헌조사와 실증조사를 병행하였다. 회수된 설문지 394부를 SPSS 15.0버전으로 빈도분석을 실시하였다. 천안시의 도시교통문제는 출 퇴근시의 교통체증 현상, 대중교통의 불편, 주차문제, 자동차로 인한 대기오염, 교통사고로 인한 불안 등을 들 수 있다. 교통문제의 개선방안으로는, 첫째, 합리적 교통수요의 관리에 따른 교통체계의 개선방안이 마련되어야 한다. 둘째, 천안시는 대중교통의 이용대상인 대학생이 많으므로 대학생을 대상으로 할인을 적용 대중교통 이용률을 높여야 한다. 셋째, 대중교통중심체제의 강화 및 개선을 통한 교통체증의 해결이 필요하다. 넷째, 도로 등 교통시설의 공급확대, 가로망체계 정비 및 신호운영체계의 개선을 적극적으로 추진해 나가야 한다. 특히 천안에는 오래된 도로의 정비가 필요하고 도로망이 복잡하게 얽혀있는데 이를 간단하게 개선함으로써 보다 접근성이 좋아질 것이다. 다섯째, 주차문제의 해결과 이용자들의 교통질서 의식함양 등 선진 교통문화의 정착이 필요하다.

• 한국국방경영분석학회지
• /
• 제10권2호
• /
• pp.43-49
• /
• 1984

This paper deals with a transportation problem with two objectives, that is, transportation cost and vital-route shipment. In the transportation problem minimizing cost is sometimes conflicting minimizing vital-route shipment. This paper develops an algorithm finding paneto-optimal solutions in minimizing vital-route shipment and cost, and also presents theoretical backgrounds for developing an algorithm.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 춘계학술대회
• /
• pp.345-360
• /
• 2008

The analytic hierarchy process is known as a useful tool for the group decision making methods. This tool has been area such as investment, R&D management, manufacturing, production and marketing. Typically, transportation problems have addressed by mathematical programming. In this paper, an optimal solution of transportation problem was determined by the analytic hierarchy process.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.11-25
• /
• 2006

Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

• 한국경영과학회지
• /
• 제24권4호
• /
• pp.63-80
• /
• 1999

In the container transportation of inland depots the empty container is an important issue. The truck dispatching problem in this paper is considered under restriction about empty containers. When a full container arrives in a depot by truck, after unloading operation the full container is changed to an empty container. After loading operation an empty container is changed to a full container. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We would like to find the truck dispatching method minimizing empty truck movements and empty container movements. In this paper, a mixed integer programming model is developed to obtain the optimal truck dispatching in container transportation and heuristic is developed to give a good solution in much shorter time. The numerical examples are studied and the proposed heuristic is also compared with the result of numerical examples.

• 대한산업공학회지
• /
• 제28권1호
• /
• pp.105-111
• /
• 2002

When transporting multiple items by trucks of various size, one needs to assign a group of items to each truck so as to minimize the total cost, while meeting the weight and volume constraint of each truck. In this paper, we formulate the problem as an integer programming problem and propose four heuristic algorithms for the problem. Computer simulation is used to evaluate the average performance of the four heuristic algorithms for the consolidated transportation problem.

• 한국산업융합학회 논문집
• /
• 제13권1호
• /
• pp.5-13
• /
• 2010

Industrialization and urbanization occurred-traffic delay, traffic accident and parking problem etc.-variety of transportation problems. Parking problem is one of the transportation problem then transportation engineers would get involved in trying to solve parking problem. A way to overcome a variety of parking problems needs preliminary data for conditions of parking but it lacks the preliminary data to do so. Thus this study analyzed a characteristic of a parking through a field survey for parking in Daegu Metropolitan City. This study analyzed parking characteristic of parking operation method. This study result reveals difference between a toll parking and a no charge parking characteristic. Thus a close examination for a toll parking characteristic and a no charge parking characteristic is a prerequisite for a rational parking policy.

• 한국경영과학회지
• /
• 제33권4호
• /
• pp.53-61
• /
• 2008

Recently, Ertogral et al.[2] suggested two models considering the transportation cost based on single-vendor single-buyer integrated production-inventory problem. Although their problem-solving algorithm guarantees solutions obtained are optimal, a limitation is revealed that its performance can be inefficient due to complete enumeration search in a certain range. In this paper, a more efficient algorithm in finding optimal solutions is suggested for the same problem suggested by Ertogral et at.[2]. Numerical examples are presented for illustrative purpose.

• Industrial Engineering and Management Systems
• /
• 제12권2호
• /
• pp.161-170
• /
• 2013

Deployment of green transportation in reverse logistics is a key issue for low carbon technologies. To cope with such logistic innovation, this paper proposes a hybrid approach to solve practical vehicle routing problem (VRP) of pickup type that is common when considering the reverse logistics. Noticing that transportation cost depends not only on distance traveled but also on weight loaded, we propose a hierarchical procedure that can design an economically efficient reverse logistics network even when the scale of the problem becomes very large. Since environmental concerns are of growing importance in the reverse logistics field, we need to reveal some prospects that can reduce $CO_2$ emissions from the economically optimized VRP in the same framework. In order to cope with manifold circumstances, the above idea has been deployed by extending the Weber model to the generalized Weber model and to the case with an intermediate destination. Numerical experiments are carried out to validate the effectiveness of the proposed approach and to explore the prospects for future green reverse logistics.