Pages that link to "Item:Q3028709"
From MaRDI portal
The following pages link to Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709):
Displayed 50 items.
- New savings based algorithms for time constrained pickup and delivery of full truckloads. (Q1410309) (← links)
- Towards a decision support system for the ready concrete distribution system: a case of a Greek company. (Q1412756) (← links)
- A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
- A decision support system for a real vehicle routing problem. (Q1420384) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- Finding the critical path in an activity network with time-switch constraints (Q1579499) (← links)
- Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints (Q1600842) (← links)
- Proposals for chunking and tabu search (Q1609920) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
- School-bus routing for program scheduling (Q1823853) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Routing relatively few customers per route (Q1876468) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- A new branching strategy for time constrained routing problems with application to backhauling (Q1908295) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Record breaking optimization results using the ruin and recreate principle (Q1976826) (← 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)
- 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)
- 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)
- Interior point stabilization for column generation (Q2465956) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Minimizing task completion time with the execution set method (Q2467305) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A modified ant colony system for solving the travelling salesman problem with time windows (Q2472698) (← links)
- Indirect search for the vehicle routing problem with pickup and delivery and time windows (Q2480796) (← links)
- Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem (Q2489128) (← links)
- Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)