An efficient genetic algorithm for the traveling salesman problem with precedence constraints
From MaRDI portal
Publication:1848588
DOI10.1016/S0377-2217(01)00227-2zbMath0998.90066WikidataQ127976142 ScholiaQ127976142MaRDI QIDQ1848588
Yoonho Seo, Gyunghyun Choi, Chiung Moon, Jong Soo Kim
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (17)
Advanced planning and scheduling based on precedence and resource constraints for e-plant chains ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ A branch‐and‐dive heuristic for single vehicle snow removal ⋮ To improve the performance of genetic algorithms by using a novel selection operator ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility ⋮ A new approach to solving the multiple traveling salesperson problem using genetic algorithms ⋮ Quality inspection scheduling for multi-unit service enterprises ⋮ The freight consolidation and containerization problem ⋮ Exact and heuristic algorithms for routing AGV on path with precedence constraints ⋮ A time-dependent hierarchical Chinese postman problem ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Finding the shortest path with vertex constraint over large graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Classification of travelling salesman problem formulations
- A heuristic for the pickup and delivery traveling salesman problem
- Cluster based branching for the asymmetric traveling salesman problem
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Genetic algorithms for the traveling salesman problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- The General Pickup and Delivery Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: An efficient genetic algorithm for the traveling salesman problem with precedence constraints
