Pages that link to "Item:Q323364"

The following pages link to The vehicle routing problem with occasional drivers (Q323364):

Displaying 41 items.

• The multi-shift vehicle routing problem with overtime (Q976019) (← links)
• The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
• Collaborative urban transportation: recent advances in theory and practice (Q1631495) (← links)
• The driver and vehicle routing problem (Q1651584) (← links)
• The vehicle routing problem with dynamic occasional drivers (Q1691652) (← links)
• An optimization model for freight transport using urban rail transit (Q1754289) (← links)
• The pickup and delivery problem with time windows and occasional drivers (Q2003570) (← 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 probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal (Q2152974) (← links)
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting (Q2158017) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• Workforce planning for O2O delivery systems with crowdsourced drivers (Q2196080) (← links)
• Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations (Q2240054) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
• City-courier routing and scheduling problems (Q2253369) (← links)
• An exact solution method for the capacitated item-sharing and crowdshipping problem (Q2312351) (← 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)
• Facility location problems with user cooperation (Q2421328) (← links)
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach (Q2676335) (← links)
• Crowdsourced humanitarian relief vehicle routing problem (Q2676364) (← links)
• An alternative tactic to deal with the contingency of driver absenteeism (Q3161777) (← links)
• The Split Delivery Vehicle Routing Problem: A Survey (Q3564351) (← links)
• Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• Directions for future research on urban mobility and city logistics (Q6065884) (← links)
• Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers (Q6065897) (← links)
• Two-echelon collaborative routing problem with heterogeneous crowd-shippers (Q6068714) (← links)
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)
• Pre-auction lane selection in an integrated production–distribution planning problem (Q6094433) (← links)
• Research on delivery problem based on two-stage multi-objective optimization for takeout riders (Q6102872) (← links)
• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints (Q6106980) (← links)
• Transition towards sustainable mobility: the role of transport optimization (Q6558658) (← links)
• Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model (Q6568478) (← links)
• The static ridesharing routing problem with flexible locations: a Norwegian case study (Q6568486) (← links)