• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.250-251
• /
• 2023

The pallet, typically a form of tertiary packaging, is a flat structure used as a base for the unitization of goods in the supply chain. In addition, standard pallets such as T-11 and T-12 are used throughout the logistics industry to reduce the cost and enhance the efficiency of transportation. However, in the case of special cargo, it is impossible to handle such cargo using a standard pallet due to its size and weight, so many have developed and are now using their customized pallet. Therefore, this study suggests a pallet size optimization method to calculate the optimal pallet size, which minimizes the loss of space on a pallet. The main input features are the specifications and the storage quantity of each cargo, and the optimization method that has modified the Neighborhood Search Algorithm calculates the optimal pallet size. In order to verify the optimality of the developed algorithm, a comparative analysis has been conducted through simulation.

• Journal of Navigation and Port Research
• /
• v.27 no.3
• /
• pp.307-313
• /
• 2003

Off-line ship chartering is done nearly through the brokers. Because of the international scale of chartering market, brokers spend too much times and costs on searching the most appropriate product which the consumers want. In this research, we propose the on-line Charter Product Categorization Model to search the products efficiently in the Cyber Chartering System. This Model will make concerned parties of the ship chartering to get unified product information efficiently, and the select the most appropriate product. In this research, we classified the ship chartering products into categories of cargo, ship type, and sea routes, and defined mutual relation of each products, and we verified that this classification is necessary to search the products through the product searching experiment.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.744-751
• /
• 2012

Air Traffic Management(ATM) is to control air traffic flow quickly and safely. For efficient ATM, the ability which calculate optimal route using filight plan and filght information is required. Especially for the time-sensitive air cargo, it is essential. In this paper, therefore, we present a dynamic route search algorithm which calculate optimal route dynamically. The conventional method using Dijkstra algorithm has a problem that recalculate the entire route when some airways are closed. However, the proposed algorithm recalculates only affected waypoints, so it finds optimal route quickly and accurately. Comparisons with the conventional method and the proposed algorithm show that the proposed algorithm provides better.

• Journal of the Korean Institute of Navigation
• /
• v.18 no.3
• /
• pp.81-103
• /
• 1994

Increasing costs and competition in the global trade and transportation arena have led to a search for effient, cost-effective, particularly through the application of computer and information technologies. Most recently the introduction of Electronic Data Interchange(EDI) technologies in both trading and trade facili-tation activitiess have bagun to change the complextion of the international transport space. Korea as well as the other developing countries has become aware of the need to embrace EDI strate-gies in order to maintain a competitive market position with their more technologically advanced neighbou-ring and international trading partners. A way of EDI implementation, KMPA has invested large budgets in the research of the EDI since 1990. As the result of study in EDI of transport, KL-Net(Korea Logistics Network) was organized for the EDI business in cargo logistics. In spite of these KMPA's activities, the development plan of container logistics data interchange is not good and useful. So a new model of EDI in transportation is required by using the concepts of cargo data sharing. The purpose of this paper is to suggest a new way of container logistics data interchange model. This paper therefore analyze the information flow in the current container logistics and find the problem in the area to derive a new model. The followings are the results of this paper : (1) There are many problems and user's requirements in container logistics data interchange in Korea. (2) Many messages of UN/EDIFACT are able to be used in container logistics data interchange. (3) The container cargo data are stored in Container Logistics Network(CL-Net) database. And when necessary by requesting message transmission, the container logistics data interchange is possible. (4) Customs cargo clearance system and PORT-MIS can be linked to CL-Net. If the systems, however, are to introduce EDI in data interchange, the quality of user's software has to be assured.

• Journal of the Korean Institute of Navigation
• /
• v.7 no.2
• /
• pp.65-113
• /
• 1983

A lot of studies of ship's economy are on the traditional fields such asreducing propulsion resistance, raising cargo handling rates and lessening building consts, but there are few researches on the merchant ship's economy concerning their deadweights and speeds according to shipping companies managerial cercumstances. Contrary to the contemporary trend that "the bigger, the better, if the cargo handling rate could increased sufficiently to hold down port time to that rate of smmaler vessels", this paper demonstrates the existence of certain limits in ship's size and speed according to the coditions of the freight rates, voyage distances, cargo handing rates, prices of fuel oil, interst rates etc. Fom the curves of criteria contour for various ship's deadweights and speeds which are depicted from the gird search method, one can get the costs and the yearly profit rates under the conditiions of large volume with long term contracts for the transportation of bulk cargoes. In estimating ship's transportation economy, the auther takes the position that the profit rate method is properer than the cost method, and introduces the calculation table of the voyage profit rate index. The use of the criteria contours will be of help to ship owners in determining the size and speed of the ship which will be built or purchased and serve in a certain trade route.

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.17 no.4
• /
• pp.46-54
• /
• 1980

The ship structural design problem is formulated as a general nonlinear optimization problem with constraints. Characteristics of the general structural problems and various optimization techniques are discussed, with special emphasis on penalty function method for constrained problems. A simple example of the solution of a midship structure design of cargo vessel, which complies with the rules of the Korean Register of Shipping is shown using SUMT-exterior method with some search methods.

• 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.

• The Journal of Bigdata
• /
• v.7 no.2
• /
• pp.129-137
• /
• 2022

With the development of the 4th industry, the logistics industry is evolving into a smart logistics system. However, ship work that transports vehicles is progressing slowly due to various problems. In this paper, we propose an stowage automation algorithm that can be used for cargo loading of vehicle carriers that shortens loading and unloading work time. The stowage automation algorithm returns the shortest distance by searching for a loading space and a movable path in the ship in consideration of the structure of the ship. The algorithm identifies walls, ramps and vehicles that have already been shipped, and can work even with randomly placed. In particular, it is expected to contribute to developing a smart logistics system for vehicle carriers by referring to the ship's master plan to search for vehicle loading and unloading space in each port and predict the shortest movable path.