DynaQUEST: A New Approach to the Dynamic Multi-satellite Scheduling Problem

2020 ◽  
Author(s):  
J. Berger ◽  
N. Lo ◽  
M. Noel ◽  
L. Noutegne
Keyword(s):  
Scheduling Problem ◽  
New Approach ◽  
Satellite Scheduling

scholarly journals Application of a Multi-Satellite Dynamic Mission Scheduling Model Based on Mission Priority in Emergency Response

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1430 ◽  
Author(s):  
Jintian Cui ◽  
Xin Zhang
Keyword(s):  
Dynamic Scheduling ◽  
Search Algorithm ◽  
Earth Observation ◽  
Impact Factors ◽  
Scheduling Problem ◽  
Model Based ◽  
Scheduling Model ◽  
Earth Observation Satellites ◽  
Scheduling Plan ◽  
Satellite Scheduling

Emergency observations are missions executed by Earth observation satellites to support urgent ground operations. Emergency observations become more important for meeting the requirements of highly dynamic and highly time-sensitive observation missions, such as disaster monitoring and early warning. Considering the complex scheduling problem of Earth observation satellites under emergency conditions, a multi-satellite dynamic mission scheduling model based on mission priority is proposed in this paper. A calculation model of mission priority is designed for emergency missions based on seven impact factors. In the satellite mission scheduling, the resource constraints of scheduling are analyzed in detail, and the optimization objective function is built to maximize the observation mission priority and mission revenues, and minimize the waiting time for missions that require urgency for execution time. Then, the hybrid genetic tabu search algorithm is used to obtain the initial satellite scheduling plan. In case of the dynamic arrival of new emergency missions before scheduling plan releases, a dynamic scheduling algorithm based on mission priority is proposed to solve the scheduling problem caused by newly arrived missions and to obtain the scheduling plan of newly arrived missions. A simulation experiment was conducted for different numbers of initial missions and newly arrived missions, and the scheduling results were evaluated with a model performance evaluation function. The results show that the execution probability of high-priority missions increased because the mission priority was taken into account in the model. In the case of more satellite resources, when new missions dynamically arrived, the satellite resources can be reasonably allocated to these missions based on the mission priority. Overall, this approach reduces the complexity of the dynamic adjustment and maintains the stability of the initial scheduling plan.

An Ant Colony Algorithm for Remote Satellite and Ground Integration Scheduling Problem in Parallel Environment

2013 ◽  
Vol 791-793 ◽  
pp. 1341-1346 ◽  
Author(s):  
Peng Gao ◽  
Yue Jin Tan ◽  
Ju Fang Li ◽  
Ren Jie He
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Scheduling Problem ◽  
Computing Environment ◽  
Parallel Environment ◽  
Satellite Scheduling ◽  
Key Steps

The algorithms for solving the remote satellite scheduling problem are less effective usually in single computing environment. This paper designed a framework of ant colony algorithm for remote satellite and ground integration scheduling problem in the parallel environment, and given the detail of key steps in the algorithm. Experiments are show at the end of this paper to prove effective and validation.

Modeling and Simulation of Holonic Meta-Algorithm in Scheduling Process Using PERT Technique − Optimization in Job Shop Scheduling Problem

2015 ◽  
Vol 760 ◽  
pp. 199-204
Author(s):  
Mircea Gorgoi ◽  
Corneliu Neagu
Keyword(s):  
Objective Function ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
New Approach ◽  
Shop Scheduling ◽  
Technique Optimization ◽  
Optimum Solution

In generally scheduling can be viewed as optimization, bound by sequence and resource constrain and the minimization of the makespan is often used as the criterion. In this paper minimization of the makespan or complete time will be used such as an objective function and not the criterion of the decision. The new approach use heuristic elementary priority dispatch rules as the criterion of the decision. This research purpose a new methodology which use a specific elements of PERT techniques to find the optimum solution. New approach establish a solution's space where are find the all solution of the problem. Determination of the solution's space is realized by a meta-algorithm which take in account all the variant of the solutions of the process.

scholarly journals New Approach Combining Branch and Price with Metaheuristics to Solve Nurse Scheduling Problem

2017 ◽  
Vol 21 (7) ◽  
pp. 1251-1261 ◽  
Author(s):  
Junya Inafune ◽  
◽  
Shinya Watanabe ◽  
Masayoshi Okudera
Keyword(s):  
Scheduling Problem ◽  
Nurse Rostering ◽  
Branch And Price ◽  
Nurse Scheduling ◽  
High Quality ◽  
New Approach ◽  
Nurse Rostering Problem ◽  
Benchmark Instances

This paper presents a new approach combining Branch and Price (B&P) with metaheuristics to derive various high-quality schedules as solutions to a nurse scheduling problem (nurse rostering problem). There are two main features of our approach. The first is the combination of B&P and metaheuristics, and the second is the implementation of an efficient B&P algorithm. Through applying our approach to widely used benchmark instances, the effectiveness of our approach is determined.

scholarly journals Uso da técnica de busca em vizinhança de grande porte para a programação da escala de motoristas de ônibus urbano

TRANSPORTES ◽  
2010 ◽  
Vol 18 (2) ◽  
Author(s):  
Gustavo Peixoto Silva ◽  
Claudio Barbieri da Cunha
Keyword(s):  
Local Search ◽  
Large Scale ◽  
Crew Scheduling ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Search Technique ◽  
New Approach ◽  
Proposed Model ◽  
Belo Horizonte ◽  
The City

<p><strong>Resumo:</strong> Este artigo apresenta uma nova abordagem para a resolução do Problema de Programação de Tripulações no Sistema de Transporte Público (PPT). O modelo se baseia na metaheurística GRASP cuja busca local é realizada pelo método da Busca em Vizinhança de Grande Porte, conhecida na literatura como Very Large-Scale Neighborhood Search. O grande diferencial da aplicação desta técnica de busca para o PPT é que, além de incorporar os movimentos de realocação e troca de tarefas, realizados tradicionalmente, ela também permite considerar trocas do tipo 3-optimal, 4-optimal, até o limite de n-optimal, para uma solução com n tripulações. A implementação da heurística proposta foi testada com dados de problemas reais de uma empresa que opera em Belo Horizonte, e os resultados foram comparados com as soluções adotadas pela empresa. Desta forma foi possível observar que o modelo apresentado neste trabalho produziu soluções mais econômicas do que aquelas praticadas pela empresa.</p><strong>Abstract:</strong> This paper presents a new approach to solve the Crew Scheduling Problem (CSP) for public mass transport system. The proposed model is based on the GRASP metaheuristic framework, where the local search is performed by the Very Large-Scale Neighborhood (VLSN) search technique. The great differential of this search technique applied to the CSP is that, in addition to task reassigning and swapping movements, adopted in previous work, it also allows considering 3-optimal, 4-optimal, up to n-optimal task movements, for a solution with n crews, yielding to improved solutions. The proposed heuristic was tested with data from real problems of a bus company operating in the city of Belo Horizonte, and the results compared to the manual solution adopted by the company. Thus it was observed that the model presented in this work have produced more economical solutions than those used by the company.

Upper bounds for revenue maximization in a satellite scheduling problem

4OR ◽  
2004 ◽  
Vol 2 (3) ◽  
pp. 235-249 ◽  
Author(s):  
Thierry Benoist ◽  
Beno�t Rottembourg
Keyword(s):  
Upper Bounds ◽  
Revenue Maximization ◽  
Scheduling Problem ◽  
Satellite Scheduling
Sign in / Sign up

Export Citation Format

Share Document