Pages that link to "Item:Q342576"
From MaRDI portal
The following pages link to A large neighbourhood based heuristic for two-echelon routing problems (Q342576):
Displaying 21 items.
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
- The electric two-echelon vehicle routing problem (Q1634075) (← links)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach (Q2027023) (← 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 matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
- A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout (Q2086954) (← links)
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint (Q2150477) (← links)
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
- An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization (Q2691226) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method (Q6115563) (← links)
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations (Q6599061) (← links)