Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO
type: Item
instance of: scholarly article
title: Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO
zbMATH Open document ID: 1264.90089
DOI: 10.1155/2012/104279
author: Xiaobing Gan
author: Yan Wang
author: Ben Niu
author: Shuhai Li
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We consider two additional factors of the widely researched vehicle routing problem with time windows (VRPTW). The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO) algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, the MCPSO algorithm performs best for solving this problem.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6173029
Wikidata QID: Q58912428
describes a project that uses: MCPSO
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/104279
OpenAlex ID: W2072245382
cites work: A comparison of three algorithms for finding fundamental cycles in a directed graph
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Vehicle Routing with Time Windows
cites work: MCPSO: a multi-swarm cooperative particle swarm optimizer
description: scientific article; zbMATH DE number 6173029