메뉴 건너뛰기




Volumn 17, Issue 1, 2005, Pages 10-24

Meta-heuristics for a class of demand-responsive transit systems

Author keywords

Demand adaptive; GRASP; Hybrids; Meta heuristics; Public transport; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; TRANSPORTATION;

EID: 14644397182     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0051     Document Type: Article
Times cited : (21)

References (19)
  • 3
    • 14644391019 scopus 로고    scopus 로고
    • Flexible many-to-few + few-to-many = An almost personalized transit system
    • Faculdade de Ciências da Universidade de Lisboa and Universidade dos Açores, São Miguel, Açores, Portugal
    • Crainic, T. G., F. Malucelli, M. Nonato. 2001a. Flexible many-to-few + few-to-many = an almost personalized transit system. Preprints TRISTAN IV - Triennial Sympos. Transportation Analysis, Vol. 2. Faculdade de Ciências da Universidade de Lisboa and Universidade dos Açores, São Miguel, Açores, Portugal, 435-440.
    • (2001) Preprints TRISTAN IV - Triennial Sympos. Transportation Analysis , vol.2 , pp. 435-440
    • Crainic, T.G.1    Malucelli, F.2    Nonato, M.3
  • 5
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • Feo, T. A., M. G. C. Resende. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6 109-133.
    • (1995) J. Global Optim. , vol.6 , pp. 109-133
    • Feo, T.A.1    Resende, M.G.C.2
  • 7
    • 0006082965 scopus 로고    scopus 로고
    • Metaheuristics for the vehicle routing problem
    • P. Toth, D. Vigo, eds. The Vehicle Routing Problem, SIAM, Philadelphia, PA
    • Gendreau, M., G. Laporte, J.-Y. Potvin. 2002. Metaheuristics for the vehicle routing problem. P. Toth, D. Vigo, eds. The Vehicle Routing Problem, Vol. 9. SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 129-154.
    • (2002) SIAM Monographs on Discrete Mathematics and Applications , vol.9 , pp. 129-154
    • Gendreau, M.1    Laporte, G.2    Potvin, J.-Y.3
  • 8
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Norwell, MA
    • Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 9
    • 0023451776 scopus 로고
    • Lagrangean decomposition: A model yielding stronger lagrangean bounds
    • Guignard, M., S. Kim. 1987. Lagrangean decomposition: A model yielding stronger lagrangean bounds. Math. Programming 39 215-228.
    • (1987) Math. Programming , vol.39 , pp. 215-228
    • Guignard, M.1    Kim, S.2
  • 10
    • 23044528292 scopus 로고    scopus 로고
    • Modeling cost and passenger level of service for integrated transit service
    • S. Voss, J. R. Daduna, eds. Computer-Aided Scheduling of Public Transport, Springer, Berlin, Germany
    • Hickman, M., K. Blume. 2001. Modeling cost and passenger level of service for integrated transit service. S. Voss, J. R. Daduna, eds. Computer-Aided Scheduling of Public Transport, Vol. 505. Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 233-251.
    • (2001) Lecture Notes in Economics and Mathematical Systems , vol.505 , pp. 233-251
    • Hickman, M.1    Blume, K.2
  • 11
    • 0036462727 scopus 로고    scopus 로고
    • Fleet scheduling and dispatching for demand-responsive passenger service
    • Horn, M. E. T. 2002. Fleet scheduling and dispatching for demand-responsive passenger service. Transportation Res. Part C 10 35-63.
    • (2002) Transportation Res. Part C , vol.10 , pp. 35-63
    • Horn, M.E.T.1
  • 13
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • Laporte, G. 1992a. The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 231-247.
    • (1992) Eur. J. Oper. Res. , vol.59 , pp. 231-247
    • Laporte, G.1
  • 14
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte, G. 1992b. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 345-358.
    • (1992) Eur. J. Oper. Res. , vol.59 , pp. 345-358
    • Laporte, G.1
  • 17
    • 84877081167 scopus 로고    scopus 로고
    • Formulations and bounding procedures for optimization problems arising in managing demand adaptive transit systems
    • Politecnico di Milano, Milan, Italy
    • Malucelli, F., M. Nonato. 2003. Formulations and bounding procedures for optimization problems arising in managing demand adaptive transit systems. Working paper, Politecnico di Milano, Milan, Italy.
    • (2003) Working Paper
    • Malucelli, F.1    Nonato, M.2
  • 18
    • 0012614657 scopus 로고    scopus 로고
    • Some proposals on flexible transit
    • T. A. Ciriani, S. Gliozzi, E. L. Johnson, R. Tadei, eds. Purdue University Press, Ashland, OH
    • Malucelli, F., M. Nonato, S. Pallottino. 1999. Some proposals on flexible transit. T. A. Ciriani, S. Gliozzi, E. L. Johnson, R. Tadei, eds. Oper. Res. Indust. Purdue University Press, Ashland, OH, 157-182.
    • (1999) Oper. Res. Indust. , pp. 157-182
    • Malucelli, F.1    Nonato, M.2    Pallottino, S.3
  • 19
    • 23044527152 scopus 로고    scopus 로고
    • Adaptive memory programming for a class of demand-responsive transit systems
    • S. Voss, J. R. Daduna, eds. Computer-Aided Scheduling of Public Transport, Springer, Berlin, Germany
    • Malucelli, F., M. Nonato, T. G. Crainic, F. Guertin. 2001. Adaptive memory programming for a class of demand-responsive transit systems. S. Voss, J. R. Daduna, eds. Computer-Aided Scheduling of Public Transport, Vol. 505. Lecture Notes in Econom. Math. Systems, Springer, Berlin, Germany, 253-273.
    • (2001) Lecture Notes in Econom. Math. Systems , vol.505 , pp. 253-273
    • Malucelli, F.1    Nonato, M.2    Crainic, T.G.3    Guertin, F.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.