IMPLEMENTATION OF A COMBINATORIAL AUCTIONING ALGORITHM FOR OPTIMAL DYNAMIC YARD SPACE ALLOCATION IN A CONTAINER PORT

Abstract

We deal with the cluster opening problem in yard planning from an auction-bidder point of view. The main problem is to allocate clusters dynamically for keeping containers of loading vessels given the number and other properties of the clusters to be opened. The loading vessels act as bidders in our problem and they bid for resources modeled on Slots properties and the conflict in the yard. Almost half of the project involves data handling. Input data is converted into xml format and then an xml parser is being built. The other half involves building the framework for the bidder model and finally integrating it with the already available auctioning framework. This was followed by proposing a solution of the problem based on exhaustive search based method.