Pages that link to "Item:Q3028709"

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

Displayed 50 items.

• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) ‎ (← links)
• Implementing an insertion heuristic for vehicle routing on parallel hardware (Q690016) ‎ (← links)
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) ‎ (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) ‎ (← links)
• A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) ‎ (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) ‎ (← links)
• An optimization approach for communal home meal delivery service: A case study (Q837090) ‎ (← links)
• An integrated approach to the vehicle routing and container loading problems (Q841582) ‎ (← links)
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) ‎ (← links)
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) ‎ (← links)
• Arcs-states models for the vehicle routing problem with time windows and related problems (Q856684) ‎ (← links)
• A goal programming approach to vehicle routing problems with soft time windows (Q857306) ‎ (← links)
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) ‎ (← links)
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes (Q859687) ‎ (← links)
• The vehicle routing problem with flexible time windows and traveling times (Q860386) ‎ (← links)
• Travel time reliability in vehicle routing and scheduling with time windows (Q862488) ‎ (← links)
• A general heuristic for vehicle routing problems (Q869003) ‎ (← links)
• Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) ‎ (← links)
• Arc routing problems with time-dependent service costs (Q872235) ‎ (← links)
• A case study of mutual routing-scheduling reformulation (Q880564) ‎ (← links)
• Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) ‎ (← links)
• Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) ‎ (← links)
• Scatter search for the fleet size and mix vehicle routing problem with time windows (Q940820) ‎ (← links)
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) ‎ (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) ‎ (← links)
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) ‎ (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) ‎ (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) ‎ (← links)
• A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) ‎ (← links)
• Online decision making and automatic decision model adaptation (Q1000952) ‎ (← links)
• An assignment-based heuristic for vehicle routing with time windows (Q1001380) ‎ (← links)
• Production scheduling and vehicle routing with time windows for perishable food products (Q1013412) ‎ (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) ‎ (← links)
• Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) ‎ (← links)
• Vehicle routing problem with fuzzy time windows (Q1037889) ‎ (← links)
• Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402) ‎ (← links)
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) ‎ (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) ‎ (← links)
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles (Q1040998) ‎ (← links)
• Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) ‎ (← links)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) ‎ (← links)
• Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) ‎ (← links)
• Critical path in an activity network with time constraints (Q1278077) ‎ (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) ‎ (← links)
• Single-vehicle scheduling with time window constraints (Q1297696) ‎ (← links)
• Determining the optimal starting times in a cyclic schedule with a given route (Q1310046) ‎ (← links)
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) ‎ (← links)
• Local search with annealing-like restarts to solve the VRPTW (Q1400662) ‎ (← links)
• Minimum time paths in a network with mixed time constraints. (Q1406690) ‎ (← links)
• Modeling rolling batch planning as vehicle routing problem with time windows. (Q1406729) ‎ (← links)