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

DOI10.1016/J.APM.2015.09.064zbMATH Open1452.90203OpenAlexW2194549225MaRDI QIDQ2289304FDOQ2289304

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

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

zbMATH Keywords

facility locationmathematical modellingdynamic genetic algorithmdynamic hub set covering problemflexible covering radiusimmigration operator

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Multi-period hub location problem considering polynomial time-dependent demand
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
• 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
• A flexible logistics distribution hub model considering cost weighted time

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)