×
Psaraftis, Harilaos N.

k-interchange procedures for local search in a precedence-constrained routing problem. (English) Zbl 0505.90045

Eur. J. Oper. Res. 13, 391-402 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0505.90045

Cited in 20 Documents

MSC:

90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
65K05 Numerical mathematical programming methods
90C35 Programming involving graphs or networks

Keywords:

k-interchange procedures; local search; precedence-constrained routing problem; single vehicle many-to-many Dial-A-Ride problem; breadth-first; depth-first; heuristic algorithms
Cite Review PDF
Full Text: DOI

References:

[1] Bodin, L. D.; Golden, B. L.; Ball, M.; Assad, A., The state-of-the-art of routing and scheduling of vehicles and crews, (Report, School of Business and Management (1981), University of Maryland)
[2] Bodin, L. D.; Sexton, T. R., The subscriber Dial-A-Ride problem: The Baltimore, Maryland benchmark, (ORSA/ TIMS meeting. ORSA/ TIMS meeting, Colorado Springs (1980))
[3] Gavish, B.; Srikanth, Mathematical formulations of the Dial-A-Ride problem, (Working paper (1980), Graduate School of Management, University of Rochester)
[4] Kanellakis, P. C.; Papadimitriou, C. H., ’Local search for the asymmetric traveling salesman problem, Operations Res., 28, 1086-1099 (1980) · Zbl 0447.90082
[5] Lin, S., Computer solutions to the traveling salesman problem, Bell System Tech. J., 44, 2245-2269 (1965) · Zbl 0136.14705
[6] Lin, S.; Kernighan, B. W., An effective heuristic algorithm for the traveling salesman problem, Operations Res., 21, 498-516 (1973) · Zbl 0256.90038
[7] Papadimitriou, C. H.; Steiglitz, K., Some Examples of difficult traveling salesman problems, Operations Res., 26, 434-443 (1978) · Zbl 0383.90105
[8] Psaraftis, H. N., A dynamic programming solution to the single-vehicle many-to-many immediate request Dial-A-Ride problem, Transportation Sci., 14, 130-154 (1980)
[9] H.N. Psaraftis, Analysis of an \(O(N^2)\) heuristic for the single vehicle many-to-many Euclidean Dial-A-Ride problem Transportation Res., to appear.; H.N. Psaraftis, Analysis of an \(O(N^2)\) heuristic for the single vehicle many-to-many Euclidean Dial-A-Ride problem Transportation Res., to appear.
[10] Sexton, T. R., The single vehicle many-to-many routing and scheduling problem, (PhD thesis (1979), S.U.N.Y. at Stony Brook)
[11] Stein, D. M., An asymptotic, probabilistic analysis of a routing problem, Math. Operations Res., 3, 89-101 (1978) · Zbl 0384.90054
[12] Tharakhan, G. G.; Psaraftis, H. N., An exact algorithm for the exponential disutility Dial-A-Ride problem, (Working paper (1981), MIT)
[13] Wilson, N. H.M.; Colvin, N. J., Computer control of the Rochester Dial-A-Ride system, Department of Civil Engineering MIT, Report R77-31 (1977)
[14] Wilson, N. H.M.; Weissberg, H., Advanced Dial-A-Ride algorithms research project: Final report, Department of Civil Engineering, MIT, Report R76-20 (1976)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.