Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Informacje dla studentów (in Polish) (4)
- Atmospheric science (1)
- Bi-objective Optimisation (1)
- Direct neighbors (1)
- Geology (1)
-
- Hyper-heuristics (1)
- Image processing (1)
- Integer Linear Programming (1)
- Iterated Local Search (1)
- Linear discriminant analysis (1)
- Low-dimensional search (1)
- Machine learning (1)
- Metaheuristics (1)
- Patrol Scheduling (1)
- Planetary exploration (1)
- Time-Dependent Orienteering Problem (1)
- Window query (1)
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Automated Image Interpretation For Science Autonomy In Robotic Planetary Exploration, Raymond Francis
Automated Image Interpretation For Science Autonomy In Robotic Planetary Exploration, Raymond Francis
Electronic Thesis and Dissertation Repository
Advances in the capabilities of robotic planetary exploration missions have increased the wealth of scientific data they produce, presenting challenges for mission science and operations imposed by the limits of interplanetary radio communications. These data budget pressures can be relieved by increased robotic autonomy, both for onboard operations tasks and for decision- making in response to science data.
This thesis presents new techniques in automated image interpretation for natural scenes of relevance to planetary science and exploration, and elaborates autonomy scenarios under which they could be used to extend the reach and performance of exploration missions on planetary surfaces.
Two …
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Kyriakos MOURATIDIS
In this paper we study a novel query type, called direct neighbor query. Two objects in a dataset are direct neighbors (DNs) if a window selection may exclusively retrieve these two objects. Given a source object, a DN search computes all of its direct neighbors in the dataset. The DNs define a new type of affinity that differs from existing formulations (e.g., nearest neighbors, nearest surrounders, reverse nearest neighbors, etc.) and finds application in domains where user interests are expressed in the form of windows, i.e., multi-attribute range selections. Drawing on key properties of the DN relationship, we develop an …
Termodynamika Procesowa I Techniczna Lab., Wojciech M. Budzianowski
Termodynamika Procesowa I Techniczna Lab., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Tematyka Prac Dyplomowych Dla Studentów Wydziału Mechaniczno-Energetycznego Pwr., Wojciech M. Budzianowski
Tematyka Prac Dyplomowych Dla Studentów Wydziału Mechaniczno-Energetycznego Pwr., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Tematyka Prac Dyplomowych Dla Studentów Wydziału Chemicznego Pwr., Wojciech M. Budzianowski
Tematyka Prac Dyplomowych Dla Studentów Wydziału Chemicznego Pwr., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Mechanika Płynów Lab., Wojciech M. Budzianowski
Mechanika Płynów Lab., Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.