Multi-period hub set covering problems with flexible radius: a modified genetic solution

DOI10.1016/J.APM.2015.09.064MaRDI QIDQ2289304zbMATH OpenOpenAlexFDO

Authors Amir Ebrahimi-zade, Yahya zare-mehrjerdi, Alireza Zahmatkesh, Hasan Hosseini Nasab

Publication date 28 January 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2015.09.064

zbMATH Keywords

dynamic genetic algorithmdynamic hub set covering problemfacility locationflexible covering radiusimmigration operatormathematical modelling

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Model formulations for hub covering problems
• A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms
• The variable radius covering problem
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming

Cites work

• A fuzzy programming approach for dynamic virtual hub location problem
• A quadratic integer program for the location of interacting hub facilities
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• An M/M/c queue model for hub covering location problem
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• scientific article; zbMATH DE number 31720 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Hub Location and the p-Hub Median Problem
• Integer programming formulations of discrete hub location problems
• Lower Bounds for the Hub Location Problem
• Model formulations for hub covering problems
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
• Network hub location problems: The state of the art
• Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: two calibrated meta-heuristic algorithms
• Path relinking approach for multiple allocation hub maximal covering problem
• Solution algorithms for the capacitated single allocation hub location problem
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
• Taguchi's Quality Engineering Handbook
• The large-scale dynamic maximal covering location problem
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• The single-assignment hub covering problem: Models and linearizations
• Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach

Cited in

(6)

• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
• A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms
• Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
• A flexible logistics distribution hub model considering cost weighted time
• Multi-period hub location problem considering polynomial time-dependent demand
• A hybrid framework for designing customer centric hub and spoke transportation networks with delivery time windows

This page was built for publication: Multi-period hub set covering problems with flexible radius: a modified genetic solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289304)