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.

• A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review (Q2240056) (← links)
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots (Q2240065) (← links)
• Ship routing using genetic algorithms (Q2241313) (← links)
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
• City-courier routing and scheduling problems (Q2253369) (← links)
• Integrated machine scheduling and vehicle routing with time windows (Q2253636) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
• A solution approach to find the critical path in a time-constrained activity network (Q2270440) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
• Reliability of a stochastic intermodal logistics network under spoilage and time considerations (Q2283182) (← links)
• A multi-stage algorithm for a capacitated vehicle routing problem with time constraints (Q2283860) (← links)
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics (Q2289931) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• Dynamic vehicle routing with time windows in theory and practice (Q2311301) (← links)
• Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
• Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
• Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
• An evolutionary approach for the target search problem in uncertain environment (Q2331590) (← links)
• Crowd-shipping with time windows and transshipment nodes (Q2333154) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
• Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system (Q2349706) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
• The nuclear medicine production and delivery problem (Q2356256) (← links)
• Fleet routing position-based model for inventory pickup under production shutdown (Q2356283) (← links)
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times (Q2358098) (← links)
• Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption (Q2361135) (← links)
• Using cost change estimates in a local search heuristic for the pollution routing problem (Q2362177) (← links)
• An optimization algorithm for a capacitated vehicle routing problem with time windows (Q2363743) (← links)
• Solving real-life vehicle routing problems efficiently using tabu search (Q2367019) (← links)
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
• A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
• Time window temporal logic (Q2402278) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← links)
• On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)