Pages that link to "Item:Q323288"

The following pages link to An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288):

Displaying 48 items.

• Collaborative urban transportation: recent advances in theory and practice (Q1631495) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← 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)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• A matheuristic for AGV scheduling with battery constraints (Q2076865) (← 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 location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint (Q2150477) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) (← links)
• Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review (Q2240056) (← links)
• The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
• Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
• Crowd-shipping with time windows and transshipment nodes (Q2333154) (← links)
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
• Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
• A heuristic approach for a real-world electric vehicle routing problem (Q2632520) (← links)
• The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← 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)
• Vehicle routing problems with multiple trips (Q5890960) (← links)
• Vehicle routing problems with multiple trips (Q5915965) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← links)
• Parcel delivery cost minimization with time window constraints using trucks and drones (Q6065834) (← links)
• Directions for future research on urban mobility and city logistics (Q6065884) (← 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 note on the hierarchical multi-switch multi-echelon vehicle routing problem (Q6110635) (← links)
• A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems (Q6112785) (← 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)
• Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person (Q6164323) (← links)