Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO

DOI10.1155/2012/104279zbMath1264.90089OpenAlexW2072245382WikidataQ58912428 ScholiaQ58912428MaRDI QIDQ1954442

Xiaobing Gan, Ben Niu, Yan Wang, Shu-Hai Li

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/104279

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem

Uses Software

• MCPSO

Cites Work

• MCPSO: a multi-swarm cooperative particle swarm optimizer
• Vehicle Routing with Time Windows
• A comparison of three algorithms for finding fundamental cycles in a directed graph
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees