A framework for developing a daily activity and multimodal travel planner

International Transactions in Operational Research

Volumn 6, Issue 1, 1999, Pages 107-121

  Vaughn, K M ^a   Abdel Aty, M A ^b   Kitamura, R ^c  

^a Metropol Transportation Commission   (United States)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Activity scheduling; ATIS; Multimodal travel; Traveling salesman problem; Vehicle routing

Indexed keywords

EID: 85015595221     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1999.tb00146.x     Document Type: Article

References (31)

1. Adler, T., Ben-Akiva, M., 1979. A theoretical and empirical model of trip chaining behavior. Transportation Research 13B, 243-257.
2. Altinkemer, K., Gavish, B., 1990. Heuristics for delivery problems with constant error guarantees. Transportation Science 24 (4), 294-297.
3. Berman, O., Simchi-Levi, D., 1988. Finding the optimal a priori tour and location of a traveling salesman with non-homogeneous customers. Transportation Science 22 (2), 148-154.
4. Bertsimas, D.J., 1989. Traveling salesman facility location problems. Transportation Science 23 (3), 184-191.
5. Bodin, L., Golden, B., Assad, A., Ball, M., 1983. The state-of-the-art in the routing and scheduling of vehicles and crews. Computers and Operations Research 10, 63-211.
6. Borgers, A., Timmermans, H., 1986. City center entry points, store location patterns and pedestrian route choice behavior: a microlevel simulatión model. Socio-Economic Planning Sciences 20, 25-31.
7. Current, J.R., Schilling, D.A., 1989. The covering salesman problem. Transportation Science 23 (3), 208-213.
8. Damm, D., 1982. Parameters of activity behavior for use in travel analysis. Transportation Research 16A, 135-148.
9. de Palma, A., Hansen, P., Labbe, M., 1990. Commuters' paths with penalties for early or late arrival time. Transportation Science 24 (4), 276-286.
10. Garling, T., Brannas, K., Garvill, J., Golledge, R., Gopal, S., Holm, E., Lindberg, E., 1989, Household activity scheduling. Presented at 5th World Conference on Transport Research, Yokohama, Japan.
11. Gaudioso, M., Paletta, G., 1992. A heuristic for the periodic vehicle routing problem. Transportation Science 26 (2), 86-92.
12. Grotschel, M., 1980, On the symmetric travelling salesman problem: solution of a 120-city problem. In: Padberg, M.W. (Ed.). Combinatorial Optimization, Mathematical Programming Study 12. Elsevier North-Holland, Amsterdam, pp. 61-77.
13. Jaw, J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M., 1986. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research B 20B (3), 243-257.
14. Johnson, D.S., Papadimitriou, C.H., 1985aComputational complexity. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (Eds.). The Traveling Salesman Problem. John Wiley & Sons, New York, NY.
15. Johnson, D.S., Papadimitriou, C.H., 1985b, Performance guarantees for heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (Eds.). The Traveling Salesman Problem. John Wiley & Sons, New York, NY.
16. Kitamura, R., Kostyniuk, L., 1983. Maturing motorization and household travel: the case of nuclear-family households. Transportation Research 20A, 245-260.
17. Kitamura, R., 1984a. Incorporating trip chaining into analysis of destination choice. Transportation Research 18B, 67-81.
18. Kitamura, R., 1984b. A model of daily time allocation to discretionary out-of home activities and trips. Transportation Research 18B, 255-266.
19. Kitamura, R., 1988. An evaluation of activity-based travel analysis. Transportation 15, 9-34.
20. Koskosidis, Y.A., Powell, W.B., Solomon, M.M., 1992. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Science 26 (2), 69-85.
21. Kovacs, W.J., Goodin, D.T., 1985. A statistical approach to the traveling salesman problem. Transportation Research B 19B (3), 239-252.
22. Leung, J.M.Y., Magnanti, T.L., Singhal, V., 1990. Routing in point-to-point delivery systems: formulations and solution heuristics. Transportation Science 24 (4), 245-260.
23. Padberg, M.W., Hong, S., 1980, On the symmetric travelling salesman problem: a computational study. In: Padberg, M.W. (Ed.). Combinatorial Optimization, Mathematical Programming Study 12. Elsevier North- Holland, Amsterdam, pp. 78-107.
24. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Research B 17B (2), 133-145.
25. Recker, W., McNally, M., Root, G., 1986a. A model of complex travel behavior: Part 1: theoretical development. Transportation Research 20A (4), 307-318.
26. Recker, W., McNally, M., Root, G., 1986b. A model of complex travel behavior: Part 2: an operational model. Transportation Research 20A (4), 319-330.
27. Robuste, F., Daganzo, C.F., Souleyrette, R.R., 1990. Implementing vehicle routing models. Transportation Research B 24B (4), 263-286.
28. Root, G., Recker, W., 1983, Toward a dynamic model of individual activity pattern formulation. In: Carpenter, S., Jones, P. (Eds.). Recent Advances in Travel Demand Analysis. Gower, Aldershot, pp. 371-382.
29. Simchi-Levi, D., 1991. The capacitated traveling salesmen location problem. Transportation Science 25 (1), 9-18.
30. Solomon, M.M., Desrosiers, J., 1988. Time window constrained routing and scheduling problems. Transportation Science 22 (1), 1-13.
31. van Der Bruggen, L.J.J., Lenstra, J.K., Schuur, P.C., 1993. Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science 27 (3), 298-311.