Pages that link to "Item:Q869003"

The following pages link to A general heuristic for vehicle routing problems (Q869003):

Displaying 50 items.

• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results (Q878563) (← links)
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
• Heuristic-based truck scheduling for inland container transportation (Q989618) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
• A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
• A powerful route minimization heuristic for the vehicle routing problem with time windows (Q1038101) (← links)
• A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem (Q1331556) (← links)
• Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
• Heuristic procedures for the capacitated vehicle routing problem (Q1588831) (← links)
• Shared capacity routing problem -- an omni-channel retail study (Q1622824) (← links)
• The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints (Q1651588) (← links)
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem (Q1651633) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
• Vehicle routing with cross-dock selection (Q1652043) (← links)
• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time (Q1652375) (← links)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
• A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
• An adaptive large neighbourhood search for asset protection during escaped wildfires (Q1652717) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
• An adaptive large neighborhood search for the periodic vehicle routing problem (Q1691650) (← links)
• Resource constrained routing and scheduling: review and research prospects (Q1694813) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
• A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• The optimization of transportation costs in logistics enterprises with time-window constraints (Q1723305) (← links)