Diversification strategies in local search for a nonbifurcated network loading problem

European Journal of Operational Research

Volumn 142, Issue 2, 2002, Pages 231-241

  Gendron, Bernard ^a   Potvin, Jean Yves ^a   Soriano, Patrick ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Diversification; Local search; Metaheuristics; Network loading problem

Indexed keywords

BIFURCATION (MATHEMATICS); HEURISTIC METHODS; TELECOMMUNICATION INDUSTRY; TELECOMMUNICATION NETWORKS;

NETWORK LOADING PROBLEM;

OPERATIONS RESEARCH;

EID: 0037120693     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00263-1     Document Type: Conference Paper

References (30)

1. Network design
2. Network design using cut inequalities
3. Tabu search for a network loading problem with multiple facilities
4. Capacitated network design - Polyhedral structure and computation
5. Distributed optimization by ant colonies
6. A note on two problems in connection with graphs
7. Greedy randomized adaptive search procedures
8. A system for routing and capacity assignment in computer communication networks
9. Backbone network design tools with economic tradeoffs
10. Multicommodity capacitated network design
11. A branch-and-cut algorithm for capacitated network design problems
12. An efficient implementation of an algorithm for finding K shortest simple paths
13. A study of diversification strategies for the quadratic assignment problem
14. Shortest paths, single origin-destination network design and associated polyhedra
15. The convex hull of two core capacitated network design problems
16. Modeling and solving the two-facility capacitated network loading problem
17. Network design and transportation planning: Models and algorithms
18. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
19. Network synthesis and optimum network design problems: Models, solution methods and applications
20. Joint optimization of capacity and flow assignment in a packet-switched communication network
21. Probabilistic diversification and intensification in local search for vehicle routing
22. On algorithms for finding the k-shortest paths in a network
23. Diversification strategies in tabu search algorithms for the maximum clique problem
24. Adaptive memory programming: A unified view of metaheuristics