Luciana S. Buriol

Food Regulated Pareto Multi-Species: a new ACO Approach for the Multi-objective Shortest Path Problem

  • L. C. T. Bezerra
  • Luciana S. Buriol
  • Elizabeth G. Goldbarg
  • Marco César Goldbarg
    • Categories Meta Heuristics, Multi-Criteria Optimization, Transportation Tags , , , ,

    The use of metaheuristics in Multi-objective Combinatorial Optimization, particularly Ant Colony Optimization (ACO), has grown recently. This paper proposes an approach where multi-species ants compete for food resources. Each species has its own search strategy and do not access pheromone information of other species. As in nature, successful ant populations are allowed to grow, whereas … Read more

    A biased random-key genetic algorithm for road congestion minimization

  • Luciana S. Buriol
  • Michael J. Hirsch
  • Panos M. Pardalos
  • Mauricio G.C. Resende
  • T. Querido
  • M. Ritt
    • Categories Combinatorial Optimization, Meta Heuristics, Transportation Tags , , , , , ,

    One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding … Read more

    Survivable IP network design with OSPF routing

  • Luciana S. Buriol
  • Mauricio G.C. Resende
  • Mikkel Thorup
    • Categories Meta Heuristics, Network Optimization, Telecommunications Tags , , , ,

    Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc weights assigned by the network operator. Each router computes shortest paths and creates destination tables used for routing flow on the shortest paths. If a router has multiple outgoing … Read more

    Speeding up dynamic shortest path algorithms

  • Luciana S. Buriol
  • Mauricio G.C. Resende
  • Mikkel Thorup
    • Categories Network Optimization Tags , , , ,

    Dynamic shortest path algorithms update the shortest paths to take into account a change in an edge weight. This paper describes a new technique that allows the reduction of heap sizes used by several dynamic shortest path algorithms. For unit weight change, the updates can be done without heaps. These reductions almost always reduce the … Read more

    A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing

  • Luciana S. Buriol
  • Mauricio G.C. Resende
  • Celso C. Ribeiro
  • Mikkel Thorup
    • Categories Meta Heuristics, Network Optimization, Telecommunications Tags , , , , , ,

    Intra-domain traffic engineering aims to make more efficient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open Shortest Path First) and IS-IS (Intermediate System-Intermediate System) are commonly used to select the paths along which traffic is routed within an autonomous system. These routing protocols direct traffic based on link … Read more