A tabu search approach to an urban transport problem in northern Spain

Computers and Operations Research

Volumn 36, Issue 3, 2009, Pages 967-979

  Pacheco, Joaquín ^a   Alvarez, Ada ^b   Casado, Silvia ^a   González Velarde, José Luis ^c  

^a UNIVERSITY OF BURGOS   (Spain)

^b UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

^c SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

Local search; Metaheuristics; Tabu search; Urban transport

Indexed keywords

BUSES; FLEET OPERATIONS; TABU SEARCH;

BUS STOPS; CITY COUNCIL; DECISION LEVELS; LOCAL SEARCH; METAHEURISTICS; ON-DEMAND; OPTIMALITY; ROUTE DESIGN; SEARCH STRATEGIES; SERVICE LEVELS; TRANSPORT AUTHORITIES; URBAN TRANSPORT; WAITING-TIME;

PROBLEM SOLVING;

EID: 53749091299     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.12.002     Document Type: Article

References (26)

1. Axhausen K.W., and Smith R.L. Evaluation of heuristic transit network optimization algorithms. Transportation Research Record 976 (1984) 7-20
2. Wu J.H., Florian M., and Marcotte P. Transit equilibrium assignment: a model and solution algorithm. Transportation Science 28 3 (1994) 193-203
3. Israeli Y, Ceder A. Transit route design using scheduling and multiobjective programming techniques. Computer-Aided Transit Scheduling July 1993; 56-75.
4. Baaj M.H., and Mahmassani H. An AI-based approach for transit route system planning and design. Journal of Advanced Transportation 25 2 (1991) 187-210
5. Baaj M.H., and Mahmassani H. TRUST: a LISP program for the analysis of transit route configurations. Transportation Research Record 1283 (1992) 125-135
6. Ceder A., and Israeli Y. User and operator perspectives in transit network design. Transportation Research Record 1623 (1998) 3-7
7. Lampkin W., and Saalmans P.D. The design of routes, service frequencies and schedules for a municipal bus undertaking: a case study. Operations Research 18 4 (1967) 375-397
8. Rosello X. An heuristic algorithm to generate an urban buses networks. In: Roubens M. (Ed). Proceedings of the second European congress on operations research (1977), Stockholm 409-419
9. Mandl C.E. Evaluation and optimization of urban public transportation networks. Third European congress on operations research (1979), The Netherlands, Amsterdam
10. Mandl C.E. Evaluation and optimization of urban public transportation networks. European Journal of Operational Research 5 (1980) 396-404
11. Dubois D., Bel G., and Libre M. A set of methods in transportation network synthesis and analysis. Journal of Operational Research Society 30 9 (1979) 797-808
12. Hasselstrom D. Public transportation planning. PhD thesis, Department of Business Administration, University of Gothenburg, Sweden; 1981.
13. Keudel W. Computer-aided line network design (DIANA) and minimization of transfer times in networks (FABIAN). In: Daduna J.R., and Wren A. (Eds). Proceedings of the international workshop on computer-aided transit scheduling. Lecture notes in economics and mathematical sciences, no. 308 (1988), Springer, Berlin
14. Baaj M.H., and Mahmassani H. Hybrid route generation heuristic algorithm for the design of transit networks. Transportation Research Part C: Emerging Technologies 3 1 (1995) 31-50
15. Spiess H., and Florian M. Optimal strategies: a new assignment model for transit networks. Transportation Research-B 23 2 (1989) 83-102
16. Chakroborty P. Genetic algorithms for optimal urban transport design. Computer Aided Civil and Infrastructure Engineering 18 (2003) 184-200
17. Fan W., and Machemehl R.B. Using a simulated annealing algorithm to solve the transit route network design problem. Journal of Transportation Engineering-ASCE 132 2 (2006) 122-132
18. Fan W., and Machemehl R.B. A tabu search based heuristic method for the transit route network design problem. Conference on computer-aided scheduling public transport (August 2004), CASPT, San Diego
19. Fan W., and Machemehl R.B. Optimal transit route network design problem with variable transit demand: genetic algorithm approach. Journal of Transportation Engineering-ASCE 132 1 (2006) 40-51
20. Yang Z., Yu B., and Cheng C. A parallel Ant Colony algorithm for bus network optimization. Computer-Aided Civil and Infrastructure Engineering 22 1 (2007) 44-55
21. Glover F. Tabu search: part I. ORSA Journal on Computing 1 (1989) 190-206
22. Glover F. Tabu search: part II. ORSA Journal on Computing 2 (1990) 4-32
23. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
24. Golden B, Bodin L, Doyle, T, Stewart Jr W. Approximate traveling salesman algorithms. Operations Research 1980;28(3)(part II):649-711.
25. Or I. Travelling salesman type combinatorial problems and their relations to the logistics of blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University; 1976.
26. Taillard E., Badeau P., Gendreu M., Guertain F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with time windows. Transportation Science 31 (1997) 170-186