Pages that link to "Item:Q1681304"

The following pages link to A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304):

Displayed 26 items.

• Flexible two-echelon location routing problem (Q1740565) ‎ (← links)
• A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) ‎ (← links)
• Same-day delivery with pickup stations and autonomous vehicles (Q2003409) ‎ (← 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)
• The vehicle routing problem with heterogeneous locker boxes (Q2033310) ‎ (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) ‎ (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) ‎ (← links)
• Simultaneous cooperation of refrigerated ground vehicle (RGV) and unmanned aerial vehicle (UAV) for rapid delivery with perishable food (Q2109502) ‎ (← links)
• A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint (Q2150477) ‎ (← links)
• A waste collection problem with service type option (Q2160512) ‎ (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) ‎ (← links)
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) ‎ (← links)
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) ‎ (← links)
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) ‎ (← links)
• Crowd-shipping with time windows and transshipment nodes (Q2333154) ‎ (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) ‎ (← links)
• Vehicle routing with private and shared delivery locations (Q2668792) ‎ (← links)
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) ‎ (← links)
• Identifying an effective last-mile customer delivery option with an integrated eco-friendly inventory model (Q5883597) ‎ (← links)
• Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) ‎ (← links)
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) ‎ (← links)
• Designing a multi-modal and variable-echelon delivery system for last-mile logistics (Q6109810) ‎ (← links)
• A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method (Q6115563) ‎ (← links)
• Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person (Q6164323) ‎ (← links)
• Last‐mile delivery with drone and lockers (Q6196866) ‎ (← links)