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
Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Intelligent Manufacturing"
DOI: 10.1007/s10845-015-1046-4
Abstract: We consider in this paper the m-machine permutation flow-shop problem with total tardiness minimization. We propose several matheuristic algorithms, which are an hybridization of a local search and an exact resolution method. The matheuristics are… read more here.
Keywords: machine; flow shop; matheuristic algorithms; total tardiness ... See more keywords