Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design
暂无分享,去创建一个
[1] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[2] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[3] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[4] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[5] David M. Stein,et al. Scheduling Dial-a-Ride Transportation Systems , 1978 .
[6] L. F. Escudero,et al. On improving a solution to the ATSP with fixed origin and precedence relationships , 1988 .
[7] Harilaos N. Psaraftis. Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .
[8] David M. Stein,et al. An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..
[9] L. Escudero. An inexact algorithm for the sequential ordering problem , 1988 .
[10] Harilaos N. Psaraftis,et al. k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .