Automated design of relocation rules for minimising energy consumption in the container relocation problem

• URL: http://arxiv.org/abs/2307.01513v1
• Date: Tue, 4 Jul 2023 06:49:25 GMT
• Title: Automated design of relocation rules for minimising energy consumption in the container relocation problem
• Authors: Marko {\DJ}urasevi\'c, Mateja {\DJ}umi\'c, Rebeka \v{C}ori\'c, Francisco Javier Gil-Gala
• Abstract summary: We use genetic programming to obtain priority functions used in RRs whose goal is to minimise energy consumption. The results obtained demonstrate that the RRs designed by genetic programming achieve the best performance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The container relocation problem is a combinatorial optimisation problem aimed at finding a sequence of container relocations to retrieve all containers in a predetermined order by minimising a given objective. Relocation rules (RRs), which consist of a priority function and relocation scheme, are heuristics commonly used for solving the mentioned problem due to their flexibility and efficiency. Recently, in many real-world problems it is becoming increasingly important to consider energy consumption. However, for this variant no RRs exist and would need to be designed manually. One possibility to circumvent this issue is by applying hyperheuristics to automatically design new RRs. In this study we use genetic programming to obtain priority functions used in RRs whose goal is to minimise energy consumption. We compare the proposed approach with a genetic algorithm from the literature used to design the priority function. The results obtained demonstrate that the RRs designed by genetic programming achieve the best performance.

Related papers

• Light Unbalanced Optimal Transport [69.18220206873772]
  Existing solvers are either based on principles or heavy-weighted with complex optimization objectives involving several neural networks. We show that our solver provides a universal approximation of UEOT solutions and obtains its generalization bounds.
  arXiv  Detail & Related papers  (2023-03-14T15:44:40Z)
• MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem [0.3359875577705538]
  Resource constrained project scheduling problem (RCPSP) is an NP-Hard optimization problem. We present a MAP-Elites based hyper-heuristic (MEHH) for the automated discovery of efficient priority rules for RCPSP.
  arXiv  Detail & Related papers  (2022-04-24T01:49:59Z)
• Learning Implicit Priors for Motion Optimization [105.11889448885226]
  Energy-based Models (EBM) represent expressive probability density distributions. We present a set of required modeling and algorithmic choices to adapt EBMs into motion optimization.
  arXiv  Detail & Related papers  (2022-04-11T19:14:54Z)
• Flipping the switch on local exploration: Genetic Algorithms with Reversals [0.0]
  Authors show that gradient-free search techniques are suitable for providing an optimal solution in the discrete domain. They also show that the use of multiple local searches can improve performance on local searches. It is observed that the proposed GA variants have the least average cost across all benchmarks including the problem proposed and IC performs better than its constituents.
  arXiv  Detail & Related papers  (2022-02-02T08:27:11Z)
• Evolutionary Optimization for Proactive and Dynamic Computing Resource Allocation in Open Radio Access Network [4.9711284100869815]
  Intelligent techniques are urged to achieve automatic allocation of the computing resource in Open Radio Access Network (O-RAN) Existing problem formulation to solve this resource allocation problem is unsuitable as it defines the capacity utility of resource in an inappropriate way. New formulation that better describes the problem is proposed.
  arXiv  Detail & Related papers  (2022-01-12T08:52:04Z)
• A distributed, plug-n-play algorithm for multi-robot applications with a priori non-computable objective functions [2.2452191187045383]
  In multi-robot applications, the user-defined objectives of the mission can be cast as a general optimization problem. Standard gradient-descent-like algorithms are not applicable to these problems. We introduce a new algorithm that carefully designs each robot's subcost function, the optimization of which can accomplish the overall team objective.
  arXiv  Detail & Related papers  (2021-11-14T20:40:00Z)
• Automated Design of Heuristics for the Container Relocation Problem [0.0]
  This paper investigates the application of genetic programming (GP) to design effective container relocation rules automatically. The experimental results show that GP evolved RRs outperform several existing manually designed RRs. The proposed method presents a viable alternative to existing manually designed RRs and opens a new research direction in the area of container relocation problems.
  arXiv  Detail & Related papers  (2021-07-28T12:20:02Z)
• Modeling the Second Player in Distributionally Robust Optimization [90.25995710696425]
  We argue for the use of neural generative models to characterize the worst-case distribution. This approach poses a number of implementation and optimization challenges. We find that the proposed approach yields models that are more robust than comparable baselines.
  arXiv  Detail & Related papers  (2021-03-18T14:26:26Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Jump Operator Planning: Goal-Conditioned Policy Ensembles and Zero-Shot Transfer [71.44215606325005]
  We propose a novel framework called Jump-Operator Dynamic Programming for quickly computing solutions within a super-exponential space of sequential sub-goal tasks. This approach involves controlling over an ensemble of reusable goal-conditioned polices functioning as temporally extended actions. We then identify classes of objective functions on this subspace whose solutions are invariant to the grounding, resulting in optimal zero-shot transfer.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• MineReduce: an approach based on data mining for problem size reduction [58.720142291102135]
  This paper presents an approach named MineReduce, which uses mined patterns to perform problem size reduction. We present an application of MineReduce to improve a for the heterogeneous fleet vehicle routing problem.
  arXiv  Detail & Related papers  (2020-05-15T08:49:50Z)

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.