Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

DOI10.1016/S0377-2217(01)00188-6zbMath0995.90047OpenAlexW2050724929WikidataQ127343130 ScholiaQ127343130MaRDI QIDQ1598722

Daniel Vanderpooten, Virginie Gabrel

Publication date: 28 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00188-6

zbMATH Keywords

multiple criteria analysisinteractive proceduresmultiple criteria pathsatellite mission scheduling

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (18)

Multiobjective shortest path problems with lexicographic goal-based preferences ⋮ A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite ⋮ Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service ⋮ Scheduling satellite launch missions: an MILP approach ⋮ An interactive algorithm for multi-objective route planning ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ Scheduling for single agile satellite, redundant targets problem using complex networks theory ⋮ Approximate path searching method for single-satellite observation and transmission task planning problem ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ QUEST -- a new quadratic decision model for the multi-satellite scheduling problem ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• The shortest path problem with two objective functions
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• Maximizing the value of a space mission
• An empirical investigation of some bicriterion shortest path algorithms
• An interactive multiobjective procedure for selecting medium‐term countermeasures after nuclear accidents
• Multi‐objective combinatorial optimization problems: A survey
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

This page was built for publication: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite