toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
  Record Links
Author (up) Averbakh, I.; Pereira, J doi  openurl
  Title Tree optimization based heuristics and metaheuristics in network construction problems Type
  Year 2021 Publication Computers & Operations Research Abbreviated Journal Comput. Oper. Res.  
  Volume 128 Issue Pages 105190  
  Keywords Network design; Scheduling; Network construction; Heuristics; Metaheuristics; Local search  
  Abstract We consider a recently introduced class of network construction problems where edges of a transportation network need to be constructed by a server (construction crew). The server has a constant construction speed which is much lower than its travel speed, so relocation times are negligible with respect to construction times. It is required to find a construction schedule that minimizes a non-decreasing function of the times when various connections of interest become operational. Most problems of this class are strongly NP-hard on general networks, but are often tree-efficient, that is, polynomially solvable on trees. We develop a generic local search heuristic approach and two metaheuristics (Iterated Local Search and Tabu Search) for solving tree-efficient network construction problems on general networks, and explore them computationally. Results of computational experiments indicate that the methods have excellent performance.  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0305-0548 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000632975100009 Approved  
  Call Number UAI @ alexi.delcanto @ Serial 1362  
Permanent link to this record
Select All    Deselect All
 |   | 

Save Citations:
Export Records: