메뉴 건너뛰기




Volumn 12, Issue 4, 2012, Pages 1247-1258

Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport

Author keywords

Demand responsive transport; Dial a ride problem; Evolutionary algorithm; Local search; Multi objective combinatorial optimization

Indexed keywords

COMPROMISE SOLUTIONS; DECISION MAKERS; DEMAND RESPONSIVE TRANSPORT; DIAL-A-RIDE PROBLEM; EVOLUTIONARY APPROACH; LOCAL SEARCH; MULTI OBJECTIVE; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; OPERATIONAL COSTS; SEARCH PROCESS; STATE-OF-THE-ART ALGORITHMS; TAXI SERVICES;

EID: 84857118484     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.12.014     Document Type: Article
Times cited : (68)

References (29)
  • 2
    • 34250181291 scopus 로고    scopus 로고
    • The dial-a-ride problem: Models and algorithms
    • Cordeau J.-F., and Laporte G. The dial-a-ride problem: Models and algorithms Annals of Operations Research 153 1 2007 29 46
    • (2007) Annals of Operations Research , vol.153 , Issue.1 , pp. 29-46
    • Cordeau, J.-F.1    Laporte, G.2
  • 5
    • 39649088959 scopus 로고    scopus 로고
    • Multi-objective vehicle routing problems
    • DOI 10.1016/j.ejor.2007.05.055, PII S0377221707005498
    • Jozefowiez N., Semet F., and Talbi E.-G. Multi-objective vehicle routing problems European Journal of Operational Research 189 2 2008 293 309 (Pubitemid 351288509)
    • (2008) European Journal of Operational Research , vol.189 , Issue.2 , pp. 293-309
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.-G.3
  • 6
    • 0002600091 scopus 로고
    • The general pickup and delivery problem
    • Savelsberg M.W., and Sol M. The general pickup and delivery problem Transportation Science 1 29 1995 17 29
    • (1995) Transportation Science , vol.1 , Issue.29 , pp. 17-29
    • Savelsberg, M.W.1    Sol, M.2
  • 8
    • 0013458646 scopus 로고
    • The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems
    • Ulungu E.L., and Teghem J. The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems Foundations of Computing and Decision Sciences 20 2 1995 149 165
    • (1995) Foundations of Computing and Decision Sciences , vol.20 , Issue.2 , pp. 149-165
    • Ulungu, E.L.1    Teghem, J.2
  • 9
    • 34648839878 scopus 로고    scopus 로고
    • Two phase algorithms for the bi-objective assignment problem
    • DOI 10.1016/j.ejor.2006.12.054, PII S0377221707000781
    • Przybylski A., Gandibleux X., and Ehrgott M. Two phase algorithms for the bi-objective assignment problem European Journal of Operational Research 185 2 2008 509 533 (Pubitemid 47454672)
    • (2008) European Journal of Operational Research , vol.185 , Issue.2 , pp. 509-533
    • Przybylski, A.1    Gandibleux, X.2    Ehrgott, M.3
  • 10
    • 69249226219 scopus 로고    scopus 로고
    • K-PPM. A new exact method to solve multi-objective combinatorial optimization problems
    • Dhaenens C., Lemesre J., and Talbi E. K-PPM. A new exact method to solve multi-objective combinatorial optimization problems European Journal of Operational Research 200 1 2010 45 53
    • (2010) European Journal of Operational Research , vol.200 , Issue.1 , pp. 45-53
    • Dhaenens, C.1    Lemesre, J.2    Talbi, E.3
  • 11
    • 15244361840 scopus 로고    scopus 로고
    • A grouping genetic algorithm for the pickup and delivery problem with time windows
    • DOI 10.1007/s00291-004-0173-7
    • Pankratz G. A grouping genetic algorithm for the pickup and delivery problem with time windows OR Spectrum 27 1 2005 21 41 (Pubitemid 40389669)
    • (2005) OR Spectrum , vol.27 , Issue.1 , pp. 21-41
    • Pankratz, G.1
  • 14
    • 84857112020 scopus 로고    scopus 로고
    • Genetic algorithm for a pickup and delivery problem with time windows, Transportation Research Record
    • Jung S., and Haghani A. Genetic algorithm for a pickup and delivery problem with time windows, Transportation Research Record Journal of the Transportation Research Board 1733 2000 2007 1 7
    • (2007) Journal of the Transportation Research Board , vol.1733 , Issue.2000 , pp. 1-7
    • Jung, S.1    Haghani, A.2
  • 15
  • 16
    • 71749112846 scopus 로고    scopus 로고
    • A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
    • Parragh S.N., Doerner K.F., Hartl R.F., and Gandibleux X. A heuristic two-phase solution approach for the multi-objective dial-a-ride problem Networks 54 2009 227 242
    • (2009) Networks , vol.54 , pp. 227-242
    • Parragh, S.N.1    Doerner, K.F.2    Hartl, R.F.3    Gandibleux, X.4
  • 20
    • 0036530772 scopus 로고    scopus 로고
    • A fast and elitist multiobjective genetic algorithm: NSGA-II
    • DOI 10.1109/4235.996017, PII S1089778X02041012
    • Deb K., Agrawal S., Pratap A., and Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2 2002 182 197 (Pubitemid 34555372)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.2 , pp. 182-197
    • Deb, K.1    Pratap, A.2    Agarwal, S.3    Meyarivan, T.4
  • 21
    • 0004140075 scopus 로고    scopus 로고
    • Tech. Rep. 103, Computer Engineering and Networks Lab (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland
    • E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the strength pareto evolutionary algorithm, Tech. Rep. 103, Computer Engineering and Networks Lab (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2001.
    • (2001) SPEA2: Improving the Strength Pareto Evolutionary Algorithm
    • Zitzler, E.1    Laumanns, M.2    Thiele, L.3
  • 24
    • 78649491467 scopus 로고    scopus 로고
    • A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO
    • Liefooghe A., Jourdan L., and Talbi E.-G. A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO European Journal of Operational Research 209 2 2011 104 112
    • (2011) European Journal of Operational Research , vol.209 , Issue.2 , pp. 104-112
    • Liefooghe, A.1    Jourdan, L.2    Talbi, E.-G.3
  • 25
    • 33845302339 scopus 로고    scopus 로고
    • The bi-objective covering tour problem
    • DOI 10.1016/j.cor.2005.07.022, PII S0305054805002480
    • Jozefowiez N., Semet F., and Talbi E.-G. The bi-objective covering tour problem Computers & Operations Research 34 2007 1929 1942 (Pubitemid 44879765)
    • (2007) Computers and Operations Research , vol.34 , Issue.7 , pp. 1929-1942
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.-G.3


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