Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
From MaRDI portal
Publication:2056575
DOI10.1016/j.apm.2020.09.057zbMath1481.90070OpenAlexW3092569116MaRDI QIDQ2056575
Xiaoting Shang, Bin Jia, Hao Ji, Kai Yang, Zi-You Gao
Publication date: 8 December 2021
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2020.09.057
variable neighborhood searchbi-objective programmingcargo delivery systemshierarchical hub location problemnon-dominated sorting genetic algorithm-II
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
Uses Software
Cites Work
- Unnamed Item
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
- Hierarchical facility network planning model for global logistics network configurations
- Variable neighbourhood search: methods and applications
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- Variable neighborhood search
- On the single-assignment \(p\)-hub center problem
- Routing and scheduling decisions in the hierarchical hub location problem
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Variable neighborhood search: Principles and applications
