Relax-and-Fix and Fix-and-Optimise algorithms to solve an integrated network design problem for closing a supply chain with hybrid retailers/collection centres
Year of publication: |
2025
|
---|---|
Authors: | Amiri-Aref, Mehdi ; Doostmohammadi, Mahdi |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 177.2025, Art.-No. 106981, p. 1-20
|
Subject: | Fleet optimisation | Location | Matheuristic | Network design | Reverse logistics | Lieferkette | Supply chain | Betriebliche Kreislaufwirtschaft | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Unternehmensnetzwerk | Business network | Netzwerk | Network |
-
A branch-and-price algorithm for solving the single-hub feeder network design problem
Hellsten, Erik Orm, (2022)
-
Reliable p-hub network design under multiple disruptions
Barahimi, Pouya, (2020)
-
Shayannejad, Marzieh, (2022)
- More ...
-
A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups
Sharifah Aishah Syed Ali, (2018)
-
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems : zero setup case
Doostmohammadi, Mahdi, (2018)
-
Masilionyte, Milda, (2021)
- More ...