Browsing by Author "Moura, A."
Now showing 1 - 2 of 2
Results Per Page
Sort Options
- A bibliometric analysis of 10 years of EDUCON (2010-2019)Publication . Costa, Alexandra R.; Alves, Gustavo R.; Moura, A.In this paper we present a bibliometrics analysis of the 10 editions of the Global Engineering Education Conference (EDUCON). EDUCON is a conference of the IEEE Education Society for region 8. It started in 2010 and since then it is organized annually. With this study we intend to analyze the growth of the conference, namely through the evolution of the number of submissions/publications, and the number of citations per article. We also intend to analyze the number of references per article. A descriptive statistics of these indicators is done along the paper. With an initial set of 10 editions, it will be possible to investigate the impact of future editions, by performing a sliding-frame analysis, i.e. replacing the oldest by the newest edition and analyzing how this impacts the presented charts.
- A Routing/Assignment Problem in Garden Maintenance ServicesPublication . Cerdeira, J. O.; Cruz, M.; Moura, A.We address a routing/assignment problem posed by Neoturf, which is a Portuguese company working in the area of project, building and garden’s main- tenance. The aim is to define a procedure for scheduling and routing efficiently its clients of garden maintenance services. The company has two teams available throughout the year to handle all the maintenance jobs. Each team consists of two or three employees with a fully-equipped vehicle capable of carrying out every kind of maintenance service. At the beginning of each year, the number and frequency of maintenance interventions to conduct during the year, for each client, are agreed. Time windows are established so that visits to the client should occur only within these periods. There are clients that are supposed to be always served by the same team, but other clients can be served indifferently by any of the two teams. Since clients are geographically spread over a wide region, the total distance traveled while visiting clients is a factor that weighs heavily on the company costs. Neoturf is con- cerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss lim- itations on the size of instances that can be solved to guarantee optimality, present a modification of the Clarke and Wright heuristic for the vehicle routing with time windows, and report preliminary computational results obtained with Neoturf data.