Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries
Sign Up to like & getrecommendations! Published in 2025 at "Networks"
DOI: 10.1002/net.22276
Abstract: We introduce new matheuristic algorithms for the Inventory Routing Problem with unsplit and split deliveries for both Order‐Up‐to Level and Maximum Level replenishment policies. The first matheuristic is based on the Capacitated Concentrator Location problem.… read more here.
Keywords: problem; algorithms inventory; matheuristic algorithms; problem unsplit ... See more keywords