A vehicle routing problem with changeble compartment attribution: Re-engineering “Älskade Stad” from Sweden (original) (raw)

Zusammenfassung

Rising pressures to optimize both efficiency and resilience are spurring the creation of sustainable ecosystems. In such ecosystems, stakeholders pool supply chains and combine disparate services—such as parcel delivery, which starts fully loaded and ends empty, and waste disposal, which works in reverse—to reduce redundant runs, lower emissions, cut transportation costs, and decrease fleet sizes. This scenario, already observable in major cities across Sweden and Norway, is enhanced by the innovative use of multi-compartment vehicles that can dynamically switch between parcel transport and waste collection. To operationalize these benefits, this paper introduces a novel vehicle routing problem with changeable compartment attribution (VRP-CCA) to model such shared logistic systems. The VRP-CCA is exemplarily implemented using a multi-agent system (MAS) that leverages decentralized decision-making and combined search strategies. Simulation data from multiple real-world scenarios, including route trajectories and dynamic reassignments, are analyzed to validate the approach and quantify the benefit of such shared urban freight transport systems expressed by the vehicle cargo space utilization.

Becker, Christian; Wegner, Niklas; Gembarski, Paul Christoph (2025): A vehicle routing problem with changeble compartment attribution: Re-engineering “Älskade Stad” from Sweden. INFORMATIK 2025. DOI: 10.18420/inf2025_144. Bonn: Gesellschaft für Informatik e.V.. PISSN: 2944-7682. pp. 1625. NaWerSys-Workshop 2025. Potsdam. 16.–19. September 2025