메뉴 건너뛰기




Volumn 38, Issue 1, 2000, Pages 173-187

Solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTION OF GOODS; HEURISTIC METHODS; INTEGER PROGRAMMING; INTERACTIVE COMPUTER SYSTEMS; LINEAR PROGRAMMING; RESOURCE ALLOCATION;

EID: 0033690291     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00036-X     Document Type: Article
Times cited : (28)

References (17)
  • 2
    • 0027558256 scopus 로고
    • Simple heuristics for the vehicle routing problem with soft time windows
    • Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. Journal of Operational Research Society. 44:1993;279-287.
    • (1993) Journal of Operational Research Society , vol.44 , pp. 279-287
    • Balakrishnan, N.1
  • 4
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research. 12:1964;568-581.
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.2
  • 6
    • 0026852084 scopus 로고
    • Modeling intra-city time-dependent travel speeds for vehicle scheduling problems
    • Hill A.V., Benton W.C. Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. Journal of Operational Research Society. 43:1992;343-351.
    • (1992) Journal of Operational Research Society , vol.43 , pp. 343-351
    • Hill, A.V.1    Benton, W.C.2
  • 7
    • 0031140531 scopus 로고    scopus 로고
    • An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation
    • Kohl N., Madsen O.B.G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research. 45:1997;395-406.
    • (1997) Operations Research , vol.45 , pp. 395-406
    • Kohl, N.1    Madsen, O.B.G.2
  • 9
    • 84986942478 scopus 로고
    • Time-dependent traveling salesman problem-the delivery case
    • Lucena A. Time-dependent traveling salesman problem-the delivery case. Networks. 20:1990;753-763.
    • (1990) Networks , vol.20 , pp. 753-763
    • Lucena, A.1
  • 10
    • 0026904591 scopus 로고
    • Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms
    • Malandraki C., Daskin M.S. Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transportation Science. 26:1992;185-200.
    • (1992) Transportation Science , vol.26 , pp. 185-200
    • Malandraki, C.1    Daskin, M.S.2
  • 11
    • 0030215149 scopus 로고    scopus 로고
    • A genetic algorithm for service level based scheduling
    • Malmborg C.J. A genetic algorithm for service level based scheduling. European Journal of Operational Research. 93:1996;121-134.
    • (1996) European Journal of Operational Research , vol.93 , pp. 121-134
    • Malmborg, C.J.1
  • 12
    • 0028484707 scopus 로고
    • A microcomputer assistant for the development of vehicle routing and scheduling heuristics
    • Potvin J., Lapalme G., Rousseau J. A microcomputer assistant for the development of vehicle routing and scheduling heuristics. Decision Support System. 12:1994;41-56.
    • (1994) Decision Support System , vol.12 , pp. 41-56
    • Potvin, J.1    Lapalme, G.2    Rousseau, J.3
  • 13
    • 0027591102 scopus 로고
    • A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
    • Potvin J., Rousseau J. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research. 66:1993;331-340.
    • (1993) European Journal of Operational Research , vol.66 , pp. 331-340
    • Potvin, J.1    Rousseau, J.2
  • 14
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research. 35:1987;254-265.
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 17
    • 0037845543 scopus 로고
    • Heuristic bounds and test problem generation for the time-dependent traveling salesman problem
    • Wiel R.J.V., Sahinidis N.V. Heuristic bounds and test problem generation for the time-dependent traveling salesman problem. Transportation Science. 29:1995;167-183.
    • (1995) Transportation Science , vol.29 , pp. 167-183
    • Wiel, R.J.V.1    Sahinidis, N.V.2


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