Pages that link to "Item:Q2901011"

The following pages link to A unified modeling and solution framework for vehicle routing and local search-based metaheuristics (Q2901011):

Displaying 19 items.

• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
• Vehicle Routing Problems with Inter-Tour Resource Constraints (Q3564369) (← links)
• Multi-depot vehicle routing problem with time windows under shared depot resources (Q5963636) (← links)
• How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach (Q6105922) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)