An Enhanced Iterative Deepening Search Algorithm for the Unrestricted Container Rehandling Problem

• URL: http://arxiv.org/abs/2504.09046v2
• Date: Sat, 19 Apr 2025 05:30:39 GMT
• Title: An Enhanced Iterative Deepening Search Algorithm for the Unrestricted Container Rehandling Problem
• Abstract summary: The Container Rehandling Problem (CRP) involves rearranging containers between stacks under specific operational rules.<n>This paper introduces an enhanced deepening search algorithm integrated with improved lower bounds to boost search efficiency.<n>We show that our approach outperforms state-of-the-art exact algorithms in solving the more general UCRP variant.
• Score: 5.72243026664695
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In container terminal yards, the Container Rehandling Problem (CRP) involves rearranging containers between stacks under specific operational rules, and it is a pivotal optimization challenge in intelligent container scheduling systems. Existing CRP studies primarily focus on minimizing reallocation costs using two-dimensional bay structures, considering factors such as container size, weight, arrival sequences, and retrieval priorities. This paper introduces an enhanced deepening search algorithm integrated with improved lower bounds to boost search efficiency. To further reduce the search space, we design mutually consistent pruning rules to avoid excessive computational overhead. The proposed algorithm is validated on three widely used benchmark datasets for the Unrestricted Container Rehandling Problem (UCRP). Experimental results demonstrate that our approach outperforms state-of-the-art exact algorithms in solving the more general UCRP variant, particularly exhibiting superior efficiency when handling containers within the same priority group under strict time constraints.

Related papers

• Agent-UCT: Upper Confidence Bounds Applied to Trees for Agentic Workflow Optimization with Cost-Awareness [11.231092673447735]
  We introduce Agent-based Cost-Aware Upper Bounds Applied to Trees, a tree search algorithm that extends UCT with a reuse-aware regularization term derived from a bipartite prefix reuse graph.<n>Agent-UCT biases selection toward branches that leverage previously materialized configuration prefixes, reducing redundant execution while maintaining effective exploration.<n>WTB (Workflow Test Bench) provides deterministic replay, content-addressable caching, and transactional consistency, ensuring that intermediate states are materialized once and reused across the search computation.
  arXiv  Detail & Related papers  (2026-07-27T08:41:18Z)
• SCOPE-FE: Structured Control of Operator and Pairwise Exploration for Feature Engineering [0.4199844472131921]
  SCOPE-FE is a structured search space control framework.<n>It improves efficiency by reducing the candidate space prior to feature generation.<n> Experiments on ten benchmark datasets demonstrate that SCOPE-FE substantially reduces feature engineering time.
  arXiv  Detail & Related papers  (2026-04-29T14:17:35Z)
• Optimizing Entanglement Distribution Protocols: Maximizing Classical Information in Quantum Networks [5.621690515150937]
  Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks.<n>This paper addresses the entanglement distribution problem by introducing four pivotal advances.<n>First, recognizing that the primary application of quantum communication is the transmission of private information, we derive the Ensemble Capacity (EC), a novel metric that explicitly quantifies the secure classical information enabled by the entanglement distribution.
  arXiv  Detail & Related papers  (2026-03-26T12:08:13Z)
• Short Chains, Deep Thoughts: Balancing Reasoning Efficiency and Intra-Segment Capability via Split-Merge Optimization [68.89915707647138]
  Large Reasoning Models (LRMs) have demonstrated impressive capabilities in solving complex tasks through the generation of long reasoning chains.<n>We propose textbfCoSMo (textbfSplit-textbfMerge textbfOptimization), a framework designed to eliminate structural redundancy rather than indiscriminately restricting token volume.
  arXiv  Detail & Related papers  (2026-02-03T05:54:28Z)
• Reducing Circuit Resources in Grover's Algorithm via Constraint-Aware Initialization [3.7738353997936973]
  Grover's search algorithm provides a quadratic speedup over classical brute-force search in terms of query complexity.<n>We present a systematic framework with a simple preprocessing procedure for constraint-aware initializes in Grover's algorithm.<n>Our results indicate that this approach serves as a practical baseline for achieving more resource-efficient implementations of Grover's algorithm.
  arXiv  Detail & Related papers  (2026-01-25T07:31:06Z)
• Conflict-Driven Clause Learning with VSIDS Heuristics for Discrete Facility Layout [0.0]
  This paper studies the use of Conflict-Driven Clause Learning (CDCL) withDSs as a computational engine for discrete facility layout problems.<n>We develop a CNF-based formulation for layout feasibility and compare CDCL-based SAT solving against CPSAT and MILP formulations.
  arXiv  Detail & Related papers  (2025-12-19T20:03:37Z)
• Cost Minimization for Space-Air-Ground Integrated Multi-Access Edge Computing Systems [60.586531406445744]
  Space-air-ground integrated multi-altitude edge computing (SAGIN-MEC) provides a promising solution for the rapidly developing low-altitude economy.<n>We present a SAGIN-MEC architecture that enables the coordination between user devices (UDs), uncrewed aerial vehicles (UAVs) and satellites.
  arXiv  Detail & Related papers  (2025-10-24T15:03:07Z)
• Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs [18.734871315760717]
  This paper proposes a knowledge-guided memetic algorithm with golden section search and negatively correlated search.<n>It achieves higher search efficiency than the state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-07-29T12:17:25Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex. Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs. We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Scalable First-order Method for Certifying Optimal k-Sparse GLMs [9.613635592922174]
  We propose a first-order proximal gradient algorithm to solve the perspective relaxation of the problem within a BnB framework. We show that our approach significantly accelerates dual bound computations and is highly effective in providing optimality certificates for large-scale problems.
  arXiv  Detail & Related papers  (2025-02-13T17:14:18Z)
• Resolving the Exploration-Exploitation Dilemma in Evolutionary Algorithms: A Novel Human-Centered Framework [0.0]
  A systematic resolution to the exploration-exploitation dilemma in algorithm design requires an independent yet coordinated control over exploration and exploitation. We propose a Human-Centered Two-Phase Search (HCTPS) framework, in which the actualization of (1) and (2) is enabled through an external variable--the Search Space Control. We prove that the HCTPS strictly surpasses the current approach in terms of search space coverage without disrupting the EAs' inherent convergence mechanisms.
  arXiv  Detail & Related papers  (2025-01-04T01:06:46Z)
• Grover Adaptive Search for the Higher-Order Formulation of Quadratic Assignment Problems [9.018512859020992]
  We demonstrate that the search space of the quadratic assignment problem can be reduced using Grover adaptive search (GAS) with permutation preparation operator (PPO)<n>We first revise the traditional quadratic unconstrained binary optimization (QUBO) formulation of the QAP into a higher-order unconstrained binary optimization (HUBO)<n> Algebraic analyses in terms of the number of qubits, quantum gates, circuit depth, and query complexity are performed, which indicate that our proposed approach significantly reduces the search space size.
  arXiv  Detail & Related papers  (2024-10-16T03:00:37Z)
• AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation [88.50256898176269]
  We develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. We also design a Tail-Classes Memory Bank to manage the significant memory demand.
  arXiv  Detail & Related papers  (2024-09-30T15:31:02Z)
• Optimizing Container Loading and Unloading through Dual-Cycling and Dockyard Rehandle Reduction Using a Hybrid Genetic Algorithm [1.350722707557839]
  This paper addresses the NP-hard problem of optimizing container handling at ports by integrating Quay Crane Dual-Cycling (QCDC) and dockyard rehandle minimization.<n>We propose the Quay Crane Dual Cycle - Dockyard Rehandle Genetic Algorithm (QCDC-DR-GA), a hybrid Genetic Algorithm (GA) that holistically optimize both aspects.<n>Experiments on various ship sizes demonstrate that QCDC-DR-GA reduces total operation time by 15-20% for large ships compared to existing methods.
  arXiv  Detail & Related papers  (2024-06-12T16:47:45Z)
• An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem [67.92544792239086]
  We introduce an NN-based solver to significantly narrow the gap with advanced metaheuristics. First, we propose direction-aware facilitating attention model (DaAM) to incorporate directionality into the embedding process. Second, we design a supervised reinforcement learning scheme that involves supervised pre-training to establish a robust initial policy.
  arXiv  Detail & Related papers  (2024-03-11T02:17:42Z)
• Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection [9.175779296469194]
  This paper presents new ingredients to speed up the search by exploiting the structure of dynamic programming models. The key idea is to prevent the repeated expansion of nodes corresponding to the same dynamic programming states by querying expansion thresholds cached throughout the search. Experiments show that the pruning brought by this caching mechanism allows significantly reducing the number of nodes expanded by the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T10:18:33Z)
• ARES: An Efficient Algorithm with Recurrent Evaluation and Sampling-Driven Inference for Maximum Independent Set [48.57120672468062]
  This paper introduces an efficient algorithm for the Maximum Independent Set (MIS) problem, incorporating two innovative techniques. The proposed algorithm outperforms state-of-the-art algorithms in terms of solution quality, computational efficiency, and stability.
  arXiv  Detail & Related papers  (2022-08-16T14:39:38Z)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization [43.31016937305845]
  Internet-of-things, networked sensing, autonomous systems and federated learning call for decentralized algorithms for finite-sum optimizations. We develop DEcentralized STochastic REcurSive methodDESTRESS for non finite-sum optimization. Detailed theoretical and numerical comparisons show that DESTRESS improves upon prior decentralized algorithms.
  arXiv  Detail & Related papers  (2021-10-04T03:17:41Z)
• Outlier-Robust Sparse Estimation via Non-Convex Optimization [73.18654719887205]
  We explore the connection between high-dimensional statistics and non-robust optimization in the presence of sparsity constraints. We develop novel and simple optimization formulations for these problems. As a corollary, we obtain that any first-order method that efficiently converges to station yields an efficient algorithm for these tasks.
  arXiv  Detail & Related papers  (2021-09-23T17:38:24Z)
• Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality [131.45028999325797]
  We develop a doubly robust off-policy AC (DR-Off-PAC) for discounted MDP. DR-Off-PAC adopts a single timescale structure, in which both actor and critics are updated simultaneously with constant stepsize. We study the finite-time convergence rate and characterize the sample complexity for DR-Off-PAC to attain an $epsilon$-accurate optimal policy.
  arXiv  Detail & Related papers  (2021-02-23T18:56:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.