An improved mathematical formulation for the blocks relocation problem

Zehendner, Elisabeth; Caserta, Marco; Feillet, Dominique; Schwarze, Silvia; Voß, Stefan

doi:10.1016/j.ejor.2015.03.032

Cited by 70 publications

(40 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to deal with larger instances, the authors implemented a heuristic based on their formulation. All the methods proposed by Lee & Hsu (2007), Tierney et al (2016) and Tanaka & Tierney (2018) (2015) and Zehendner et al (2015) proposed corrections and improvements for the r-brp model presented by Caserta et al (2012). Galle et al (2018) recently put forward a new MIP formulation for the r-brp which explores a binary representation that was initially described on the work of .…”

Section: Related Workmentioning

confidence: 99%

“…We chose to write the objective function as the minimization of the number of relocations, as is done also by Caserta et al (2012). We do not consider in our brp comparisons the formulations for the r-brp, e.g., Zehendner et al (2015). As mentioned, the rbrp is a special case of the brp that incorporates more restrictive assumptions.…”

Section: Block Relocation Problemsmentioning

confidence: 99%

“…As for the brp, the quality of these bounds decreases as the height of the stacks increases. When compared to the literature, the best linear programming based formulation for the r-brp was proposed by Galle et al (2018), and is followed by Zehendner et al (2015), which is an improved version of the r-brp model of Caserta et al (2012). In both works, their implementation employs preprocessing mechanisms for eliminating variables.…”

Section: Block Relocation Problemsmentioning

confidence: 99%

See 2 more Smart Citations

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems

Silva

Toulouse

Calvo

2018

European Journal of Operational Research

View full text Add to dashboard Cite

Container terminals are exchange hubs that interconnect many transportation modes and facilitate the flow of containers. Among other elements, terminals include a yard which serves as temporary storage space. In the yard, containers are piled up by cranes to form blocks of stacks. During the shipment process, containers are carried from the stacks to ships following a given sequence. Hence, if a high priority container is placed below low priority ones, such obstructing containers have to be moved (relocated) to other stacks. Given a set of stacks and a retrieval sequence, the aim in the Pre-marshalling Problem (pmp) is to sort the initial configuration according to the retrieval sequence using a minimum number of relocations, so that no new relocations are needed during the shipment. The objective in the Block Relocation Problem (brp) is to retrieve all the containers according to the retrieval sequence by using a minimum number of relocations. This paper presents a new unified integer programming model for solving the pmp, the brp, and the Restricted brp (r-brp) variant. The new formulations are compared with existing mathematical models for these problems, as well as with other exact methods that combines combinatorial lower bounds and the branch-and-bound (B&B) framework, by using a large set of instances available in the literature. The numerical experiments * Corresponding author: Tel. +33 1 4940 4082.show that the proposed models are able to outperform the approaches based on mathematical programming. Nevertheless, the B&B algorithms achieve the best results both in terms of computation time and number of instances solved to optimality.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Block Relocation Problemsmentioning

confidence: 99%

Section: Block Relocation Problemsmentioning

confidence: 99%

See 1 more Smart Citation

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems

Silva

Toulouse

Calvo

2018

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…This new formulation, in comparison to the BRP-I [7], had the advantages of fewer decision variables and lower runtime. In a more recent paper, Zehendner et al [14] also found the incorrectness of BRP-II model proposed by [7]. As in [12], they rst corrected the BRP-II model and then improved it by removing super uous variables, tightening some constraints, introducing a new upper bound, and applying a pre-processing step to x several variables, which led to better computational e ciency.…”

Section: Introductionmentioning

confidence: 99%

Decreasing the Crane Working Time in Retrieving the Containers from a Bay

2017

View full text Add to dashboard Cite

KEYWORDSContainer terminal; Container retrieval problem; Heuristic; Branch and bound.Abstract. Given the initial layout of a container terminal with a bay, the container retrieval problem aims at obtaining a movement sequence for the crane to retrieve all the containers arranged in a pre-de ned order. In this study, we develop a computationally e cient heuristic, called constant summation (CSUM), to minimize the total working time of crane, required to retrieve all the containers from a given bay. Numerical results show that CSUM is very promising in dealing with the container retrieval problems and outperforms the best known approaches recently presented in the literature in terms of the crane's working time.

show abstract

“…Expósito‐Izquierdo, Melián‐Batista, and Moreno‐Vega () present an optimization model termed BRP‐II , which is proposed by Caserta, Schwarze, and Voß (). Zehendner, Caserta, Feillet, Schwarze, and Voß () correct the BRP‐II presented in Caserta et al () and improve the initial model formulation by removing superfluous variables, tightening some constraints, introducing a new upper bound, and applying a preprocessing step to fix several variables. Forster and Bortfeldt () present a heuristic tree search procedure for the CRP .…”

Section: Introductionmentioning

confidence: 99%

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

Zhu

Guo

et al. 2019

Naval Research Logistics

View full text Add to dashboard Cite

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.

show abstract

An improved mathematical formulation for the blocks relocation problem

Cited by 70 publications

References 17 publications

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems

Decreasing the Crane Working Time in Retrieving the Containers from a Bay

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

Contact Info

Product

Resources

About