메뉴 건너뛰기




Volumn 37, Issue 11, 2010, Pages 1886-1898

A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Author keywords

Evolutionary algorithms; Memetic algorithms; Multi compartment vehicle routing problem; Stochastic demands

Indexed keywords

CUSTOMER DEMANDS; DEMAND FLUCTUATIONS; DETERMINISTIC ROUTING; EXISTING METHOD; GENETIC OPERATORS; LOCAL SEARCH; MEMETIC ALGORITHMS; SET OF CUSTOMERS; SPARE CAPACITY; STOCHASTIC DEMAND; STOCHASTIC DEMANDS; STOCHASTIC NATURE; VEHICLE ROUTING PROBLEMS;

EID: 77951107511     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.015     Document Type: Article
Times cited : (146)

References (42)
  • 1
    • 0141525177 scopus 로고    scopus 로고
    • Solving a fuel delivery problem by heuristic and exact approaches
    • Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research 152 1 (2004) 170-179
    • (2004) European Journal of Operational Research , vol.152 , Issue.1 , pp. 170-179
    • Avella, P.1    Boccia, M.2    Sforza, A.3
  • 2
    • 55349109504 scopus 로고    scopus 로고
    • Beasley JE. OR Library: 〈http://people.brunel.ac.uk/∼mastjjb/jeb/info.html〉.
    • Library
    • Beasley, J.O.1
  • 3
    • 0037669027 scopus 로고    scopus 로고
    • Deliveries of liquid fuels to SNDP gas stations using vehicles with multiple compartments
    • man and cybernetics
    • Ben Abdelaziz F, Roucairol C, Bacha C. Deliveries of liquid fuels to SNDP gas stations using vehicles with multiple compartments. In: IEEE international conference on systems, man and cybernetics, 2002.
    • (2002) IEEE international conference on systems
    • Ben Abdelaziz, F.1    Roucairol, C.2    Bacha, C.3
  • 4
    • 0026923887 scopus 로고
    • Fast algorithms for geometric traveling salesman problem
    • Bentley J.B. Fast algorithms for geometric traveling salesman problem. INFORMS Journal on Computing 4 (1992) 387-411
    • (1992) INFORMS Journal on Computing , vol.4 , pp. 387-411
    • Bentley, J.B.1
  • 6
    • 0001305305 scopus 로고
    • A vehicle routing problem with stochastic demand
    • Bertsimas D. A vehicle routing problem with stochastic demand. Operations Research 40 3 (1992) 574-585
    • (1992) Operations Research , vol.40 , Issue.3 , pp. 574-585
    • Bertsimas, D.1
  • 8
    • 0001195854 scopus 로고
    • Real-time, wide area dispatch of Mobil tank trucks
    • Brown G., Ellis C., and Graves G. Real-time, wide area dispatch of Mobil tank trucks. Interfaces 17 1 (1987) 107-120
    • (1987) Interfaces , vol.17 , Issue.1 , pp. 107-120
    • Brown, G.1    Ellis, C.2    Graves, G.3
  • 9
    • 0019396774 scopus 로고
    • Real-time dispatch of petroleum tanks trucks
    • Brown G., and Graves G. Real-time dispatch of petroleum tanks trucks. Management Science 27 1 (1981) 19-32
    • (1981) Management Science , vol.27 , Issue.1 , pp. 19-32
    • Brown, G.1    Graves, G.2
  • 10
    • 34748829281 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
    • Christiansen C., and Lysgaard J. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters 35 6 (2007) 773-781
    • (2007) Operations Research Letters , vol.35 , Issue.6 , pp. 773-781
    • Christiansen, C.1    Lysgaard, J.2
  • 11
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G., and Wright J.V. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 4 (1964) 568-581
    • (1964) Operations Research , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.V.2
  • 13
    • 0022661837 scopus 로고
    • Stochastic vehicle routing with modified savings algorithm
    • Dror M., and Trudeau P. Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 23 2 (1986) 228-235
    • (1986) European Journal of Operational Research , vol.23 , Issue.2 , pp. 228-235
    • Dror, M.1    Trudeau, P.2
  • 14
    • 34748820002 scopus 로고    scopus 로고
    • A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
    • El Fallahi A., Prins C., and Wolfler Calvo R. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research 35 5 (2008) 1725-1741
    • (2008) Computers & Operations Research , vol.35 , Issue.5 , pp. 1725-1741
    • El Fallahi, A.1    Prins, C.2    Wolfler Calvo, R.3
  • 16
    • 35048870799 scopus 로고    scopus 로고
    • Evolutionary algorithms for stochastic arc routing problems
    • EvoWorkShops 2004, Berlin, Heidelberg: Springer;
    • Fleury G, Lacomme P, Prins C. Evolutionary algorithms for stochastic arc routing problems. In: EvoWorkShops 2004. Lecture notes in computer science, vol. 3005. Berlin, Heidelberg: Springer; 2004. p. 501-12.
    • (2004) Lecture notes in computer science , vol.3005 , pp. 501-512
    • Fleury, G.1    Lacomme, P.2    Prins, C.3
  • 18
    • 0000461093 scopus 로고
    • An exact algorithm for the vehicle routing problem with stochastic customers and demands
    • Gendreau M., Laporte G., and Séguin R. An exact algorithm for the vehicle routing problem with stochastic customers and demands. Transportation Science 29 2 (1995) 143-155
    • (1995) Transportation Science , vol.29 , Issue.2 , pp. 143-155
    • Gendreau, M.1    Laporte, G.2    Séguin, R.3
  • 20
    • 0030134790 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
    • Gendreau M., Laporte G., and Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44 3 (1996) 469-477
    • (1996) Operations Research , vol.44 , Issue.3 , pp. 469-477
    • Gendreau, M.1    Laporte, G.2    Séguin, R.3
  • 21
    • 0036563024 scopus 로고    scopus 로고
    • An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
    • Laporte G., Loveaux F., and Van Hamme L. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research 50 3 (2002) 415-423
    • (2002) Operations Research , vol.50 , Issue.3 , pp. 415-423
    • Laporte, G.1    Loveaux, F.2    Van Hamme, L.3
  • 23
    • 0036924088 scopus 로고    scopus 로고
    • SSJ: a framework for stochastic simulation in Java
    • Yücesan E., Chen C.H., Snowdon J.L., and Charnes J.M. (Eds), IEEE Press, New York
    • L'Ecuyer P., Meliani L., and Vaucher J. SSJ: a framework for stochastic simulation in Java. In: Yücesan E., Chen C.H., Snowdon J.L., and Charnes J.M. (Eds). Proceedings of the 2002 winter simulation conference (2002), IEEE Press, New York 234-242
    • (2002) Proceedings of the 2002 winter simulation conference , pp. 234-242
    • L'Ecuyer, P.1    Meliani, L.2    Vaucher, J.3
  • 24
    • 77951141834 scopus 로고    scopus 로고
    • Approximating the expected cost of recourse on a multi-compartment vehicle routing problem with stochastic demands
    • Technical Report 08/03/AUTO, Institut de Recherche en Communications et Cybernétique de Nantes IRCCyN, École des Mines de Nantes, France;
    • Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N. Approximating the expected cost of recourse on a multi-compartment vehicle routing problem with stochastic demands. Technical Report 08/03/AUTO, Institut de Recherche en Communications et Cybernétique de Nantes (IRCCyN). École des Mines de Nantes, France; 2008.
    • (2008)
    • Mendoza, J.E.1    Castanier, B.2    Guéret, C.3    Medaglia, A.L.4    Velasco, N.5
  • 25
    • 77951112148 scopus 로고    scopus 로고
    • An instance generator for vehicle routing problems with stochastic demands
    • Technical Report 08/1/AUTO, Institut de Recherche en Communications et Cybernétique de Nantes IRCCyN, École des Mines de Nantes, France;
    • Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N. An instance generator for vehicle routing problems with stochastic demands. Technical Report 08/1/AUTO, Institut de Recherche en Communications et Cybernétique de Nantes (IRCCyN). École des Mines de Nantes, France; 2008.
    • (2008)
    • Mendoza, J.E.1    Castanier, B.2    Guéret, C.3    Medaglia, A.L.4    Velasco, N.5
  • 27
    • 58749102194 scopus 로고    scopus 로고
    • An evolutionary-based decision support system for vehicle routing: the case of a public utility
    • Mendoza J.E., Medaglia A.L., and Velasco N. An evolutionary-based decision support system for vehicle routing: the case of a public utility. Decision Support Systems 46 3 (2009) 730-742
    • (2009) Decision Support Systems , vol.46 , Issue.3 , pp. 730-742
    • Mendoza, J.E.1    Medaglia, A.L.2    Velasco, N.3
  • 28
    • 0002345223 scopus 로고    scopus 로고
    • Memetic algorithms: a short introduction
    • Corne D., Dorigo M., and Glover F. (Eds), McGraw-Hill, New York
    • Moscato P. Memetic algorithms: a short introduction. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York 219-234
    • (1999) New ideas in optimization , pp. 219-234
    • Moscato, P.1
  • 30
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31 12 (2004) 1985-2002
    • (2004) Computers & Operations Research , vol.31 , Issue.12 , pp. 1985-2002
    • Prins, C.1
  • 31
    • 77951129295 scopus 로고    scopus 로고
    • Rei W, Gendreau M, Soriano P. A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Technical Report CIRRELT-2007-24, Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT); 2007.
    • Rei W, Gendreau M, Soriano P. A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Technical Report CIRRELT-2007-24, Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT); 2007.
  • 32
    • 77951139076 scopus 로고    scopus 로고
    • Rei W, Gendreau M, Soriano P. Local branching cuts for the 0-1 integer L-shaped algorithm. Technical Report CIRRELT-2007-23, Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT); 2007.
    • Rei W, Gendreau M, Soriano P. Local branching cuts for the 0-1 integer L-shaped algorithm. Technical Report CIRRELT-2007-23, Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT); 2007.
  • 34
    • 0034086424 scopus 로고    scopus 로고
    • Comparing neuro dynamic programming algorithms for the vehicle routing problem with stochastic demands
    • Secomandi N. Comparing neuro dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research 27 (2000) 1201-1225
    • (2000) Computers & Operations Research , vol.27 , pp. 1201-1225
    • Secomandi, N.1
  • 35
    • 77951122523 scopus 로고    scopus 로고
    • Reoptimization approaches for the vehicle-routing problem with stochastic demands
    • Secomandi N, Margot F. Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations Research 2008:1-17.
    • (2008) Operations Research , pp. 1-17
    • Secomandi, N.1    Margot, F.2
  • 37
    • 26444605411 scopus 로고    scopus 로고
    • MA | PM: memetic algorithms with population management
    • Sörensen K., and Sevaux M. MA | PM: memetic algorithms with population management. Computers & Operations Research 33 5 (2006) 1214-1225
    • (2006) Computers & Operations Research , vol.33 , Issue.5 , pp. 1214-1225
    • Sörensen, K.1    Sevaux, M.2
  • 39
    • 40749112799 scopus 로고    scopus 로고
    • A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty
    • Sungur I., Ordóñez F., and Dessouky M.M. A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions 40 5 (2008) 509-523
    • (2008) IIE Transactions , vol.40 , Issue.5 , pp. 509-523
    • Sungur, I.1    Ordóñez, F.2    Dessouky, M.M.3
  • 40
    • 60649090386 scopus 로고    scopus 로고
    • Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
    • Tatarakis A., and Minis I. Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns. European Journal of Operational Research 197 2 (2008) 2
    • (2008) European Journal of Operational Research , vol.197 , Issue.2 , pp. 2
    • Tatarakis, A.1    Minis, I.2
  • 41
    • 0029264176 scopus 로고
    • Reconsidering the distribution structure of gasoline products for a large oil company
    • Van Der Bruggen R., Gruson L., and Salomon M. Reconsidering the distribution structure of gasoline products for a large oil company. European Journal of Operational Research 81 3 (1995) 460-473
    • (1995) European Journal of Operational Research , vol.81 , Issue.3 , pp. 460-473
    • Van Der Bruggen, R.1    Gruson, L.2    Salomon, M.3
  • 42
    • 0033905257 scopus 로고    scopus 로고
    • Stochastic vehicle routing with restocking
    • Yang W.H., Mathur K., and Ballou R. Stochastic vehicle routing with restocking. Transportation Science 34 1 (2000) 99-112
    • (2000) Transportation Science , vol.34 , Issue.1 , pp. 99-112
    • Yang, W.H.1    Mathur, K.2    Ballou, R.3


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