Publication | Closed Access
An analysis of edge assembly crossover for the traveling salesman problem
20
Citations
5
References
2003
Year
Unknown Venue
Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringIndustrial EngineeringComputer-aided DesignStructural OptimizationDiscrete OptimizationGood CrossoverOperations ResearchGood PerformanceTraveling Salesman ProblemSystems EngineeringLogisticsSalesman ProblemCombinatorial OptimizationComputational GeometryTransportation EngineeringDesignCombinatorial ProblemComputer EngineeringInteger ProgrammingGraph TheoryEdge Assembly CrossoverRoute PlanningBusinessAssembly LineVehicle Routing ProblemHeuristic Search
The GA with edge assembly crossover (EAX) has shown a good performance for traveling salesman problems (TSPs). The paper examines why EAX brings good performance to GAs. Many crossovers for TSPs have been proposed so far. We first examine advantages of EAX by comparing it with other crossovers, and confirm some requirements to design a good crossover. Next, we examine what advantages the EAX has compared with other representative operators for TSPs.
| Year | Citations | |
|---|---|---|
Page 1
Page 1