Hyung Rim Choi

Learn More
This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto(More)
Recently, the port logistics market is rapidly expanding, along with the active maritime trade. To adjust to this trend and gain a competitive advantage, competition among shipping companies at home and abroad has intensified, and many efforts are being made for the improvement of customer services and cost saving. In particular, car carriers transporting(More)
In an effort to composite an optimal supply chain, this study has introduced an agent-based negotiation model as a method for assigning a lot of orders to a large number of participants. As a resources allocation mechanism to form strategic cooperation based on information sharing between supply chain members, this agent negotiation model provides such(More)
Today, there are several markets in cyber space where companies trade electronically due to the development of Information Technology. On the other hand, the most important thing in trades is negotiation. So, in order to support current business practices as well as new ones on the Internet, electronic commerce systems need an ability to negotiate. In this(More)
The major characteristics of ERP (Enterprise Resource Planning) are an enterprise-wide system that covers all the business functions and information resources, integrated database, built-in best industry practice, packaged software and open architecture. ERP enables reduction of system development time, flexibility, standardization of workflow and effective(More)
Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale.(More)
The School Bus Routing Problem (SBRP) covers the issue of establishing plans to efficiently transport students distributed across a designated area to the relevant schools using defined resources. As with the similar Vehicle Routing Problem (VRP), the SBRP may have diverse constraints such as heterogeneous vehicles, the allotted time window and multiple(More)