Pages that link to "Item:Q3028709"

The following pages link to Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709):

Displaying 50 items.

• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery (Q2023939) (← links)
• The online vehicle routing problem with occasional drivers (Q2027017) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
• A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
• Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
• Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
• Optimizing routing and delivery patterns with multi-compartment vehicles (Q2030293) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• The vehicle routing problem with heterogeneous locker boxes (Q2033310) (← 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 column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
• TLHSA and SACA: two heuristic algorithms for two variant VRP models (Q2084658) (← links)
• A genetic algorithm for solving the inventory routing problem with time windows (Q2086696) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• The mobile production vehicle routing problem: using 3D printing in last mile distribution (Q2103039) (← links)
• Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
• Effective loading in combined vehicle routing and container loading problems (Q2108096) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation (Q2108129) (← links)
• The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
• Optimizing vehicle routing via Stackelberg game framework and distributionally robust equilibrium optimization method (Q2127070) (← links)
• TLMPA: teaching-learning-based marine predators algorithm (Q2131549) (← links)
• Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping (Q2140142) (← links)
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model (Q2146039) (← links)
• Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
• Territory design for the multi-period vehicle routing problem with time windows (Q2147160) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting (Q2158017) (← links)
• A survey of truck-drone routing problem: literature review and research prospects (Q2158115) (← links)
• A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem (Q2165264) (← links)
• Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account (Q2171276) (← links)
• A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← links)
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
• On optimal coverage of a tree with multiple robots (Q2184041) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems (Q2185527) (← links)
• A multiperiod workforce scheduling and routing problem with dependent tasks (Q2185539) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)