Pages that link to "Item:Q5285356"
From MaRDI portal
The following pages link to Nested Heuristic Methods for the Location-Routeing Problem (Q5285356):
Displaying 23 items.
- A survey on two-echelon routing problems (Q337424) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints (Q724317) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- Combined location-routing problems -- a neural network approach (Q1026597) (← links)
- The many-to-many location-routing problem (Q1284602) (← links)
- Heuristic solutions to multi-depot location-routing problems (Q1603335) (← links)
- Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
- The location routing problem using electric vehicles with constrained distance (Q2289942) (← links)
- The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads (Q2321672) (← links)
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
- A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- An iterated local search for solving a location-routing problem (Q2861505) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- Distribution network design on the battlefield (Q3168957) (← links)