Pages that link to "Item:Q339671"

The following pages link to An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671):

Displaying 41 items.

• A large neighbourhood search metaheuristic for the contagious disease testing problem (Q2171555) (← links)
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) (← links)
• Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics (Q2289931) (← links)
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles (Q2292364) (← links)
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
• The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions (Q2312298) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
• Service network design models for two-tier city logistics (Q2448205) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• A heuristic approach for a real-world electric vehicle routing problem (Q2632520) (← links)
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction (Q2672126) (← links)
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization (Q2691226) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
• Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery (Q6070418) (← links)
• Routing electric vehicles with a single recharge per route (Q6092658) (← links)
• The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
• A two-stage stochastic location-routing problem for electric vehicles fast charging (Q6106597) (← 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)
• Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method (Q6115563) (← links)
• Electric vehicles fast charger location-routing problem under ambient temperature (Q6115621) (← links)
• Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person (Q6164323) (← links)
• Drone location and vehicle fleet planning with trucks and aerial drones (Q6167399) (← links)
• Integrating micro-depot freight transport in existing public transport services (Q6168362) (← links)
• A conceptually simple algorithm for the capacitated location-routing problem (Q6491328) (← links)