Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

被引：139

作者：

Marinakis, Yannis ^{[1
]}

Iordanidou, Georgia-Roumbini ^{[1
]}

Marinaki, Magdalene ^{[1
]}

机构：

[1] Tech Univ Crete, Dept Prod Engn & Management, Khania 73100, Crete, Greece

来源：

APPLIED SOFT COMPUTING | 2013年 / 13卷 / 04期

关键词：

Particle Swarm Optimization; Path relinking; Vehicle Routing Problem with Stochastic; Demands; TIME WINDOWS; ALGORITHM; METAHEURISTICS; COMBINATORIAL; DELIVERY; TRAVEL;

D O I：

10.1016/j.asoc.2013.01.007

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper introduces a new hybrid algorithmic approach based on Particle Swarm Optimization (PSO) for successfully solving one of the most popular supply chain management problems, the Vehicle Routing Problem with Stochastic Demands (VRPSD). The VRPSD is a well known NP-hard problem in which a vehicle with finite capacity leaves from the depot with full load and has to serve a set of customers whose demands are known only when the vehicle arrives to them. A number of different variants of the PSO are tested and the one that performs better is used for solving benchmark instances from the literature. (C) 2013 Elsevier B. V. All rights reserved.

引用

页码：1693 / 1704

页数：12

共 58 条

[1] A review of particle swarm optimization. Part I: Background and development [J].

Banks A. ;

Vincent J. ;

Anyakoha C. .

Natural Computing, 2007, 6 (4) :467-484

[2] A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications [J].

Alec Banks ;

Jonathan Vincent ;

Chukwudi Anyakoha .

Natural Computing, 2008, 7 (1) :109-124

[3] Scenario-based planning for partially dynamic vehicle routing with stochastic customers [J].

Bent, RW ;

Van Hentenryck, P .

OPERATIONS RESEARCH, 2004, 52 (06) :977-987

[4]

Bianchi L., 2006, Journal of Mathematical Modelling and Algorithms, V5, P91, DOI DOI 10.1007/S10852-005-9033-Y

[5] A survey on metaheuristics for stochastic combinatorial optimization [J].

Bianchi L. ;

Dorigo M. ;

Gambardella L.M. ;

Gutjahr W.J. .

Natural Computing, 2009, 8 (2) :239-287

[6]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[7] CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].

BODIN, L ;

GOLDEN, B .

NETWORKS, 1981, 11 (02) :97-108

[8] A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands [J].

Christiansen, Christian H. ;

Lysgaard, Jens .

OPERATIONS RESEARCH LETTERS, 2007, 35 (06) :773-781

[9]

Christofides N., 1979, Combinatorial optimization, P315

[10] The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].

Clerc, M ;

Kennedy, J .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73

← 1 2 3 4 5 6 →