An Efficient Heuristic to Solve Vehicle Routing Problem for Container Shuttle Service

Shin, Jae Young; Oh, Sung Inn; Park, Jong Won

Journal of Navigation and Port Research 2009;33(8):583-588.
Published online October 30, 2009.

컨테이너 셔틀 서비스를 위한 차량 경로 문제의 근사적 해법

신재영, 오성인, 박종원

An Efficient Heuristic to Solve Vehicle Routing Problem for Container Shuttle Service

Jae Young Shin, Sung Inn Oh, Jong Won Park

Abstract

Generally, the container road transportation can be divided into three types; short distance, long distance and shuttle transportation. Specially, the shuttle service occurs several amounts of container which is same as O/D pairs. Also container vehicle can be divided into three types according to the chassis types of vehicle; only 20-feet container, only 40-feet container and combined chassis trailer. Combined chassis trailers can load two 20-feet containers or one 40-feet container. This paper deals with Vehicle Routing Problem (VRP) for delivering containers considering shuttle service. This problem is similar to the previously studied Shin and Oh (2008), but the characteristics of shuttle service must be considered additionally. We formulate the container shuttle transportation planning problem using combined chassis trailers based on VRP with pick-up and delivery which can visit each node more than one time, and propose an efficient solution procedure.

Key Words: container shuttle service;VRP;pick-up and delivery