Pages that link to "Item:Q5301128"
From MaRDI portal
The following pages link to An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem (Q5301128):
Displayed 29 items.
- A survey on two-echelon routing problems (Q337424) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- The electric two-echelon vehicle routing problem (Q1634075) (← links)
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← 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)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← 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)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout (Q2086954) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
- A multi-tiered vehicle routing problem with global cross-docking (Q2669633) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← 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)
- Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm (Q6106573) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
- Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person (Q6164323) (← links)
- The road train optimization problem with load assignment (Q6164384) (← links)