Hybrid genetic algorithm for undirected traveling salesman problems with profits
From MaRDI portal
Publication:6139377
DOI10.1002/net.22167zbMath1529.90066MaRDI QIDQ6139377
Jin-Kao Hao, Peng Fei He, Qinghua Wu
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- The orienteering problem: a survey
- A note on the prize collecting traveling salesman problem
- The selective travelling salesman problem
- A memetic algorithm for the team orienteering problem
- The effective application of a new approach to the generalized orienteering problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- Strong linear programming relaxations for the orienteering problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- An efficient evolutionary algorithm for the orienteering problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Using artificial neural networks to solve the orienteering problem
- Evolution-inspired local improvement algorithm solving orienteering problem
- A unified solution framework for multi-attribute vehicle routing problems
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- The orienteering problem
- Savings by Split Delivery Routing
- The prize collecting traveling salesman problem
- Solving the Orienteering Problem through Branch-and-Cut
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- The prize collecting traveling salesman problem: II. Polyhedral results
- A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- A Method for Solving Traveling-Salesman Problems
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
This page was built for publication: Hybrid genetic algorithm for undirected traveling salesman problems with profits