An adaptive large neighbourhood search algorithm for diameter bounded network design problems

This paper focuses on designing a diameter - constrained network where the maximum distance between any pair of nodes is bounded. The objective considered is to minimise a weighted sum of the total length of the links followed by the total length of the paths between the pairs of nodes. First, the p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of heuristics Ročník 27; číslo 5; s. 887 - 922
Hlavní autoři:	Garraffa, Michele, Mehta, Deepak, O’Sullivan, Barry, Ozturk, Cemalettin, Quesada, Luis
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2021 Springer Nature B.V
Témata:	Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Constraints Integer programming Linear programming Lower bounds Management Science Mathematics Mathematics and Statistics Mixed integer Network design Network topologies Nodes Operations Research Operations Research/Decision Theory Search algorithms Optical networks Diameter bounded network design Large neighbourhood search Mixed integer linear programming Constraint programming
ISSN:	1381-1231, 1572-9397
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!