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.

• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• The electric location routing problem with time windows and partial recharging (Q1753521) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
• The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← 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 matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
• Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
• Solving routing problems with pairwise synchronization constraints (Q1787918) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• Variable neighborhood search for vehicle routing problem with multiple time windows (Q1791961) (← links)
• Vehicle coordinated strategy for vehicle routing problem with fuzzy demands (Q1793740) (← 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)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• Online stochastic optimization under time constraints (Q1958625) (← links)
• Record breaking optimization results using the ruin and recreate principle (Q1976826) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A way to optimally solve a green time-dependent vehicle routing problem with time windows (Q1993575) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico (Q2004887) (← links)
• Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time (Q2005829) (← links)
• Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)