André Gustavo dos Santos's research while affiliated with Universidade Federal de Viçosa (UFV) and other places

Publications (59)

Article
We propose a new approach for the lastmile delivery problem where, besides serving as collecting points of orders for customers, parcel lockers are also used as transshipment nodes in a 2-echelon delivery system. Moreover, we consider that a customer (occasional courier) visiting a locker may accept a compensation to make a delivery to another cust...
Chapter
Motivated by last year truck drivers’ strike and the steady increase in fuel prices in Brazil, as well as the increase in price disparity between fuel stations, this paper proposes a variation of the vehicle routing problem that includes the selection of service stations supply. We propose a mathematical modeling that seeks to reduce transport cost...
Article
In recent years the manufacturing industries are currently focused on adopting optimal hybrid mass/customized strategies. Working solely on customized production or mass production is not a desirable strategy for many manufacturers anymore. The rapid advances in technology, applications, and customers’ requirements are increasing the competitivenes...
Article
Full-text available
Many industries have a complex manufacturing line, which complicates the planning of their productions. One possible solution to this problem is the optimization of the production line. In this work, mixed integer linear programming models are capable of representing the productive organization of the production line of a hair cosmetics factory, ch...
Conference Paper
This paper addresses the problem of optimizing a Demand Responsive Transport (DRT) service. A DRT is a flexible transportation service that provides on-demand transport for users who formulate requests specifying desired locations and times of pick-up and delivery. The vehicle routing and scheduling procedures are performed based on a set of reques...
Article
This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on ea...
Article
Full-text available
We consider a two-dimensional problem in which one is required to split a given rectangular bin into the smallest number of items. The resulting items must be squares to be packed, without overlapping, into the bin so as to cover all the given rectangle. We present a mathematical model and a heuristic algorithm that is proved to find the optimal so...
Conference Paper
This paper introduces the Thief Orienteering Problem (ThOP), a multi-component problem that combines two classic combinatorial problems: Orienteering Problem (OP) and Knapsack Problem (KP). In this problem, a person (called the thief) carries a capacitated knapsack and has a time limit to collect items distributed in a set of cities. The thief has...
Conference Paper
In this work, we present an effective memetic algorithm for a transportation network reconstruction problem. The problem addressed arises when the connections of a transportation network have been destroyed by a disaster, and then need to be rebuilt by a construction crew in order to minimize the damage caused in the post-disaster phase. Each verte...
Conference Paper
In this work, we address the Double Routing Vehicle Problem with Multiple Stacks and Heterogeneous Demand, a pickup and delivery problem. The objective of the problem is to determine a set routes for a fleet of vehicles in order to meet the demand of a set of customers so that the distance travelled by the vehicles is the minimum possible, while en...
Conference Paper
This paper introduces the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD). This problem is a more realistic generalization of the Double Vehicle Routing Problem with Multiple Stacks when customers have heterogeneous demands and the demand of each customer cannot be divided among two or more vehicles. The obje...
Conference Paper
The great number of vehicles in the streets is one of the biggest problems in big cities. Ridesharing, which has shown itself as a way to reduce the impact of this problem, is a subject widely discussed in the academic community nowadays. However, to the best of our knowledge, there is no paper in this subject including the characteristics we use i...
Conference Paper
The need for supplies and products has become more and more immediate due to the increasing globalization and new international treaties. Routing Problems with Loading Constraints have become very attractive, engendering studies in operations research. The appeal lies in the complexity of these problems, which are NP-hard and NP-complete. In 2015,...
Conference Paper
In this paper we propose a parallel heuristic to solve a broad formulation of the travel planning problem. Given a set of destinations and a travel time window, our goal is to find a route that produces a budget travel itinerary, involving plane flights, hotels, stays in each destination and departure/arrival times. When the sequence of cities is f...
Conference Paper
Full-text available
RESUMO A segurança pública é uma das áreas que mais exige atenção na administração pública, tendo consequências diretas no bem estar da sociedade. Criar estratégias de contenção de delitos, assim como rápido atendimento a situações emergenciais quando elas surgem é um desafio. Neste trabalho, busca-se utilizar de técnicas de pesquisa operacional pa...
Conference Paper
In this work, we consider the integrated lot-sizing and sequencing problem in a permutation flow shop with machine sequence-dependent setups. The problem is to determine the lot sizes and the production sequence in each period of a planning horizon such that the customer demands must be met and the capacity of the machines must be respected. The ob...
Conference Paper
Wireless Sensor Networks (WSNs) have emerged as an attractive and challenging research field. One of the main challenges in such networks lies in the constrained energy resources available to sensor nodes. Since the sensors are usually deployed in hostile environments and in large quantities, it is difficult or impossible to replace or recharge the...
Conference Paper
We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way...
Conference Paper
This paper considers the Flow shop Sequence Dependent Group Scheduling (FSDGS) problem with minimization of total flow time criterion. In this problem, the n jobs to be processed on m machines are grouped in families (groups) in a way that a machine setup time is needed between two consecutive jobs of different groups. The FSDGS problem is classifi...
Conference Paper
In this work we propose some metaheuristics to solve a routing problem with mandatory deliveries and selective pickups. There are two integer programming formulations proposed in the literature but they are able to solve to optimality only small-sized instances. Some greedy heuristics and metaheuristics have also been proposed: Tabu Search, General...
Conference Paper
In this work we deal with a vehicle loading problem where a heterogeneous fleet of vehicles must be loaded with a set of items. Differently from the traditional vehicle loading problems, there is also a set of optional items that may be loaded in order to maximize the used capacity of the selected vehicles. The problem is decomposed in two subprobl...
Conference Paper
In wireless sensors networks (WSNs) the efficient use of the sensors' energy is a key point to extend the network lifetime and has been the center of attention by many researchers. There are several different techniques to reduce the sensor's energy consumption. Sensor node clustering is one of these techniques. However, finding an optimal clusteri...
Conference Paper
This paper addresses the parallel machine scheduling problem which consists in the assignment of n jobs on m identical machines with the objective of minimizing the total tardiness of the jobs using the job splitting property. In this problem is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on paral...
Conference Paper
This paper presents two approaches for the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVRPDSP), where a vehicle departs loaded from the depot and must visit every delivery customer serving a certain demand, but may not visit all the pickup customers, only the ones that are profitable, since for every pickup made, there is...
Conference Paper
This paper presents a hybrid metaheuristic for the single vehicle routing problem with deliveries and selective pickups (SVRPDSP). A vehicle departs loaded from the depot, visit every customer delivering a certain amount of goods according to their demand, and optionally pickup items from those customers, receiving a profit for each pickup realized...
Article
In this paper, we analyze the performance of two multi-objective algorithms based on the Variable Neighborhood Search (VNS). The first algorithm was proposed by Geiger and the second algorithm is proposed in this work. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due wind...
Conference Paper
In this paper, we examine the p-median problem from a bi-objective point of view. Since this is a NP-Hard problem, an efficient algorithm based on the Iterated Local Search heuristic (ILS) is proposed to determine non-dominated solutions (an approximation of the Pareto-optimal solutions). ILS is a simple and powerful stochastic method that has show...
Conference Paper
In this paper, we describe and show the results of a combination of two metaheuristics to solve an unrelated parallel machines scheduling problem in which the setup times depend not only on the machine and job sequence, but also on the amount of resource assigned. This problem has been proposed recently on the literature and since then a couple of...
Conference Paper
This paper considers the p-median problem that consists in finding p-locals from a set of m candidate locals to install facilities minimizing simultaneously two functions: the sum of the distances from each customer to its nearest facility and the sum of costs for opening facilities. Since this is a NP-Hard problem, heuristic algorithms are the mos...
Conference Paper
This paper presents a combination of evolutionary algorithm and mathematical programming with an efficient local search procedure for a just-in-time job-shop scheduling problem (JITJSSP). Each job on the JITTSSP is composed by a sequence of operations, each operation having a specific machine where it must be scheduled and a due date when it should...
Conference Paper
This paper addresses the unrelated parallel machine problem with machine and job sequence dependent setup. In this problem, the amount of the setup time does not only depend on the machine and job sequence, but also on a number of resources assigned, which can vary between a minimum and a maximum. The goal is to find a schedule that minimizes the l...
Conference Paper
This paper describes a general hybrid column generation algorithm for crew scheduling problems, using genetic algorithm to speed up the generation of new columns, combined with an integer programming exact method to assure optimality. The subproblem of the column generation must generate a new feasible set of tasks to be assigned to a crew member....
Conference Paper
This paper describes a successful combination of genetic algorithm and local search procedure to find good solutions for just-in-time job-shop scheduling problem with earliness and tardiness penalties. For each job is given a specific order of machines in which its operations must be processed, and each operation has a due date, a processing time,...
Conference Paper
This article describes a combination of genetic algorithm and local search for the just-in-time job- shop scheduling problem, with earliness and tardiness penalties. In this problem, each operation of each job has a specific machine to be processed in a specific order and a process time, a due date, and earliness and tardiness costs, which will be...
Conference Paper
This paper addresses an unrelated parallel machine problem with machine and job sequence dependent setup times. The objective function considered is a linear combination of the total completion time and the total number of resources assigned. Due to the combinatorial complexity of this problem, we propose an algorithm based on the GRASP metaheurist...
Conference Paper
This study considers a single machine scheduling problem with the objective of minimizing the total weighted tardiness of the jobs. This problem is one of the most famous problems in single machine scheduling theory and it is NP-hard. In this paper, we propose a hybrid heuristic which combines GRASP with Path Relinking to find good quality solution...
Conference Paper
This paper shows a successful hybrid approach to improve a column generation algorithm. The objective is to construct daily duties to bus drivers, in order to cover a set of trips. Due to a large number of variables, the problem is decomposed in a master and a subproblem. The subproblem iteratively generates duties to the master problem, so the mai...
Conference Paper
Many papers state that one of the best approaches to solve Crew Scheduling problems is by Column Generation. Generally a large number of columns must be handled, then the problem is decomposed and a subproblem is solved to generate the columns iteratively. This paper shows a successful application of genetic algorithm to solve the subproblem, impro...
Conference Paper
Full-text available
Este trabalho apresenta o desenvolvimento de um algoritmo genético no problema de alocação de tripulações, especificamente no subproblema de seleção de colunas para cobrir os vários trechos de viagem, uma versão multiobjetivo do set covering problem (SCP). Apresentamos justificativas para se trabalhar com a versão multiobjetivo, dado o contexto do...
Conference Paper
Full-text available
This paper describes the use of genetic algorithms on a crew scheduling problem, more specifically in one of its phases, where a multiobjective set covering problem is used to choose the best set of duties in order to cover several trips. We show the importance of using multiobjective at this context, and describe some ideas incorporated to the cla...
Article
RESUMO Nesse trabalho é tratado um problema de empacotamento para encontrar a disposição de produtos de diferentes dimensões e peso dentro de caminhões com diferentes capacidades. O problema surgiu de um caso real de uma companhia, em que a carga deve obedecer a certa restrição de peso sobre os eixos do veículo; por isso o veículo é dividido em trê...
Article
Full-text available
The Adχ system presented here is a general management tool for all the departments of a college. The purpose is to manage the relation between the student and college in a quick way, either in the academic, administrative or financiall area. Its modular structure, based on Object Oriented Programming, was designed with a Web interface that allows t...

