메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2989-2994

Using randomization to solve the deterministic single and multiple vehicle routing problem with service time constraints

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TIME; INITIAL TIME; LOWER BOUNDS; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; ROUTE PLANNING; SERVICE REQUESTS; SERVICE TIME; VEHICLE ROUTING PROBLEMS;

EID: 77951588459     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2009.5429227     Document Type: Conference Paper
Times cited : (8)

References (20)
  • 1
    • 8344229228 scopus 로고    scopus 로고
    • An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
    • Baldacci, R., E.A. Hadjiconstantinou and A. Mingozzi. 2004. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52: 723-738.
    • (2004) Operations Research , vol.52 , pp. 723-738
    • Baldacci, R.1    Hadjiconstantinou, E.A.2    Mingozzi, A.3
  • 2
    • 0018479041 scopus 로고
    • VEHICLE SCHEDULING PROBLEM and MONTE CARLO SIMULATION
    • Buxey, G. 1979. The Vehicle Scheduling Problem and Monte Carlo Simulation. Journal of Operational Research Society 30: 563-573. (Pubitemid 9456615)
    • (1979) Journal of the Operational Research Society , vol.30 , Issue.6 , pp. 563-573
    • Buxey, G.M.1
  • 3
    • 0006112432 scopus 로고    scopus 로고
    • VRP with time windows
    • ed. P. Toth and D. Vigo, Philadelphia: SIAM Monographs on Discrete Mathematics and Applications
    • Cordeau, J.F., G. Desaulniers, J. Desrosiers, M.M. Solomon and F. Soumis. 2002a. VRP with time windows. In The Vehicle Routing Problem, ed. P. Toth and D. Vigo, 157-193. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
    • (2002) The Vehicle Routing Problem , pp. 157-193
    • Cordeau, J.F.1    Desaulniers, G.2    Desrosiers, J.3    Solomon, M.M.4    Soumis, F.5
  • 9
    • 55349121423 scopus 로고    scopus 로고
    • A Real Delivery Problem Dealt with Monte Carlo Techniques
    • Fernandez, P., L. Garcia, A. Mayado and J. Sanchis. 2000. A Real Delivery Problem Dealt with Monte Carlo Techniques. TOP 8: 57-71.
    • (2000) TOP , vol.8 , pp. 57-71
    • Fernandez, P.1    Garcia, L.2    Mayado, A.3    Sanchis, J.4
  • 10
    • 2542474653 scopus 로고    scopus 로고
    • Metaheuristics for the VRP
    • ed. P. Toth and D. Vigo, Philadelphia: SIAM Monographs on Discrete Mathematics and Applications
    • Gendreau, M., G. Laporte and J.Y. Potvin. 2002. Metaheuristics for the VRP. In The Vehicle Routing Problem, ed. P. Toth and D. Vigo, 129-154. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
    • (2002) The Vehicle Routing Problem , pp. 129-154
    • Gendreau, M.1    Laporte, G.2    Potvin, J.Y.3
  • 12
    • 77951558411 scopus 로고    scopus 로고
    • Solving the capacitated vehicle routing problem with maximum traveling distance and service time requirements: An approach based on Monte Carlo Simulation
    • ed. M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin and R. G. Ingalls. To appear
    • Juan, A.A., F. Adelantado, J. Faulin and J.R. Montoya-Torres. 2009a. Solving the capacitated vehicle routing problem with maximum traveling distance and service time requirements : An approach based on Monte Carlo Simulation. In Proceedings of the 2009 Winter Simulation Conference, ed. M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin and R. G. Ingalls. To appear.
    • (2009) Proceedings of the 2009 Winter Simulation Conference
    • Juan, A.A.1    Adelantado, F.2    Faulin, J.3    Montoya-Torres, J.R.4
  • 13
    • 77951538804 scopus 로고    scopus 로고
    • Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem
    • ed. J. Chinneck, B. Kristjansson and M. Saltzman, New York: Springer
    • Juan, A., J. Faulin, R. Ruiz, B. Barrios, M. Gilibert and X. Vilajosana. 2009b. Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. In Operations Research and Cyber-Infrastructure, ed. J. Chinneck, B. Kristjansson and M. Saltzman, 331-346. New York: Springer.
    • (2009) Operations Research and Cyber-Infrastructure , pp. 331-346
    • Juan, A.1    Faulin, J.2    Ruiz, R.3    Barrios, B.4    Gilibert, M.5    Vilajosana, X.6
  • 14
    • 0035841877 scopus 로고    scopus 로고
    • Heuristic scheduling of parallel machines with sequence-dependent set-up times
    • DOI 10.1080/00207540110064938
    • Kurz, M.E. and R.G. Askin. 2001. Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research 39: 3747-3769. (Pubitemid 35165511)
    • (2001) International Journal of Production Research , vol.39 , Issue.16 , pp. 3747-3769
    • Kurz, M.E.1    Askin, R.G.2
  • 15
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte G. 1992. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59: 345-358.
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 16
    • 0006038590 scopus 로고    scopus 로고
    • Classical heuristics for the capacitated VRP
    • ed. P. Toth and D. Vigo, Philadelphia: SIAM Monographs on Discrete Mathematics and Applications
    • Laporte, G. and F. Semet. 2002. Classical heuristics for the capacitated VRP. In The Vehicle Routing Problem, ed. P. Toth and D. Vigo, 109-128. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
    • (2002) The Vehicle Routing Problem , pp. 109-128
    • Laporte, G.1    Semet, F.2
  • 19
    • 26944467731 scopus 로고    scopus 로고
    • Branch-and-cut algorithms for the capacitated VRP
    • ed. P. Toth and D. Vigo, Philadelphia: SIAM Monographs on Discrete Mathematics and Applications
    • Naddef, D. and G. Rinaldi. 2002. Branch-and-cut algorithms for the capacitated VRP. In The Vehicle Routing Problem, ed. P. Toth and D. Vigo, 53-84. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
    • (2002) The Vehicle Routing Problem , pp. 53-84
    • Naddef, D.1    Rinaldi, G.2
  • 20
    • 0041791136 scopus 로고    scopus 로고
    • Philadelphia: SIAM Monographs on Discrete Mathematics and Applications
    • Toth, P. and D. Vigo. 2001. The Vehicle Routing Problem. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
    • (2001) The Vehicle Routing Problem
    • Toth, P.1    Vigo, D.2


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