View in EDS

Exact algorithms for routing electric autonomous mobile robots in intralogistics.

Saved in:
Bibliographic Details
Title: Exact algorithms for routing electric autonomous mobile robots in intralogistics.
Authors: Meyer, Anne1 (AUTHOR) anne.meyer@kit.edu, Gschwind, Timo2 (AUTHOR) gschwind@rptu.de, Amberg, Boris3 (AUTHOR) amberg@fzi.de, Colling, Dominik1 (AUTHOR) dominik.colling@partner.kit.edu
Source: European Journal of Operational Research. Jun2025, Vol. 323 Issue 3, p830-851. 22p.
Subjects: Vehicle routing problem, Autonomous robots, Routing algorithms, Mobile robots, Electric vehicles
Abstract: In intralogistics and manufacturing, autonomous mobile robots (AMRs) are usually electrically powered and recharged by battery swapping or induction. We investigate AMR route planning in these settings by studying different variants of the electric vehicle routing problem with due dates (EVRPD). We consider three common recharging strategies: battery swapping, inductive recharging with full recharges, and inductive recharging with partial recharges. Moreover, we consider two different objective functions: the standard objective of minimizing the total distance traveled and the minimization of the total completion times of transport jobs. The latter is of particular interest in intralogistics, where time aspects are of crucial importance and the earliest possible completion of jobs often has priority. In this context, recharging decisions also play an essential role. For solving the EVRPD variants, we propose exact branch-price-and-cut algorithms that rely on ad-hoc labeling algorithms tailored to the respective variants. We perform an extensive computational study to generate managerial insights on the AMR route planning problem and to assess the performance of our solution approach. The experiments are based on newly introduced instances featuring typical characteristics of AMR applications in intralogistics and manufacturing and on standard benchmark instances from the literature. The detailed analysis of our results reveals that inductive recharging with partial recharges is competitive with battery swapping, while using a full-recharges strategy has considerable drawbacks in an AMR setup. • Instances with typical characteristics of autonomous transports in intralogistics. • Minimization of total completion time considering three recharging strategies. • Exact branch-price-and-cut algorithms that rely on tailored labeling algorithms. • Labeling algorithms model the tradeoff between battery level and completion time. • Inductive recharging with partial recharges is competitive with battery swapping. [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 183573637
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Exact algorithms for routing electric autonomous mobile robots in intralogistics.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Meyer%2C+Anne%22">Meyer, Anne</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> anne.meyer@kit.edu</i><br /><searchLink fieldCode="AR" term="%22Gschwind%2C+Timo%22">Gschwind, Timo</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> gschwind@rptu.de</i><br /><searchLink fieldCode="AR" term="%22Amberg%2C+Boris%22">Amberg, Boris</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> amberg@fzi.de</i><br /><searchLink fieldCode="AR" term="%22Colling%2C+Dominik%22">Colling, Dominik</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> dominik.colling@partner.kit.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. Jun2025, Vol. 323 Issue 3, p830-851. 22p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Vehicle+routing+problem%22">Vehicle routing problem</searchLink><br /><searchLink fieldCode="DE" term="%22Autonomous+robots%22">Autonomous robots</searchLink><br /><searchLink fieldCode="DE" term="%22Routing+algorithms%22">Routing algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Mobile+robots%22">Mobile robots</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+vehicles%22">Electric vehicles</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In intralogistics and manufacturing, autonomous mobile robots (AMRs) are usually electrically powered and recharged by battery swapping or induction. We investigate AMR route planning in these settings by studying different variants of the electric vehicle routing problem with due dates (EVRPD). We consider three common recharging strategies: battery swapping, inductive recharging with full recharges, and inductive recharging with partial recharges. Moreover, we consider two different objective functions: the standard objective of minimizing the total distance traveled and the minimization of the total completion times of transport jobs. The latter is of particular interest in intralogistics, where time aspects are of crucial importance and the earliest possible completion of jobs often has priority. In this context, recharging decisions also play an essential role. For solving the EVRPD variants, we propose exact branch-price-and-cut algorithms that rely on ad-hoc labeling algorithms tailored to the respective variants. We perform an extensive computational study to generate managerial insights on the AMR route planning problem and to assess the performance of our solution approach. The experiments are based on newly introduced instances featuring typical characteristics of AMR applications in intralogistics and manufacturing and on standard benchmark instances from the literature. The detailed analysis of our results reveals that inductive recharging with partial recharges is competitive with battery swapping, while using a full-recharges strategy has considerable drawbacks in an AMR setup. • Instances with typical characteristics of autonomous transports in intralogistics. • Minimization of total completion time considering three recharging strategies. • Exact branch-price-and-cut algorithms that rely on tailored labeling algorithms. • Labeling algorithms model the tradeoff between battery level and completion time. • Inductive recharging with partial recharges is competitive with battery swapping. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=183573637
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ejor.2024.12.041
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 830
    Subjects:
      – SubjectFull: Vehicle routing problem
        Type: general
      – SubjectFull: Autonomous robots
        Type: general
      – SubjectFull: Routing algorithms
        Type: general
      – SubjectFull: Mobile robots
        Type: general
      – SubjectFull: Electric vehicles
        Type: general
    Titles:
      – TitleFull: Exact algorithms for routing electric autonomous mobile robots in intralogistics.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Meyer, Anne
      – PersonEntity:
          Name:
            NameFull: Gschwind, Timo
      – PersonEntity:
          Name:
            NameFull: Amberg, Boris
      – PersonEntity:
          Name:
            NameFull: Colling, Dominik
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 16
              M: 06
              Text: Jun2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 323
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1