Journal ArticleDOI
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
Reads0
Chats0
TLDR
A metaheuristic, called adaptive large neighborhood search (ALNS), is developed, thus creating a conflict-free observational timeline, and time slacks are introduced to confine the propagation of the time-dependent constraint of transition time.About:
This article is published in Computers & Operations Research.The article was published on 2017-10-01. It has received 105 citations till now. The article focuses on the topics: Local search (optimization) & Metaheuristic.read more
Citations
More filters
Journal ArticleDOI
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
TL;DR: The proposed adaptive task assignment mechanism is more efficient than competing state-of-the-art multi-satellite processing methods and performs effectively, handling the complexity brought by the large number of satellites and fulfilling more tasks with a good robustness.
Journal ArticleDOI
Timetable coordination in a rail transit network with time-dependent passenger demand
TL;DR: The computational results illustrate that the proposed approaches reduce the level of crowdedness of metro stations by around 8% in comparison with the current practical timetable of the investigated Beijing urban rail network.
Journal ArticleDOI
Agile Earth Observation Satellite Scheduling Over 20 Years: Formulations, Methods, and Future Directions
TL;DR: In this paper, the authors summarize current research on AEOSSP, identify main accomplishments and highlight potential future research directions, and discuss a number of topics worth pursuing in the future.
Journal ArticleDOI
A mixed integer linear programming model for multi-satellite scheduling
TL;DR: In this paper, a mixed-integer linear programming model is proposed to solve the multi-satellite scheduling problem with limited observation capacities, where constraints are derived from a careful analysis of the interdependency between feasible time intervals that are eligible for observations.
Journal ArticleDOI
Task scheduling and attitude planning for agile earth observation satellite with intensive tasks
TL;DR: This paper proposes a novel pseudospectral cooperative genetic algorithm (PCGA) to obtain the effective execution strategy and attitude path simultaneously and designs a time-dependent mechanism to determinate the start working time.
References
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
Book ChapterDOI
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
TL;DR: In this paper, a local search method called Large Neighbourhood Search (LNS) is used to solve vehicle routing problems, analogous to the shuffling technique of job shop scheduling.
Journal Article
Using constraint programming and local Search methods to solve vehicle routing problems
TL;DR: This work uses a local search method that is analogous to the shuffling technique of job-shop scheduling, and so meshes well with constraint programming technology, to solve vehicle routing problems.
Journal ArticleDOI
Local search in routing problems with time windows
TL;DR: In this article, local search algorithms for routing problems with time windows are presented. But the presence of time windows introduces feasibility constraints, the checking of which normally requires O(N) time.