Abstract

Abstract
Geolocation data is fundamental to businesses relying on vehicles such as logistics and transportation. With the advance of the technology, collecting geolocation data become increasingly accessible and affordable, which raised new opportunities for business intelligence. This paper addresses the application of geolocation data for monitoring logistics processes, namely for detecting vehicle-based operations in real time. A stream of geolocation entries is used for inferring stationary events. Data from an international logistics company is used as a case study, in which operations of loading/unloading of goods are not only identified but also quantified. The results of the case study demonstrate the effectiveness of the solution, showing that logistics operations can be inferred from geolocation data. Further meaningful information may be extracted from these inferred operations using process mining techniques.

Abstract
Geolocation data identifies the geographic location of people or objects, which may unveil the performance of some activity or operation. A good example is, if a vehicle is in a gas station then one may assume that the vehicle is being refuelled. This work aims to obtain vehicle-based operations from geolocation data by analysing the stationary states of vehicles, which may identify some motionless event (e.g. bus line stops and traffic incidents). Ultimately, these operations may be analysed with Process Mining techniques in order to discover the most significant ones and extract process related information. In this work, we studied the application of diverse approaches for detecting vehicle-based operations and identified different operations related to the bus services. The operations were also characterized according the distribution of their events, allowing to identify specific operations characteristics. The public transport network of Rio de Janeiro is used as a case study, which is supported by a real-time data stream of buses geolocations.

Abstract
This paper describes the development of a mechanism to deal with time windows constraints. To the best of our knowledge, the time windows constraints are difficult to be fulfilled even for state-of-the-art methods. Therefore, the main contribution of this paper is to propose a new computational technique to deal with such constraints to ensure the algorithm convergence. We test such technique in two metaheuristics to solve the discrete and dynamic Berth Allocation Problem. A data set generator was created, resulting in a diversity of problems in terms of time windows constraints. A detailed computational analysis was carried out to compare the performance for each metaheuristic.

Abstract

Abstract
Energy efficiency has become a major concern for manufacturing companies not only due to environmental concerns and stringent regulations, but also due to large and incremental energy costs. Energy-efficient scheduling can be effective at improving energy efficiency and thus reducing energy consumption and associated costs, as well as pollutant emissions. This work reviews recent literature on energy-efficient scheduling in job shop manufacturing systems, with a particular focus on metaheuristics. We review 172 papers published between 2013 and 2022, by analyzing the shop floor type, the energy efficiency strategy, the objective function(s), the newly added problem feature(s), and the solution approach(es). We also report on the existing data sets and make them available to the research community. The paper is concluded by pointing out potential directions for future research, namely developing integrated scheduling approaches for interconnected problems, fast metaheuristic methods to respond to dynamic scheduling problems, and hybrid metaheuristic and big data methods for cyber-physical production systems.