Mauricio G.C. Resende

Power transmission network design by a greedy randomized adaptive path relinking approach

  • S. Binato
  • Mauricio G.C. Resende
  • Haroldo Faria Jr.
    • Categories Applications - Science and Engineering, Meta Heuristics

    This paper illustrates results obtained by a new metaheuristic approach, Greedy Randomized Adaptive Path Relinking, applied to solve static power transmission network design problems. This new approach consists of a generalization of GRASP concepts to explore different trajectories between two Citation AT&T Labs Research Report, December 2001 Submitted to PSCC’02. Article Download View Power transmission … Read more

    Parallel GRASP with path-relinking for job shop scheduling

  • Renata M. Aiex
  • S. Binato
  • Mauricio G.C. Resende
    • Categories Meta Heuristics, Scheduling Tags , , , , ,

    In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation is processed on a specific machine for a fixed duration. A machine can process no more than one job … Read more

    A genetic algorithm for the weight setting problem in OSPF routing

  • M. Ericsson
  • Panos M. Pardalos
  • Mauricio G.C. Resende
    • Categories Meta Heuristics, Telecommunications Tags , ,

    With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most … Read more

    Greedy randomized adaptive search procedures

  • Mauricio G.C. Resende
  • Celso C. Ribeiro
    • Categories Meta Heuristics Tags , ,

    GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, … Read more

    A GRASP with path-relinking for private virtual circuit routing

  • Mauricio G.C. Resende
  • Celso C. Ribeiro
    • Categories Meta Heuristics, Network Optimization, Telecommunications Tags , , , , , , , ,

    A frame relay service offers virtual private networks to customers by provisioning a set of long-term private virtual circuits (PVCs) between customer endpoints on a large backbone network. During the provisioning of a PVC, routing decisions are made without any knowledge of future requests. Over time, these decisions can cause inefficiencies in the network and … Read more

    A study of preconditioners for network interior point methods

  • Joaquim J. Júdice
  • João Patrício
  • Luis F. Portugal
  • Mauricio G.C. Resende
  • Geraldo Veiga
    • Categories Network Optimization Tags , , , ,

    We study and compare preconditioners available for network interior point methods. We derive upper bounds for the condition number of the preconditioned matrices used in the solution of systems of linear equations defining the algorithm search directions. The preconditioners are tested using PDNET, a state-of-the-art interior point code for the minimum cost network flow problem. … Read more

    GRASP with path relinking for the three-index assignment problem

  • Renata M. Aiex
  • Panos M. Pardalos
  • Mauricio G.C. Resende
  • Gerardo Toraldo
    • Categories Meta Heuristics Tags , , , ,

    This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explores … Read more

    Probability distribution of solution time in GRASP: An experimental investigation

  • Renata M. Aiex
  • Mauricio G.C. Resende
  • Celso C. Ribeiro
    • Categories Meta Heuristics Tags , , , , ,

    A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available. The distributions are estimated by running 12,000 independent runs of the heuristic. … Read more

    GRASP: An annotated bibliography

  • Mauricio G.C. Resende
  • Paola Festa
    • Categories Meta Heuristics Tags , ,

    A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each {GRASP} iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed … Read more