Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties (Q1992511): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Guo-liang Li / rank
Normal rank
 
Property / author
 
Property / author: Ren-Jie He / rank
Normal rank
 
Property / author
 
Property / author: Guo-liang Li / rank
 
Normal rank
Property / author
 
Property / author: Ren-Jie He / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JADE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2017/2490620 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2747185775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with earliness, tardiness and non-execution penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing earliness and tardiness costs in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal restricted due date assignment in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution. A practical approach to global optimization. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank

Latest revision as of 06:25, 17 July 2024

scientific article
Language Label Description Also known as
English
Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties
scientific article

    Statements

    Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    Summary: We study the order acceptance and scheduling (OAS) problem with time-dependent earliness-tardiness penalties in a single agile earth observation satellite environment where orders are defined by their release dates, available processing time windows ranging from earliest start date to deadline, processing times, due dates, sequence-dependent setup times, and revenues. The objective is to maximise total revenue, where the revenue from an order is a piecewise linear function of its earliness and tardiness with reference to its due date. We formulate this problem as a mixed integer linear programming model and develop a novel hybrid differential evolution (DE) algorithm under self-adaptation framework to solve this problem. Compared with classical DE, hybrid DE employs two mutation operations, scaling factor adaptation and crossover probability adaptation. Computational tests indicate that the proposed algorithm outperforms classical DE in addition to two other variants of DE.
    0 references

    Identifiers