A genetic algorithm for the orienteering problem

This paper presents a genetic algorithm to solve the orienteering problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are specified, so as to maximize the total score collected subject to a prescribed time constraint. Employing three sets of test problems from the literature, the performance of the genetic algorithm is evaluated against problem specific heuristics and an artificial neural network.

[1]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[2]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[3]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[4]  David W. Coit,et al.  Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems , 1996, INFORMS J. Comput..

[5]  Robert Hinterding,et al.  Mapping, order-independent genes and the knapsack problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[6]  P. Sokkappa.  The cost-constrained traveling salesman problem , 1990 .

[7]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[8]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[9]  C. Keller.  Algorithms to solve the orienteering problem: A comparison , 1989 .

[10]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[11]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[12]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[13]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[14]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[15]  Bruce L. Golden,et al.  Algorithms and solutions to multi-level vehicle routing problems , 1993 .

[16]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

[17]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[18]  Rekha Sukumar Rilai.  The traveling salesman subset-tour problem with one additional constrait (TSSP+1) , 1995 .

[19]  Alice E. Smith,et al.  Penalty guided genetic search for reliability design optimization , 1996 .

[20]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .

[21]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[22]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[23]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[24]  R. Vohra,et al.  The Orienteering Problem , 1987 .