Pages that link to "Item:Q421715"
From MaRDI portal
The following pages link to Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715):
Displayed 37 items.
- A survey of recent research on location-routing problems (Q296678) (← links)
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm (Q296782) (← links)
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
- Heuristics for the generalized median graph problem (Q323345) (← links)
- A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← links)
- A survey on two-echelon routing problems (Q337424) (← links)
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
- Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- Flexible two-echelon location routing problem (Q1740565) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- Two-echelon location routing synchronized with production schedules and time windows (Q1788921) (← links)
- Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? (Q1993244) (← links)
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
- Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations (Q2147036) (← links)
- A waste collection problem with service type option (Q2160512) (← links)
- Designing a two-echelon distribution network under demand uncertainty (Q2272305) (← links)
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands (Q2355806) (← links)
- Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
- OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES (Q2852565) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- The two‐echelon routing problem with truck and drones (Q6082194) (← links)
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery (Q6087621) (← links)
- Location‐routing problem: a classification of recent research (Q6092538) (← links)
- The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method (Q6115563) (← links)