Routing straddle carriers for the loading operation of containers using a beam search algorithm
Computers and Industrial Engineering
A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem
SIAM Journal on Optimization
Solving a Class of Linearly Constrained Indefinite QuadraticProblems by D.C. Algorithms
Journal of Global Optimization
Large-Scale Molecular Optimization from Distance Matrices by a D. C. Optimization Approach
SIAM Journal on Optimization
Hi-index | 0.00 |
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.