Pages that link to "Item:Q5689794"

The following pages link to A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers (Q5689794):

Displaying 50 items.

• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
• Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• A vehicle routing problem with flexible time windows (Q337177) (← links)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
• Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
• A tabu search algorithm for maximum parsimony phylogeny inference (Q853081) (← links)
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
• Heuristic and lower bound for a stochastic location-routing problem (Q864014) (← links)
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
• Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• Stochastic vehicle routing (Q1266554) (← links)
• Planning models for freight transportation (Q1278638) (← links)
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
• The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← links)
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search (Q1695780) (← links)
• A dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
• Optimal budget allocation policy for tabu search in stochastic simulation optimization (Q2108143) (← links)
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
• A queueing framework for routing problems with time-dependent travel times (Q2369970) (← links)
• Vehicle routing with dynamic travel times: a queueing approach (Q2426527) (← links)
• On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
• A labeling method for dynamic driver-task assignment with uncertain task durations (Q2488239) (← links)
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)