Genetic local search with distance preserving recombination operator for a vehicle routing problem.

DOI10.1016/S0377-2217(02)00830-5zbMath1053.90054OpenAlexW2022935671MaRDI QIDQ1410618

Paweł Kominek, Andrzej Jaszkiewicz

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00830-5

zbMATH Keywords

Combinatorial optimizationVehicle routing problemLocal searchPopulation-based metaheuristics

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items

AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ Distance preserving recombination operator for Earth observation satellites operations scheduling ⋮ Two effective hybrid metaheuristic algorithms for minimization of multimodal functions

Cites Work

• A new adaptive multi-start technique for combinatorial global optimizations
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Scatter search and star-paths: Beyond the genetic metaphor
• Hybrid evolutionary algorithms for graph coloring
• Comparison of iterative searches for the quadratic assignment problem
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Genetic local search for multi-objective combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item