Single straddle carrier routing problem in port container terminals: mathematical model and solving approaches
by Babacar Mbaye Ndiaye; Hoai An Le Thi; Tao Pham Dinh
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 6, No. 6, 2012

Abstract: This paper treats the problem of routing straddle carriers during the loading operations of export containers. The straddle carrier (SC) travel distance will be much longer if two consecutive containers must be collected far from one another instead of from consecutive yard-bays. So, finding the minimum straddle carrier travel distance will guarantee port efficiency and allow cost savings. Our objective is to minimise the total travel distance of a straddle carrier. A SC performs a so called partial tour to pick-up containers of a same group, according to the work schedule. This problem is formulated as a mixed-integer linear programming problem, which is hard to solve optimally. In this paper, we reformulate the problem, thanks to exact penalty techniques in DC programming, as a continuous polyhedral DC programme. A combination of the local algorithm DCA and a global optimisation approach based on cutting plane techniques is proposed. Our algorithm, consisting in solving a finite number of linear programmes, converges to a global solution. Computational experiments indicate its efficiency.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com