Article
Management
Bo Jin, Shunji Tanaka
Summary: This study develops an efficient algorithm for solving a practical variant of the container relocation problem, and demonstrates its superior performance through computational experiments.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Tiziano Bacci, Sara Mattia, Paolo Ventura
Summary: The container relocation problem involves finding the minimum number of moves to retrieve all containers in a bay according to a given order, with the stochastic variant considering uncertain retrieval orders. Existing solution approaches often face complexity issues, where solutions grow exponentially with block numbers. A new heuristic approach is proposed to reduce solution space complexity and successfully solve previously unsolvable instances. Performance statistics demonstrate the impact of instance size on solution outcomes.
Article
Computer Science, Artificial Intelligence
Marko Durasevic, Mateja Dumic
Summary: This paper investigates the application of genetic programming to automatically design effective relocation rules, which outperform manually designed rules and demonstrate good generalization performance across unseen problems, presenting a viable alternative to existing manual designs in the area of container relocation problems.
APPLIED SOFT COMPUTING
(2022)
Article
Chemistry, Multidisciplinary
Marko Gulic, Livia Maglic, Tomislav Krljan, Lovro Maglic
Summary: Maritime transport is vital for international trade, with seaports playing a crucial role. The increasing importance of container transport in maritime trade has led to the need for efficient container retrieval. This paper focuses on the optimization problem of container relocation in container yards, proposing a new method that utilizes a genetic algorithm to minimize the number of relocations. The method proves to outperform various existing models in resolving the container relocation problem.
APPLIED SCIENCES-BASEL
(2022)
Article
Economics
Bo Jin, Zhishan Yu, Mingzhu Yu
Summary: This study addresses the inbound container remarshaling problem in an automated container terminal and proposes two new integer linear programming models that outperform existing models. One of the models demonstrates high computational efficiency and can obtain optimal solutions in just a few hundred milliseconds.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2022)
Article
Green & Sustainable Science & Technology
Yujian Song, Yuting Zhang, Wanli Wang, Ming Xue
Summary: This paper addresses the drop-and-pickup container drayage problem with empty container constraints. A branch and price algorithm is proposed to solve the formulated mixed-integer linear program effectively, achieving significant efficiency and cost savings compared to CPLEX. The experimental results also demonstrate the increasing benefit of the drop-and-pickup mode with higher customer density and fixed cost.
Article
Economics
Tiago A. Santos, P. Martins, C. Guedes Soares
Summary: This paper presents a mathematical model for calculating the generalized costs of transporting containers and applies it in a case study on the consequences of terminal relocation in the port of Lisbon. The model shows significant implications on the delimitation of container terminal potential hinterlands across southern Portugal. Conclusions and policy recommendations are made regarding the relative competitiveness and suitability of the relocation.
JOURNAL OF TRANSPORT GEOGRAPHY
(2021)
Article
Management
Yifu Li, Xiangtong Qi
Summary: In the service industry, the perception of a service bundle by customers depends not only on the utility of each activity but also on the sequence of activities. This presents an opportunity for service providers to optimize service bundles by manipulating activities and their sequence.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Yu Cao, Ang Yang, Yang Liu, Qingcheng Zeng, Qiang Chen
Summary: This study focuses on the bidirectional transportation mode of automated guided vehicles (AGVs) and the conflict-free routing problem. A bi-level mixed integer programming model and a bi-level differential evolution algorithm based on dynamic routing approach were proposed. The results of numerical experiments validate the effectiveness of the bidirectional transportation mode and algorithm.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Engineering, Multidisciplinary
Sumin Chen, Qingcheng Zeng
Summary: This study explores the ERTG scheduling problem in container terminal yards, converting it into a SVRPSTW and formulating it as a mixed integer linear programming model. A column generation algorithm is employed to solve the problem, with a hybrid acceleration strategy combining label-setting and tabu search algorithms. The proposed method provides an efficient tool for carbon-efficient scheduling of ERTGs, contributing to the development of green ports.
ENGINEERING OPTIMIZATION
(2022)
Article
Operations Research & Management Science
Cheng Lu, Zhibin Deng
Summary: The paper presents an efficient branch-and-bound algorithm to solve the max-k-cut problem, introducing a semidefinite relaxation method that is better suited for the framework. The algorithm utilizes the unique structure of the proposed relaxation and applies a branching method different from existing algorithms.
JOURNAL OF GLOBAL OPTIMIZATION
(2021)
Article
Computer Science, Artificial Intelligence
Hu Wang, Hui Li, Meng Wang, Jiangtao Cui
Summary: Facility Relocation (FR) has a significant impact on many areas, but existing solutions fail to guarantee the quality of relocating multiple facilities. We propose a transformation approach to solve the k-FR problem by converting it into a submodular and non-decreasing facility placement problem. We present the first approximate solution, FR2FP, and further improve it with FR2FP-ex. Extensive experiments demonstrate that FR2FP-ex achieves the best result quality and is very close to the optimal solution. We also generalize the k-FR problem by considering relocation budget and facility cost, and provide approximate solutions with proven approximation ratios.
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
(2023)
Article
Management
Stefano Coniglio, Fabio Furini, Pablo San Segundo
Summary: This study introduces a novel combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts, which effectively combines different procedures for pruning branch-and-bound nodes. The algorithm shows high pruning potential and low computational effort, outperforming state-of-the-art methods by up to two orders of magnitude in speed.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Operations Research & Management Science
Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson
Summary: The paper proposes improvements to an existing branch-and-bound algorithm for the Close-Enough Traveling Salesman Problem. The improvements include a new search strategy, simplified branching vertex selection scheme, methods to avoid unnecessary computation and improve the quality of feasible solutions, and a method to reduce space requirement. Numerical experiments demonstrate that the improved algorithm proves optimality faster, finds good feasible solutions faster, and uses less space.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Huifen Zhong, Zhaotong Lian, Bowen Xue, Ben Niu, Rong Qu, Tianwei Zhou
Summary: This study investigates the integrated berth and quay crane allocation problem (BQCAP) and proposes a multiobjective model to solve these problems. The proposed algorithm is applied to a real-world case and outperforms other existing algorithms in solving BQCAP.
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS
(2022)
