[논문]컨테이너선의 경로를 고려한 공 컨테이너의 분배 문제에 대한 연구

신상훈; 문일경

컨테이너선의 경로를 고려한 공 컨테이너의 분배 문제에 대한 연구
Empty Containers Distribution Problem considering the Container Ship Route 원문보기

대한산업공학회지 = Journal of the Korean Institute of Industrial Engineers, v.35 no.1, 2009년, pp.92 - 100

Abstract ▼ AI-Helper

Today international trade through maritime transportation is significantly increasing. Due to this increase, shipping companies are faced with problems concerning the repositioning of empty containers from import dominant ports. The liner shipping service network has been provided to transport containers which load customers' freights. Container ships are moved on the liner shipping service network by observing the predetermined route and transportation time. This research deals with the empty containers distribution problem considering the container ship route. A mathematical model based on the mixed integer program has been introduced in this study. The objective is to minimize the total relevant costs of empty containers such as handling, leasing, and inventory holding, etc. Due to the complexity of the problem, a genetic algorithm has been suggested to solve large sized problems within a reasonable time. Numerical experiments have been conducted to show the efficiency of the genetic algorithm.

주제어

AI 본문요약
AI-Helper

* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.

문제 정의

This research has dealt with an empty containers distribution problem considering the container ship route. A mathematical model and a genetic algorithm have been developed and a number of numerical examples have been solved to evaluate their performances.

가설 설정

At period 4, 100 empty containers are transported from port 4 to port 2 by using route 2. There are 900 empty containers being transported from port 6 to port 3 and 100 empty containers are moving from port 5 to port 3 using route 3. The container ship has a limitation of capacity, and consequently fewer containers are moving from port 5.
(1989) introduced the multi commodity location problem with balancing requirements. The study considered balancing movements of empty containers among depots with empty containers supply and demand. Crainic and Delorme (1993) extended Crainic et al.
ⅶ) We consider one container ship on each route.
ⅸ) The unloaded full containers are changed into empty containers within the devanning time.

제안 방법

In order to choose the appropriate parameter values in our genetic algorithm for the distribution of empty containers considering container ship route with the objective of minimizing the relevant cost, the above mentioned crossover operator, mutation operator, and cloning were employed with the following parameters.
There are several methods for selection such as a roulette wheel, tournament, ranked selection, etc. In this research, we use the ranked selection and the roulette wheel selection. The roulette wheel selection is a genetic operator for selecting potentially useful solutions for recombination.
Gendron and Crainic (1997) introduced a parallel branch and bound algorithm for a multi commodity location problem considering balancing requirements. They formulated a mathematical model and developed a branch and bound based heuristic with a flip flop procedure.
(2006) focused on a fleet management problem in an inland situation. They modeled an integer program and the proposed solution approach was based on the decomposition in three simpler sub problems associated with resource assignment costs, routing costs, and the container repositioning costs considered. Hossein et al.

참고문헌 (14)

Crainic T. G., Dejax P. and Delorme L. (1989), Models for multimode multicommodity location problems with interdepot balancing requirements, Annals of Operations Research, 18, 279-302
Crainic T. G. and Delorme L. (1993), Dual ascent procedures for multicommodity location allocation problems with balancing requirements, Transportation Science, 27(2), 90-101

상세보기
Crainic, T. G., Gendreau, M., Soriano, P., Toulouse M. (1993), A tabu search procedure for multicommidity location/allocation with balancing requirements, Annals of Operations research, 41, 359-383

상세보기
Gen, M. and Cheng, R. (1997), Genetic Algorithm and Engineering Design, (New York : Wiley)
Gendron B. and Crainic T. G. (1997), A parallel branch and bound algorithm for multicommodity location with balancing requirements, Computers and Operations Research, 24, 829-847

상세보기
Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, (Addison Wesley)
Hossein J., Anastasios C., Petros I. (2006), Port dynamic empty container reuse, Transportation Research Part E, 42, 4360
Koichi S., Akio I., Etsuko N., Stratos P. (2007), The container shipping network problem with empty container repositioning, Transportation Research Part E, 43, 39-59

상세보기
Li, J. A., Leung, S. C., Wu, Y., Liu, K. (2007), Allocation of empty containers between multi-ports, European Journal of Operational Research, 182, 400-412

상세보기
Li, J. A., Liu, K., Leung, S. C., Lai, K. K. (2004), Empty container management in a port with long-run average criterion, Mathematical and Computer Modeling, 40, 85-100

상세보기
Luca C., Raffaele P., Walter U. (2006), Minimizing fleet operating costs for a container transportation company, European Journal of Operational Research, 171, 776-786

상세보기
Shen, W.S., Khoong, C. M. (1995), A DSS for empty container distribution planning, Decision Support Systems, 15, 75-82

상세보기
Wan K. and Levary R. R. (1995), A linear-programming based price negotiation procedure for contracting shipping companies, Transportation Research A, 29(3), 173-186

상세보기
Hyundai Merchant Marine co., Ltd, HMM. (2008), http://www.hmm21.com

저자의 다른 논문 :

LOADING...

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증