A new extension of local search applied to the Dial-A-Ride Problem

[1]  M. Savelsbergh.  An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[2]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[3]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[6]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[7]  N. E. Collins,et al.  Simulated annealing - an annotated bibliography , 1988 .

[8]  Harilaos N. Psaraftis,et al.  k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[12]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[13]  Kenneth Steiglitz,et al.  Optimal Design of Offshore Natural-Gas Pipeline Systems , 1970, Oper. Res..

[14]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[15]  K. Steiglitz,et al.  The Design of Minimum-Cost Survivable Networks , 1969 .

[16]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[17]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .