A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s00500-016-2398-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2536320623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minmax regret gradual covering location problem on a network with incomplete information of demand weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple allocation hub-and-spoke network design under hub congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub-and-spoke network design with congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-assignment hub covering problem: Models and linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location models for airline hubs behaving as \(M/D/c\) queues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(M/M/c\) queue model for hub covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-allocation ordered median hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stackelberg hub arc location model for a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model formulations for hub covering problems / rank
 
Normal rank

Latest revision as of 00:08, 17 July 2024

scientific article
Language Label Description Also known as
English
A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
scientific article

    Statements

    A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2018
    0 references
    hub location problem
    0 references
    queuing theory
    0 references
    genetic programming
    0 references
    genetic algorithm
    0 references
    particle swarm optimization
    0 references

    Identifiers