Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems

DOI10.1016/J.APM.2020.09.057MaRDI QIDQ2056575zbMATH OpenOpenAlexFDO

Authors Xiaoting Shang, Kai Yang, Bin Jia, Hao Ji, Ziyou 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

zbMATH Keywords

variable neighborhood searchbi-objective programmingcargo delivery systemshierarchical hub location problemnon-dominated sorting genetic algorithm-II

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
• Bicriteria \(p\)-hub location problems and evolutionary algorithms
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling
• A hub covering model for cargo delivery systems
• Routing and scheduling decisions in the hierarchical hub location problem

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling
• A genetic algorithm for the uncapacitated single allocation planar hub location problem
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
• A quadratic integer program for the location of interacting hub facilities
• 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 tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
• Capacitated single allocation hub location problem-A bi-criteria approach
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
• Hierarchical facility network planning model for global logistics network configurations
• Integer programming formulations of discrete hub location problems
• Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
• Network hub location problems: The state of the art
• On the single-assignment \(p\)-hub center problem
• Routing and scheduling decisions in the hierarchical hub location problem
• Tight linear programming relaxations of uncapacitated p-hub median problems
• Variable neighborhood search
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications

Cited in

(5)

• Bicriteria \(p\)-hub location problems and evolutionary algorithms
• A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation

Describes a project that uses

Uses Software

• RM-MEDA
• OR-Library

This page was built for publication: Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems

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