Pages that link to "Item:Q2672134"
From MaRDI portal
The following pages link to Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134):
Displaying 10 items.
- An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← links)
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
- An adaptive variable neighborhood search for solving the multi-objective node placement problem (Q2631257) (← links)
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
- Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach (Q6160968) (← links)
- Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm (Q6565439) (← links)