Citations

... Considering the nonsmoothness and unavailable derivatives of the objectives and constraint functions in many real-world models, the use of derivativefree heuristic approaches is popular in environmental management (Chang et al., 2010;Cho et al., 2004;Yazdian et al., 2021;Yoon and Shoemaker, 1999). The associated search methods are mainly focused on population-based algorithms, such as GAs (Domingues et al., 2020;Sotomayor et al., 2018;Yeniay, 2005) and evolutionary algorithms (Janža, 2022;Karri and Sahu, 2018;Ye et al., 2019). ...
... In many inventory models, constant demand rate and unit cost are assumed. The time-dependent demand pattern model was first developed by silver and meal (Silver and Meal, 1969) and many stalwart researchers (Ghare & Schrader, 1963;Goyal & Giri, 2001;Hariga & Benkherouf, 1994;Roychowdhury & Chaudhuri, 1983;Shah & Jaiswal, 1978;Silver & Meal, 1969;Within, 1957;Nogueira, Bettoni, Mends, & Santos, 2020;Pal & Mahapatra, 2017). Now a days, it has been seen that the effect of deterioration also plays an important role in the inventory system. ...
... The model is based on a set of nondominated trips that are enumerated by a label-setting algorithm in the first phase, while in the second phase the model is solved using Benders decomposition and BCP. The Pareto front is examined e. g. by Atahran et al. (2014) ;Chevrier, Liefooghe, Jourdan, & Dhaenens (2012) ;Hu, Zheng, & Liao (2019) ; Paquette et al. (2013) ;Parragh, Doerner, Hartl, & Gandibleux (2009) ;Zidi, Mesghouni, Zidi, & Ghedira (2012) or Viana, Santos, Martins, & Wanner (2019) . A comparison of six evolutionary algorithms to solve the multi-objevtive DARP is provided by Guerreiro, Cardoso, & Fernandes (2020) . ...
... Hof et al., 2017), clustered VRP(Hintsch and Irnich 2018), Dial-a-Ride Problem with EVs(Masmoudi et al., 2018), single VRP with deliveries and selective pickups(Coelho et al., 2016), profitable heterogeneous VRP with cross-docking(Baniamerian et al., 2019), fleet size and mix VRP with electric modular vehicles(Rezgui et al., 2019), and the double VRP with multiple stacks(Chagas et al., 2020). ...
... In this article, we tackle the Thief Orienteering Problem (ThOP) [23], another academic multi-component problem. The ThOP has been proposed based on the TTP, but with different interactions and constraints in mind. ...
... The authors also proposed a simple branch-and-price algorithm that was able to solve only instances of up to 15 customer requests. Posteriorly, a simple and effective heuristic based on the SA metaheuristic was proposed by the same authors in (Chagas and Santos, 2017). Their algorithm was able to overcome several results found by the branch-and-price algorithm. ...
... Therefore, a new proposed algorithm by the name of DMax Coverage was taken into consideration for rover use. However, our competition involves static obstacles and resources to retrieve, so if SLAM were used, adjustments would be necessary [27][28][29][30]. ...
... can be distinguished in the car sharing service [1]: i) the one-way rental; ii) the two-way rental. The majority of the researchers focus on the first strategy, where users or operators are allowed to pick up and return the rented vehicle in different parking areas [1], [2], [4]- [19]. In this case, the distribution of the vehicles can become unbalanced during the day due to the variable demand [1]. ...
... In this paper, we consider the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD), a realistic pickup-delivery routing problem introduced by Chagas and Santos [7]. This problem is a generalization of the Double Vehicle Routing Problem with Multiple Stacks (DVRPMS), which in turn is a generalization of the well-known Double Travelling Salesman Problem with Multiple Stacks (DTSPMS). ...
... Heuristics based on iterated local search, simulated annealing, and variable neighborhood descent were proposed for this problem by da Silveira et al. [15]. Another simulated annealing implementation was provided by Chagas et al. [16] and a variable neighborhood search by Chagas et al. [17]. ...