메뉴 건너뛰기




Volumn 20, Issue 1, 2012, Pages 19-43

Exact hybrid algorithms for solving a bi-objective vehicle routing problem

Author keywords

Branch and cut; Capacitated vehicle routing problem; Distance constraints; Genetic algorithms; Multiobjective combinatorial optimization; NSGA II

Indexed keywords


EID: 84856500658     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-010-0158-3     Document Type: Article
Times cited : (29)

References (34)
  • 1
    • 0030166264 scopus 로고    scopus 로고
    • A new subtour elimination constraint for the vehicle routing problem
    • Achuthan NR, Caccetta L, Hill SP (1996) A new subtour elimination constraint for the vehicle routing problem. Eur J Oper Res 91: 573-586.
    • (1996) Eur J Oper Res , vol.91 , pp. 573-586
    • Achuthan, N.R.1    Caccetta, L.2    Hill, S.P.3
  • 2
    • 0034259805 scopus 로고    scopus 로고
    • A polyhedral study of the asymmetric traveling salesman problem with time windows
    • Ascheuer N, Fischetti M, Grötschl M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2): 69-79.
    • (2000) Networks , vol.36 , Issue.2 , pp. 69-79
    • Ascheuer, N.1    Fischetti, M.2    Grötschl, M.3
  • 3
    • 0008439086 scopus 로고    scopus 로고
    • Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
    • Ascheuer N, Fischetti M, Grötschl M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math Program 90: 475-506.
    • (2001) Math Program , vol.90 , pp. 475-506
    • Ascheuer, N.1    Fischetti, M.2    Grötschl, M.3
  • 5
    • 8344229228 scopus 로고    scopus 로고
    • An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
    • Baldacci R, Hadjiconstantinou E, Mingozzi A (2004) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52(5): 723-738.
    • (2004) Oper Res , vol.52 , Issue.5 , pp. 723-738
    • Baldacci, R.1    Hadjiconstantinou, E.2    Mingozzi, A.3
  • 6
    • 27744588516 scopus 로고    scopus 로고
    • The multiple traveling salesman problem: an overview of formulations and solution procedures
    • Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3): 209-219.
    • (2006) Omega , vol.34 , Issue.3 , pp. 209-219
    • Bektas, T.1
  • 7
    • 54049149435 scopus 로고    scopus 로고
    • An exact ε-constraint method for bi-objective combinatorial problems: application to the traveling salesman problem with profits
    • Bérubé J-F, Gendreau M, Potvin J-Y (2009) An exact ε-constraint method for bi-objective combinatorial problems: application to the traveling salesman problem with profits. Eur J Oper Res 194: 39-50.
    • (2009) Eur J Oper Res , vol.194 , pp. 39-50
    • Bérubé, J.-F.1    Gendreau, M.2    Potvin, J.-Y.3
  • 8
    • 25444507229 scopus 로고    scopus 로고
    • A scatter search for the periodic capacitated arc routing problem
    • Chu F, Labadi N, Prins C (2006) A scatter search for the periodic capacitated arc routing problem. Eur J Oper Res 169(2): 586-605.
    • (2006) Eur J Oper Res , vol.169 , Issue.2 , pp. 586-605
    • Chu, F.1    Labadi, N.2    Prins, C.3
  • 14
    • 0015094608 scopus 로고
    • On a bicriterion formulation of the problems of integrated system identification and system optimization
    • Haimes Y, Lasdon L, Wismer D (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans Syst Man Cybern 1: 296-297.
    • (1971) IEEE Trans Syst Man Cybern , vol.1 , pp. 296-297
    • Haimes, Y.1    Lasdon, L.2    Wismer, D.3
  • 15
    • 0001050402 scopus 로고
    • The traveling salesman problem and minimum spanning trees
    • Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18: 1135-1162.
    • (1970) Oper Res , vol.18 , pp. 1135-1162
    • Held, M.1    Karp, R.M.2
  • 16
    • 84944319341 scopus 로고    scopus 로고
    • Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem
    • J. Guervos (Ed.), Granada: Springer
    • Jozefowiez N, Semet F, Talbi EG (2002) Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem. In: Guervos J (eds) Parallel problem solving from nature-PPSN VII, LNCS. Springer, Granada.
    • (2002) Parallel Problem Solving from Nature-PPSN VII, LNCS
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.G.3
  • 18
    • 39649088959 scopus 로고    scopus 로고
    • Multi-objective vehicle routing problems
    • Jozefowiez N, Semet F, Talbi EG (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189(2): 293-309.
    • (2008) Eur J Oper Res , vol.189 , Issue.2 , pp. 293-309
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.G.3
  • 19
    • 0021385514 scopus 로고
    • Two exact algorithms for the distance constrained vehicle routing problem
    • Laporte G, Desrochers M, Nobert Y (1984) Two exact algorithms for the distance constrained vehicle routing problem. Networks 14: 161-172.
    • (1984) Networks , vol.14 , pp. 161-172
    • Laporte, G.1    Desrochers, M.2    Nobert, Y.3
  • 20
    • 0022678438 scopus 로고
    • An exact algorithm for the asymmetrical capacitated vehicle routing problem
    • Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16.
    • (1986) Networks , pp. 16
    • Laporte, G.1    Mercure, H.2    Nobert, Y.3
  • 21
    • 27144455754 scopus 로고    scopus 로고
    • An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
    • Laumanns M, Thiele L, Zitzler E (2006) An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur J Oper Res 169(3).
    • (2006) Eur J Oper Res , vol.169 , Issue.3
    • Laumanns, M.1    Thiele, L.2    Zitzler, E.3
  • 23
    • 21144444352 scopus 로고    scopus 로고
    • A new branch-and-cut algorithm for the capacitated vehicle routing problem
    • Lysgaard J, Letchford AN, Eglese RW (2003) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100: 2004.
    • (2003) Math Program , vol.100 , pp. 2004
    • Lysgaard, J.1    Letchford, A.N.2    Eglese, R.W.3
  • 26
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31: 1985-2002.
    • (2004) Comput Oper Res , vol.31 , pp. 1985-2002
    • Prins, C.1
  • 27
    • 84856424424 scopus 로고    scopus 로고
    • An improved algorithm for biobjective integer programming and its application to network routing problems
    • Ralphs TK, Saltzman M, Wiecek M (2004) An improved algorithm for biobjective integer programming and its application to network routing problems. Ann Oper Res.
    • (2004) Ann Oper Res
    • Ralphs, T.K.1    Saltzman, M.2    Wiecek, M.3
  • 30
    • 0031246770 scopus 로고    scopus 로고
    • Estimating the Held-Karp lower bound for the geometric TSP
    • Valenzuela CL, Jones AJ (1997) Estimating the Held-Karp lower bound for the geometric TSP. Eur J Oper Res 102(1): 157-175.
    • (1997) Eur J Oper Res , vol.102 , Issue.1 , pp. 157-175
    • Valenzuela, C.L.1    Jones, A.J.2
  • 31
    • 0019914372 scopus 로고
    • A branch and bound algorithm for the symmetric traveling salesman problem based on 1-tree relaxation
    • Volgenant T, Jonker R (1982) A branch and bound algorithm for the symmetric traveling salesman problem based on 1-tree relaxation. Eur J Oper Res 9: 83-89.
    • (1982) Eur J Oper Res , vol.9 , pp. 83-89
    • Volgenant, T.1    Jonker, R.2
  • 32
    • 84878545782 scopus 로고    scopus 로고
    • Multiobjective optimization using evolutionary algorithms-a comparative case study
    • Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms-a comparative case study. Lect Notes Comput Sci 292-304.
    • (1998) Lect Notes Comput Sci , pp. 292-304
    • Zitzler, E.1    Thiele, L.2
  • 34
    • 37249040048 scopus 로고    scopus 로고
    • The hypervolume indicator revisited: on the design of pareto-compliant indicators via weighted integration
    • Zitzler E, Brockhoff D, Thiele L (2007) The hypervolume indicator revisited: on the design of pareto-compliant indicators via weighted integration. Lect Notes Comput Sci 4403: 862.
    • (2007) Lect Notes Comput Sci , vol.4403 , pp. 862
    • Zitzler, E.1    Brockhoff, D.2    Thiele, L.3


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