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 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 memetic algorithm for the team orienteering problem (Q972625) (← links)
• Human-guided search (Q972653) (← links)
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
• Adaptive demand peak management in online transport process planning (Q989614) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← 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)
• Methods for routing with time windows (Q1068008) (← links)
• A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints (Q1089245) (← links)
• Vehicle routing with full loads (Q1099072) (← links)
• A bi-criteria heuristic for the vehicle routing problem with time windows (Q1102175) (← links)
• ALTO: A computer system for the design of vehicle routing algorithms (Q1119169) (← 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)
• 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)