<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-03T22:42:03Z</responseDate>
  <request identifier="27803" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27803</identifier>
        <datestamp>2026-10-02T13:58:31Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Adaptive Metaheuristics for Multi-Objective Berth Allocation and Scheduling</dc:title>
          <dc:creator>Karathanasis, Konstantinos</dc:creator>
          <dc:creator>Kontogiannis, Spyros</dc:creator>
          <dc:creator>Pegos, Asterios</dc:creator>
          <dc:creator>Sofianos, Vasileios</dc:creator>
          <dc:creator>Zaroliagis, Christos</dc:creator>
          <dc:subject>Berth Allocation and Scheduling</dc:subject>
          <dc:subject>Multi-objective Optimization</dc:subject>
          <dc:subject>Metaheuristics</dc:subject>
          <dc:subject>Evolutionary Computation</dc:subject>
          <dc:description>The Berth Allocation and Scheduling Problem (BASP) is a challenging combinatorial optimisation problem arising in container terminal operations, where decisions must balance conflicting goals including operational efficiency, economic cost, environmental impact, and infrastructure utilisation. This paper investigates the multi-objective discrete dynamic BASP with time windows and introduces a four-objective mixed-integer linear programming formulation that simultaneously captures vessel service efficiency, CO₂ emissions, operating cost, and berth workload balance.&#13;
To solve this computationally challenging problem, we develop and systematically evaluate adaptive multi-objective metaheuristic approaches. First, we adapt four evolutionary multi-objective algorithms through problem-specific variation operators and an adaptive operator selection mechanism. Second, we extend Adaptive Large Neighbourhood Search (ALNS) to the multi-objective BASP setting and propose two variants: SMOALNS, based on an external Pareto archive, and NSALNS, which integrates ALNS with NSGAII environmental selection.&#13;
Extensive computational experiments demonstrate that adaptive operator selection consistently improves evolutionary baselines and that the proposed multi-objective ALNS approaches achieve the best overall performance across benchmark instances. The results indicate that adaptive destroy-repair search mechanisms are particularly effective for highly constrained berth scheduling problems, providing high-quality approximations of the Pareto front for realistic port management scenarios.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Konstantinos Karathanasis and Spyros Kontogiannis and Asterios Pegos and Vasileios Sofianos and Christos Zaroliagis</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 147, 26th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.ATMOS.2026.7</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-278031</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2026.7</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
