Research on Agent System for Dynamic Maritime Transportation Planning

Published on Dec 31, 2012in Journal of Information Systems1.7
· DOI :10.5859/KAIS.2012.21.4.185
Moo-Hong Kang2
Estimated H-index: 2
,
Hyung Rim Choi11
Estimated H-index: 11
,
Sung-kwan Kim3
Estimated H-index: 3
Source
Abstract
The most of international shipping cargoes are transported by ship and the shipping market has been continuously increasing. However, due to the recent global recession, the volume of trade decreased accordingly, and the competition between shippers to gain a competitive advantage in the shipping market continues deepening. To do this, researches on transportation costs savings as well as ways to improve customer service are needed and recently related researches are being pursued. Car carriers which transport more than 80% of car import and export volume in the world also make a lot of effort in order to reduce transportation costs, but in contrast related researches are seldom fulfilled. In this study, we developed an agent system that supports the efficient transportation of car carriers plan so that the car carriers can increase competitiveness through reduction of the logistics costs. To make this, we researched an algorithm for maritime transportation planning, and also developed a prototype of an agent system which can collect the necessary information in real time and establish a dynamic plan.
📖 Papers frequently viewed together
2008
4 Authors (Hyung-Rim Choi, ..., Jae-Un Jung)
References10
Newest
#1Junbo Jia (Chalmers University of Technology)H-Index: 5
o reduce the area on deck occupied by each car and the labour and time required for lashing and unlashing cars, it has been proposed by the author that in some conditions, cars on decks could be transported without lashing. To evaluate cargo securing based on this "lashing-free" concept, computational code was developed to calculate the vehicle-deck interactions for various ship motions. The code was structured by incorporating a vehicle model into a piece of ship motion calculation code. A seri...
Source
#1Byung Joo Park (Dong-a University)H-Index: 7
#2Hyung Rim Choi (Dong-a University)H-Index: 11
Last. Moo Hong Kang (Dong-a University)H-Index: 5
view all 3 authors...
Companies are pursuing a new approach through which overall functions within a supply chain, ranging from material purchase to production, distribution, and sales are designed, planned, and managed in an integrated way. The core functions among those functions are production planning and distribution planning. In this paper, we propose a multi-agent system and genetic algorithm that make it possible to integrate the production and distribution planning on a real-time basis in supply chain manage...
Source
#1Marielle Christiansen (NTNU: Norwegian University of Science and Technology)H-Index: 35
Publisher Summary This chapter discusses various aspects of maritime transportation operations and presents associated decision-making problems and models with an emphasis on ship routing and scheduling models. The chapter describes prescriptive operations research (OR) models and associated methodologies, rather than descriptive models that are usually of interest to economists and public policy makers. The ocean shipping industry has a monopoly on transportation of large volumes of cargo among...
Source
#1David Z. Zhang (University of Exeter)H-Index: 29
#2Anthony Anosike (University of Exeter)H-Index: 11
Last. Oluwaremilekun Mowanuola Akanle (University of Exeter)H-Index: 1
view all 4 authors...
A major problem facing manufacturing organisations is how to provide efficient and cost-effective responses to the unpredictable changes taking place in a global market. This problem is made difficult by the complexity of supply chain networks coupled with the complexity of individual manufacturing systems within supply chains. Current systems such as manufacturing execution systems (MES), supply chain management (SCM) systems and enterprise resource planning (ERP) systems do not provide adequat...
Source
#1Weiming Shen (National Research Council)H-Index: 60
#2Qi Hao (National Research Council)H-Index: 17
Last. Douglas H. Norrie (U of C: University of Calgary)H-Index: 31
view all 4 authors...
Abstract Agent technology has been recognized as a promising paradigm for next generation manufacturing systems. Researchers have attempted to apply agent technology to manufacturing enterprise integration, enterprise collaboration (including supply chain management and virtual enterprises), manufacturing process planning and scheduling, shop floor control, and to holonic manufacturing as an implementation methodology. This paper provides an update review on the recent achievements in these area...
Source
#1Sin C. Ho (University of Bergen)H-Index: 15
#2Dag Haugland (University of Bergen)H-Index: 16
Abstract The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. In this paper, we study a variant of the general VRP, VRP with time windows and split deliveries (VRPTWSD). Time constrained routing is relevant for applications where a schedule has to be followed. The option of splitting a demand makes it possible to service a customer whose ...
Source
#1Byung Joo Park (Dong-a University)H-Index: 7
#2Hyung Rim Choi (Dong-a University)H-Index: 11
Last. Hyun Soo Kim (Dong-a University)H-Index: 11
view all 3 authors...
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetics algorithm to address JSSP. We design a scheduling method based on Single Genetic Algorithm (SGA) and Parallel Genetic Algorithm (PGA). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, the initial population is generated through integ...
Source
#1Barrie M. Baker (Coventry University)H-Index: 9
#2M. A. Ayechew (Coventry University)H-Index: 1
This study considers the application of a genetic algorithm (GA) to the basic vehicle routing problem (VRP), in which customers of known demand are supplied from a single depot. Vehicles are subject to a weight limit and, in some cases, to a limit on the distance travelled. Only one vehicle is allowed to supply each customer.The best known results for benchmark VRPs have been obtained using tabu search or simulated annealing. GAs have seen widespread application to various combinatorial optimisa...
Source
#1Klaus Turowski (Otto-von-Guericke University Magdeburg)H-Index: 16
Abstract The Internet has created a tremendous opportunity to conduct business electronically. Innovative business concepts like virtual enterprises, supply chain management, one-to-one marketing, and advanced competitive strategies such as mass customization (MC) are supported by the Internet. In this paper, an approach is proposed to support distributed, logically integrated inter-company business processes, wherein complex and hard to standardize data occur, by applying e-commerce techniques ...
Source
The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park, June 4–6, 1979.
Source
Cited By0
Newest
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.