Solving the Inventory Routing Problem with the Archimedes Optimization Algorithm
Loading...
Authors
Author (Corporation)
Publication date
2023
Typ of student thesis
Master
Course of study
Collections
Type
11 - Student thesis
Editors
Editor (Corporation)
Supervisor
Parent work
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
Patent number
Publisher / Publishing institution
Hochschule für Wirtschaft FHNW
Place of publication / Event location
Olten
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
The inventory routing problem (IRP) is an optimization problem many companies and organizations are confronted with in logistics processes. This optimization problem is about scenarios where a vendor must find an optimal solution to distribute goods to multiple customers. Finding a solution considering all costs and constraints is a difficult task. For this reason, many optimization algorithms have been applied to the problem.
Keywords
Subject (DDC)
Event
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
ISSN
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Review
Open access category
License
Citation
Neuschwander, K. (2023). Solving the Inventory Routing Problem with the Archimedes Optimization Algorithm [Hochschule für Wirtschaft FHNW]. https://irf.fhnw.ch/handle/11654/48852