Pages that link to "Item:Q4286472"

The following pages link to Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems (Q4286472):

Displaying 48 items.

• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
• Cyclic transfers in school timetabling (Q421072) (← links)
• Constraint-based very large-scale neighborhood search (Q434452) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• Expected part delays as a secondary layout criterion in automated manufacturing systems (Q1374180) (← links)
• On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties (Q1584455) (← links)
• Current modeling practices in bank courier scheduling (Q1590431) (← links)
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• Dynamic vehicle routing: Status and prospects (Q1908300) (← links)
• Routing problems: A bibliography (Q1908308) (← 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)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
• An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
• Employee workload balancing by graph partitioning (Q2448894) (← links)
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
• Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
• Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
• Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
• An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach (Q3534464) (← links)
• Algorithms for the Vehicle Routing Problems with Time Deadlines (Q4305486) (← links)
• AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS (Q4675892) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
• Convexity and global optimization: A theoretical link (Q5941512) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)