Pages that link to "Item:Q2003570"

The following pages link to The pickup and delivery problem with time windows and occasional drivers (Q2003570):

Displaying 33 items.

• The vehicle routing problem with occasional drivers (Q323364) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• The vehicle routing problem with dynamic occasional drivers (Q1691652) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• The online vehicle routing problem with occasional drivers (Q2027017) (← links)
• A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
• Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
• A data-driven compensation scheme for last-mile delivery with crowdsourcing (Q2108162) (← links)
• The pickup and delivery problem with alternative locations and overlapping time windows (Q2147021) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting (Q2158017) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• Shared resources in collaborative vehicle routing (Q2307318) (← links)
• An exact solution method for the capacitated item-sharing and crowdshipping problem (Q2312351) (← links)
• Crowd-shipping with time windows and transshipment nodes (Q2333154) (← links)
• On assigning drivers for a home-delivery system on a performance basis (Q2468735) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• Household-Level Economies of Scale in Transportation (Q2957463) (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) (← links)
• The General Pickup and Delivery Problem (Q4836837) (← links)
• Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
• (Q5128116) (← links)
• Distribution of waiting time for dynamic pickup and delivery problems (Q5963102) (← links)
• The Pickup And Delivery Problem With Time Windows And Transshipment (Q6043232) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• An improved decomposition-based heuristic for truck platooning (Q6065636) (← links)
• Directions for future research on urban mobility and city logistics (Q6065884) (← links)
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)
• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints (Q6106980) (← links)
• Solving a pickup and delivery routing problem for fourth‐party logistics providers (Q6195030) (← links)
• Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model (Q6568478) (← links)