Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
From MaRDI portal
Recommendations
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A branch-and-cut algorithm for the hub location and routing problem
- An efficient heuristic for a hub location routing problem
- Solution algorithms for the capacitated single allocation hub location problem
- An endosymbiotic evolutionary algorithm for the hub location-routing problem
Cites work
- A branch-and-cut algorithm for the hub location and routing problem
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A quadratic integer program for the location of interacting hub facilities
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An endosymbiotic evolutionary algorithm for the hub location-routing problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Integer programming formulations of discrete hub location problems
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- New formulations for the uncapacitated multiple allocation hub location problem
- Solution algorithms for the capacitated single allocation hub location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- The many-to-many location-routing problem
Cited in
(15)- An endosymbiotic evolutionary algorithm for the hub location-routing problem
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Solving partitioning-hub location-routing problem using DCA
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- Hub location problem considering spoke links with incentive-dependent capacities
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
- Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm
- Enhancing transportation service management with bi-level optimization: competitive pricing and hub location
- Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems
- A literature review on hub location-routing models and their solution techniques
- Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
- An adaptive large neighborhood decomposition search-based approach for the location-routing problem with pickup facilities and heterogeneous demands
This page was built for publication: Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672134)
