Pages that link to "Item:Q2185532"

The following pages link to The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532):

Displaying 28 items.

• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
• Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
• The pickup and delivery problem with alternative locations and overlapping time windows (Q2147021) (← links)
• Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
• Optimizing the changing locations of mobile parcel lockers in last-mile distribution (Q2184067) (← links)
• Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
• Vehicle routing with private and shared delivery locations (Q2668792) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers (Q2669739) (← links)
• A mixed truck and robot delivery approach for the daily supply of customers (Q2673589) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← links)
• Cost‐optimal truck‐and‐robot routing for last‐mile delivery (Q6065895) (← links)
• Two-echelon collaborative routing problem with heterogeneous crowd-shippers (Q6068714) (← links)
• Designing a multi-modal and variable-echelon delivery system for last-mile logistics (Q6109810) (← links)
• Integrating micro-depot freight transport in existing public transport services (Q6168362) (← links)
• Mobile parcel lockers with individual customer service (Q6180035) (← links)
• Last‐mile delivery with drone and lockers (Q6196866) (← links)
• Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm (Q6565439) (← links)
• Facility location decisions for drone delivery with riding: a literature review (Q6568491) (← links)
• The grey zone two-echelon vehicle routing problem with customer-to-parcel locations and low-pollution vehicles for inner-city logistics (Q6606587) (← links)