• 한국IT서비스학회:학술대회논문집
• /
• 2003.05a
• /
• pp.215-221
• /
• 2003

In today's rapidly changing business environment, quality of responsiveness to customer requirements for short order cycles and on time delivery is becoming more important and considered as one of critical success factors in supply chain management. Yet despite its importance on reducing transportation cost and improving customer service, little attention has been given to the transportation planning system in Korea SI industry. In this paper, we present development of transportation planning system especially to deal with vehicle routing problem which has the goal to minimize the costs of daily transportation operation and to maximize customer delivery service. The system architecture with other enterprise application is presented and real-world constraints are well incorporated into the system by combining constraints programming and meta heuristics.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2006.10a
• /
• pp.240-257
• /
• 2006

In an effort to gain competitiveness, recently many companies are trying to outsource their logistics activities to the logistics specialists, while concentrating on their core and strategic business area. Because of this trend, the third party logistics comes to the fore, catching people's attention, and expanding its market rapidly. Under these circumstances, the third party logistics companies are making every effort to improve their logistics services and to develop an information system in order to enhance their competitiveness. In particular, among these efforts one of the critical parts is the decision support system for effective transportation network planning. To this end, this study has developed an efficient decision support system for an optimal transportation network planning by comprehensively considering the transportation mode, routing, assignment, and schedule. As a result of this study, the new system enables the expansion of the third party logistics companies' services including the multimodal transportation, not to mention one mode of transportation, and also gets them ready to plan an international transportation network.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.195-208
• /
• 2009

A network design problem (NDP) formulated as a mathematical program is generally used to find an optimum value to minimize or to maximize some objectives such as total travel time, social benefit, or others. NDP has, however, some limits of describing components of travel patterns like activities and trip generation due to its modeling simplicity, and also it has difficulty in including attributes of regional planning. In order to cope with such limits, this paper extends NDP to the urban planning field and proposes a mathematical program which can describe the interactions between urban social activities and transportation planning. Based on this model the authors try to optimize both urban activities and the transportation system. The model developed in this paper is tested to assess its application with a real-size regional transportation network.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.147-163
• /
• 1994

This paper presents three methods of generating the transportation network data out of the topological geographic database in the hope that the conversion of the geographic database file containing the topology to the conventional node-link type trans¬portation network file may facilitate the integration between transportation planning mod¬els and GIS by alleviating the inherent problems of both computing environments. One way of the proposed conversion method is to use the conversion software that allows the bi-directional conversion between the UTPS (Urban Transportation Planning System) type transportation planning model and GIS. The other two methods of data structure conversion approach directly transform the GIS's user-level topology into the transportation network data topology, and have been introduced with codes programmed with FORTRAN and AML (Arc Macro Language) of ARC/INFO. If used successfully, any approach would not only improve the efficiency of transportation planning process and the associated decision-making activities in it, but enhance the productivity of trans¬portation planning agencies.

• IE interfaces
• /
• v.16 no.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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.166-174
• /
• 2016

In this paper, we developed a mixed-integer linear programming model for transportation planning of athletes in sports events. The transportation planning of athletes involves finding the lowest-cost and fastest-time plan for distributing athletes from multiple accommodation to stadium. The decision variables associate with the number of driving events, and the total transportation cost is the objective function that needs to be minimized. The proposed method uses mixed integer linear programming to solve transportation problem, thus the global optimality is guaranteed. In order to verify the effectiveness of proposed method, we performed simulation and built the sports event management service platform (SEMSP) for transportation planning.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.2
• /
• pp.177-185
• /
• 2016

In this paper, an optimal planning system for operating transporters in shipyard is developed. The system is designed to utilize the geometries of shipyard, and manage the data of blocks and transporters directly. There are four major menus such as shipyard map management based on GIS, block transportation request, transporter management, and optimal transportation planning in the system. The geometries and properties of the shops, roads, and addresses are manipulated in the shipyard map management menu. The block transportation requests and the properties of transporters are managed in the block transportation request and transporter management menus, respectively. The optimum transportation is planned automatically for minimizing the unload times of the transporters, and the optimum transportation plans are confirmed and printed to the transporter drivers. The effectiveness of the system was verified through the application to a large-sized shipyard.

• Journal of Information Technology Applications and Management
• /
• v.9 no.4
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

• Journal of the Society of Naval Architects of Korea
• /
• v.50 no.5
• /
• pp.298-306
• /
• 2013

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.191-194
• /
• 2001

We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.