Searcharxiv⌕ Search

arXiv subjects

Teobaldo Bulhões

Publications and source records attributed to Teobaldo Bulhões.

2 recordsLinked to original sources

An Efficient Hybrid Heuristic for the Transmission Expansion Planning under Uncertainty

We address the stochastic transmission expansion planning (STEP) problem under uncertainty in renewable generation capacity and demand. STEP's objective is to minimize total transmission investment and generation costs. To tackle the computational challenges posed by large-scale systems, we propose a heuristic strategy that combines the progressive hedging (PH) algorithm for scenario-wise decomposition with an integrated approach for solving the resulting subproblems. The latter combines a destroy-and-repair operator, a beam search procedure, and a mixed-integer programming solver. The proposed framework is evaluated on large-scale systems from the literature with up to 10000 nodes, adapted to stochastic scenarios using parameters from the California test system (CATS). Compared with a non-trivial baseline algorithm that includes the same integrated approach, the proposed PH-based method consistently improved solution quality for the six systems considered (including CATS), achieving an average cost improvement of 5.28% within a 2-hour time limit.

math.OC↗

The Vehicle Routing Problem with Service Level Constraints

We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems.

math.OC↗