| |
Records |
Links |
|
Author |
Averbakh, I.; Pereira, J |
|
| |
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. |
|
| |
Address |
|
|
| |
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 |
| |
|
| |
|
Author |
Averbakh, I.; Pereira, J. |
|
| |
Title |
Lateness Minimization in Pairwise Connectivity Restoration Problems |
Type |
|
| |
Year |
2018 |
Publication |
Informs Journal On Computing |
Abbreviated Journal |
INFORMS J. Comput. |
|
| |
Volume |
30 |
Issue |
3 |
Pages |
522-538 |
|
| |
Keywords |
combinatorial optimization; networks: scheduling; programming: branch and bound; network restoration; network construction; integrated network design and scheduling |
|
| |
Abstract |
A network is given whose edges need to be constructed (or restored after a disaster). The lengths of edges represent the required construction/restoration times given available resources, and one unit of length of the network can be constructed per unit of time. All points of the network are accessible for construction at any time. For each pair of vertices, a due date is given. It is required to find a construction schedule that minimizes the maximum lateness of all pairs of vertices, where the lateness of a pair is the difference between the time when the pair becomes connected by an already constructed path and the pair's due date. We introduce the problem and analyze its structural properties, present a mixed-integer linear programming formulation, develop a number of lower bounds that are integrated in a branch-and-bound algorithm, and discuss results of computational experiments both for instances based on randomly generated networks and for instances based on 2010 Chilean earthquake data. |
|
| |
Address |
[Averbakh, Igor] Univ Toronto Scarborough, Dept Management, Toronto, ON M1C 1A4, Canada, Email: averbakh@utsc.uturonto.ca; |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Informs |
Place of Publication |
|
Editor |
|
|
| |
Language |
English |
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1091-9856 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
WOS:000449096000008 |
Approved |
|
|
| |
Call Number |
UAI @ eduardo.moreno @ |
Serial |
924 |
|
| Permanent link to this record |
