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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 27; no. 5; pp. 887 - 922
Main Authors:	Garraffa, Michele, Mehta, Deepak, O’Sullivan, Barry, Ozturk, Cemalettin, Quesada, Luis
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!