M. G. C. Resende, C. C. Ribeiro, "A grasp with path-relinking for permanent virtual circuit routing", In Proceedings of Networks, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Multiobjective Off-line Routing Model for MPLS Networks - Erbas, Erbas (2003) (Correct)
....minimizing the routing cost, balanced distribution of the tra#c, minimum tra#c splitting. The study also includes a case study based on a realistic network for the verification of the model. Multiobjective o# line routing problems in telecommunication have been studied previously in [3] and [4]. Knowles et al. 3] select the following objectives: minimization of the routing cost, minimization of the deviation from the target utilization of each link and minimization of over utilization of links. Resende et al. 4] develop a model for permanent virtual circuit routing. They try to ....
....problems in telecommunication have been studied previously in [3] and [4] Knowles et al. 3] select the following objectives: minimization of the routing cost, minimization of the deviation from the target utilization of each link and minimization of over utilization of links. Resende et al. [4] develop a model for permanent virtual circuit routing. They try to minimize the weighted objective function consisting of both a delay component and a load balancing component. In both studies the tra#c is not allowed to be split. Our study however considers the minimization of tra#c splitting as ....
M. G. C. Resende, C. C. Ribeiro, "A grasp with path-relinking for permanent virtual circuit routing", In Proceedings of Networks, 2002.
Randomized Heuristics for the Max-Cut Problem - Festa, Pardalos, Resende.. (2002) (2 citations) Self-citation (Resende Ribeiro) (Correct)
....space leading towards other guiding elite solutions are generated and explored in the search for better solutions. This is accomplished by selecting moves that introduce attributes contained in the guiding solutions. Successful applications of path relinking combined with GRASP are described in [1, 2, 9, 28, 36, 39]. procedure pl( x,EliteSet ) 1 Let (S, be the partition defined by x; 2 Randomly select a solution z E EliteSet; 3 Compute the symmetric difference A(x, z) i 1, IV] xi zi ; 4 w max w(x) w(z) 5 , y x; 6 while ]A(x,z) k 2 do 7 i argmax rs(i) cr (i) Vi fq A(x, ....
M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for permanent virtual circuit routing. Technical report, AT&T Labs Research, 2001.
Greedy Randomized Adaptive Search Procedures - Resende, Ribeiro (2002) (68 citations) Self-citation (Resende Ribeiro) (Correct)
....these attributes in the selected moves. The use of path relinking within a GRASP procedure, as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Mart [62] It was followed by several extensions, improvements, and successful applications [4, 22, 86, 90]. Two basic strategies are used: path relinking is applied as a post optimization step to all pairs of elite solutions; path relinking is applied as an intensification strategy to each local optimum obtained after the local search phase. Applying path relinking as an intensification ....
....than to the guiding one, allowing pruning the relinking trajectory before the latter is reached. Detailed computational results illustrating the trade o#s between these strategies for the problem of routing permanent virtual circuits in frame relay services are reported by Resende and Ribeiro [86]. In this case, the set of moves corresponding to the symmetric di#erence #(x 1 , x 2 ) between any pair x 1 x 2 of solutions is the subset of permanent virtual circuits routed through di#erent routes (i.e. using di#erent edges) in x 1 and x 2 . We summarize below some of these results, ....
[Article contains additional citation context not shown here]
M.G.C. Resende and C.C. Ribeiro. A grasp with path-relinking for permanent virtual circuit routing. Technical report, AT&T Labs Research, 2001.
Parallel Grasp With Path-Relinking For Job Shop Scheduling - Aiex, Binato, Resende (2002) (1 citation) Self-citation (Resende) (Correct)
.... by tabu search or scatter search [21 23] The use of path relinking within a GRASP procedure, as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Mart [25] It was followed by several extensions, improvements, and successful applications [2, 8, 31, 33]. In this section, we propose a path relinking strategy for the JSP. In our description, a schedule is represented by the permutation of operations in on the machines in M. The schedule is represented by permutation arrays, each with operations. Each permutation implies an ordering of ....
M.G.C. Resende and C.C. Ribeiro. A grasp with path-relinking for permanent virtual circuit routing. Technical report, AT&T Labs Research, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC