Search Results - "Pessoa, Artur Alves"

A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification by Quadros, Hugo, Costa Roboredo, Marcos, Alves Pessoa, Artur

“…•New ILP formulation with a polynomial number of variables.•The branch-and-cut algorithm was proved to be robust, solving all instances.•Computational results…”
Get full text

Integer programming formulations for three sequential discrete competitive location problems with foresight by Gentile, José, Alves Pessoa, Artur, Poss, Michael, Costa Roboredo, Marcos

“…•Exact algorithms are proposed for three competitive location problems.•Several numerical experiments are presented assessing the algorithms efficiency.•The…”
Get full text

Robust constrained shortest path problems under budgeted uncertainty by Alves Pessoa, Artur, Di Puglia Pugliese, Luigi, Guerriero, Francesca, Poss, Michael

“…We study the robust constrained shortest path problem under resource uncertainty. After proving that the problem is NP‐hard in the strong sense for arbitrary…”
Get full text

An exact approach for the r-interdiction covering problem with fortification by Roboredo, Marcos Costa, Aizemberg, Luiz, Pessoa, Artur Alves

“…In this paper we treat the r -interdiction covering problem with fortification (RICF). The environment of this problem is composed of a set of customers J and…”
Get full text

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery by Subramanian, Anand, Uchoa, Eduardo, Pessoa, Artur Alves, Ochi, Luiz Satoru

“…We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are…”
Get full text

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem by Paes, Frederico Galaxe, Pessoa, Artur Alves, Vidal, Thibaut

“…•We consider the unequal area facility location problem with soft or hard dimensions.•We introduce two efficient hybrid genetic algorithms.•We use a…”
Get full text

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems by Pessoa, Artur, Sadykov, Ruslan, Uchoa, Eduardo

“…•We propose a new Branch-Cut-and-Price algorithm for heterogeneous vehicle routing.•The same algorithm can also solve multi-depot and site-dependent vehicle…”
Get full text

A generic exact solver for vehicle routing and related problems by Pessoa, Artur, Sadykov, Ruslan, Uchoa, Eduardo, Vanderbeck, François

“…Major advances were recently obtained in the exact solution of vehicle routing problems (VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of…”
Get full text

Single machine robust scheduling with budgeted uncertainty by Bougeret, Marin, Pessoa, Artur, Poss, Michael

“…We consider robust single machine scheduling problems. First, we prove that with uncertain processing times, minimizing the number of tardy jobs is NP-hard…”
Get full text

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints by de Azevedo, Guilherme Henrique Ismael, Pessoa, Artur Alves, Subramanian, Anand

“…•An new exact method based on satisfiability and workload is proposed for the problem.•The proposed approach also performs well on instances of the classical…”
Get full text

A hybrid GRASP and tabu-search heuristic and an exact method for a variant of the multi-compartment vehicle routing problem by Póvoa, Carlos Leonardo Ramos, Roboredo, Marcos Costa, Velasco, André Soares, Pessoa, Artur Alves, Paes, Frederico Galaxe

“…In this paper, we address a classical MCVRP variant characterized by a single vehicle type that has one exclusive compartment for each product type, fixed…”
Get full text

A branch-and-cut algorithm for the discrete (r∣p)-centroid problem by Roboredo, Marcos Costa, Pessoa, Artur Alves

“…► We present a branch-and-cut algorithm for the discrete (p∣r)-centroid problem. ► Our formulation has a polynomial number of variables. ► We define…”
Get full text

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times by Silva, Yuri Laio T.V., Subramanian, Anand, Pessoa, Artur Alves

“…•A new arc-time-indexed formulation is proposed for the problem.•A Lagrangian relaxation procedure is implemented within a branch-and-bound scheme.•We present…”
Get full text

The complexity of makespan minimization for pipeline transportation by Milidiú, Ruy Luiz, Pessoa, Artur Alves, Laber, Eduardo Sany

“…SPTP is a model for the pipeline transportation of petroleum products. It uses a directed graph G, where arcs represent pipes and nodes represent locations. In…”
Get full text

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery by Subramanian, Anand, Uchoa, Eduardo, Pessoa, Artur Alves, Ochi, Luiz Satoru

“…This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a…”
Get full text

Exact algorithms for the traveling salesman problem with draft limits by Battarra, Maria, Pessoa, Artur Alves, Subramanian, Anand, Uchoa, Eduardo

“…•Three formulations and related exact algorithms for the TSP with draft limits are proposed.•The three index formulation dominates theoretically and…”
Get full text

Exact methods for the discrete multiple allocation (r|p) hub-centroid problem by Andrade de Araújo, Antonio Camargo, Roboredo, Marcos Costa, Pessoa, Artur Alves, Pereira, Valdecy

“…•We propose two Mixed Integer Linear Programming Formulations and a branch-and-cut algorithm for the discrete multiple allocation (r|p) hub-centroid…”
Get full text

Formulations for a problem of petroleum transportation by Aizemberg, Luiz, Kramer, Hugo Harry, Pessoa, Artur Alves, Uchoa, Eduardo

“…•We study tactical models for a crude oil transportation problem by tankers.•We did our work on the top of a previous paper found in the literature.•We use 50…”
Get full text

A strategy for searching with different access costs by Laber, Eduardo Sany, Milidiú, Ruy Luiz, Pessoa, Artur Alves

“…Let us consider an ordered set of keys A={a 1<⋯<a n} , where the probability of searching a i is 1/n, for i=1,…,n. If the cost of testing each key is similar,…”
Get full text

A new model and a reformulation for the crude distillation unit charging problem with oil blends and sequence-dependent changeover costs by Cortez, Luiz Cláudio Sayão, Pessoa, Artur Alves

“…•We address the problem of planning the crude distillation unit charging process.•We verify the existence of splitting operations in the previous models.•The…”
Get full text