A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery.

*(English)*Zbl 1179.90068Summary: This paper proposes a formulation of the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) and a particle swarm optimization (PSO) algorithm for solving it. The formulation is a generalization of three existing VRPSPD formulations. The main PSO algorithm is developed based on GLNPSO, a PSO algorithm with multiple social structures. A random key-based solution representation and decoding method is proposed for implementing PSO for VRPSPD. The solution representation for VRPSPD with \(n\) customers and \(m\) vehicles is a (n+2m)-dimensional particle. The decoding method starts by transforming the particle to a priority list of customers to enter the route and a priority matrix of vehicles to serve each customer. The vehicle routes are constructed based on the customer priority list and vehicle priority matrix. The proposed algorithm is tested using three benchmark data sets available from the literature. The computational result shows that the proposed method is competitive with other published results for solving VRPSPD. Some new best known solutions of the benchmark problem are also found by the proposed method.

Scope and Purpose

This paper applies a real-value version of particle swarm optimization (PSO) algorithm for solving the vehicle routing problem with simultaneous pickup and delivery (VRPSPD). The VRPSPD formulation is reformulated and generalized from three existing formulations in the literature. The purposes of this paper are to explain the mechanism of the PSO for solving VRPSPD and to demonstrate the effectiveness of the proposed method.

Scope and Purpose

This paper applies a real-value version of particle swarm optimization (PSO) algorithm for solving the vehicle routing problem with simultaneous pickup and delivery (VRPSPD). The VRPSPD formulation is reformulated and generalized from three existing formulations in the literature. The purposes of this paper are to explain the mechanism of the PSO for solving VRPSPD and to demonstrate the effectiveness of the proposed method.

##### MSC:

90B20 | Traffic problems in operations research |

##### Keywords:

vehicle routing problem; simultaneously pickup and delivery; particle swarm optimization; random key representation; metaheuristics##### Software:

VRP
PDF
BibTeX
XML
Cite

\textit{T. J. Ai} and \textit{V. Kachitvichyanukul}, Comput. Oper. Res. 36, No. 5, 1693--1702 (2009; Zbl 1179.90068)

Full Text:
DOI

##### References:

[1] | Christofides, N.; Mingozzi, A.; Toth, P., The vehicle routing problem, (), 315-338 |

[2] | () |

[3] | Min, H., The multiple vehicle routing problem with simultaneous delivery and Pick-up points, Transportation research A, 23, 5, 377-386, (1989) |

[4] | Dethloff, J., Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and Pick-up, OR spektrum, 23, 1, 79-96, (2001) · Zbl 1015.90022 |

[5] | Salhi, S.; Nagy, G., A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the operational research society, 50, 10, 1034-1042, (1999) · Zbl 1054.90523 |

[6] | Nagy, G.; Salhi, S., Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European journal of operational research, 162, 1, 126-141, (2005) · Zbl 1132.90380 |

[7] | Tang, F.A.; Galvao, R.D., A tabu search algorithm for the vehicle routing problem with simultaneous Pick-up and delivery service, Computers and operations research, 33, 3, 595-619, (2006) · Zbl 1077.90058 |

[8] | Bianchessi, N.; Righini, G., Heuristic algorithms for the vehicle routing problem with simultaneous Pick-up and delivery, Computers and operations research, 34, 2, 578-594, (2007) · Zbl 1109.90016 |

[9] | Dellâ€™Amico, M.; Righini, G.; Salani, M., A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection, Transportation science, 40, 2, 235-247, (2006) |

[10] | Berbeglia, G.; Cordeau, J.F.; Gribkovskaia, I.; Laporte, G., Static pickup and delivery problems: a classification scheme and survey, Top, 15, 1, 1-31, (2007) · Zbl 1121.90001 |

[11] | Kennedy, J.; Eberhart, R., Particle swarm optimization, (), 1942-1948 |

[12] | Kennedy, J.; Eberhart, R.C., Swarm intelligence, (2001), Morgan Kaufmann Publishers San Francisco |

[13] | Clerc, M., Particle swarm optimization, (2006), ISTE London · Zbl 1130.90059 |

[14] | Baker, B.M.; Ayechew, M.A., A genetic algorithm for the vehicle routing problem, Computers and operations research, 30, 5, 787-800, (2003) · Zbl 1026.90013 |

[15] | Berger, J.; Barkaoui, M., A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Computers and operations research, 31, 12, 2037-2053, (2004) · Zbl 1100.90503 |

[16] | Thangiah, S.R.; Salhi, S., Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem, Applied artificial intelligence, 15, 4, 361-383, (2001) |

[17] | Bullnheimer, R.; Hartl, F.; Strauss, C., An improved ant system algorithm for the vehicle routing problem, Annals of operations research, 89, 319-328, (1999) · Zbl 0937.90125 |

[18] | Reimann, M.; Doerner, K.; Hartl, R.F., D-ants: savings based ants divide and conquer the vehicle routing problem, Computers and operations research, 31, 4, 563-591, (2004) · Zbl 1061.90024 |

[19] | Chen, A.L.; Yang, G.K.; Wu, Z.M., Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Journal of zhejiang university science A, 7, 4, 607-614, (2006) · Zbl 1166.90319 |

[20] | Pongchairerks, P.; Kachitvichyanukul, V., A non-homogenous particle swarm optimization with multiple social structures, (), A5-02 |

[21] | Veeramachaneni, K.; Peram, T.; Mohan, C.; Osadciw, L.A., Optimization using particle swarms with near neighbor interaction, (), 110-121 · Zbl 1028.68918 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.