Pages that link to "Item:Q1808420"

The following pages link to Guided local search and its application to the traveling salesman problem (Q1808420):

Displaying 48 items.

• Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
• A combinatorial approach for enhancing the performance of TH-PPM UWB systems: chaotic vs. classical codes sequences (Q437265) (← links)
• Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
• An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
• A survey on optimization metaheuristics (Q497180) (← links)
• Space and time allocation in a shipyard assembly hall (Q610963) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
• Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
• Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
• Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
• Path planning on a cuboid using genetic algorithms (Q942312) (← links)
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
• Translational packing of arbitrary polytopes (Q1005325) (← links)
• Heuristics for container loading of furniture (Q1044119) (← links)
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• Inequality constraint handling in genetic algorithms using a boundary simulation method (Q1762002) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
• Optimal in-store fulfillment policies for online orders in an omni-channel retail environment (Q2030356) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• A penalty-based multi-objectivization approach for single objective optimization (Q2198019) (← links)
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem (Q2242191) (← links)
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
• A guided local search procedure for the multi-compartment capacitated arc routing problem (Q2270452) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
• Ant colony optimization for solving an industrial layout problem (Q2371353) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
• Fast and high precision algorithms for optimization in large-scale genomic problems (Q2490543) (← links)
• An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
• Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics (Q2669512) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
• Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
• Automatic production planning of press brakes for sheet metal bending (Q3432666) (← links)
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
• The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
• Applying topological data analysis to local search problems (Q6154230) (← links)