Using artificial neural networks to solve the orienteering problem

DOI10.1007/BF02098284zbMath0839.90041OpenAlexW1990123366MaRDI QIDQ1908298

Jiyou Jia, Xiaoyun Sun, Qiwen Wang, Bruce L. Golden

Publication date: 26 February 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02098284

zbMATH Keywords

orienteering problemtransportation networkcontinuous Hopfield neural networkNP-hard optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

The clustered orienteering problem, Managing platelet supply through improved routing of blood collection vehicles, An efficient evolutionary algorithm for the orienteering problem, Metaheuristics: A bibliography, The orienteering problem: a survey, Variable neighborhood search to solve the generalized orienteering problem, Hybrid genetic algorithm for undirected traveling salesman problems with profits, Application of fuzzy optimization to the orienteering problem, A path relinking approach for the team orienteering problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm, A tabu search heuristic for the undirected selective travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• Strong linear programming relaxations for the orienteering problem
• The orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
• Computer Solutions of the Traveling Salesman Problem