A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem.

Abstract

Capacitated vehicle routing problem with pickups and deliveries (CVRPPD) is one of the most challenging combinatorial optimization problems which include goods delivery/pickup optimization, vehicle number optimization, routing path optimization and transportation cost minimization. The conventional particle swarm optimization (PSO) is difficult to find a n o p timal solution of the CVRPPD due to its simple search strategy. A PSO with adaptive multi-swarm strategy (AMSPSO) is proposed to solve the CVRPPD in this paper. The proposed AMSPSO employs multiple PSO algorithms and an adaptive algorithm with punishment mechanism to search the optimal solution, which can deal with large-scale optimization problems. The simulation results prove that the proposed AMSPSO can solve the CVRPPD with the least number of vehicles and less transportation cost, simultaneously.

Authors and Affiliations

Kui-Ting Chen, Ke Fan, Yijun Dai, Takaaki Baba

Keywords

Related Articles

Security-Reliability Analysis of Multi-hop LEACH Protocol with Fountain Codes and Cooperative Jamming

In this paper, we investigate trade-off between security and reliability of Fountain codes (FCs) based low-energy adaptive clustering hierarchy (LEACH) networks, where the encoded packets are sent to the destination by u...

Cooperative Non-Orthogonal Multiple Access for Future Wireless Communications

There is a huge demand for increased connectivity and reliability of devices in the fifth generation and beyond of wireless communications so as to ensure massive connectivity and high spectral efficiency. Recently, power d...

A Novel Intrusion Detection Mechanism for SCADA systems which Automatically Adapts to Network Topology Changes

Industrial Control Systems (ICS) are getting more vulnerable as they become increasingly interconnected with other systems. Industrial Internet of Things(IIoT) will bring new opportunities to business and society, along...

Using Finite Forkable DEVS for Decision-Making Based on Time Measured with Uncertainty

The time-line in Discrete Event Simulation (DES) is a sequence of events defined in a numerable subset of R+. When it comes from an experimental measurement, the timing of these events has a limited precision. This preci...

Implementing Energy Saving Techniques for Sensor Nodes in IoT Applications

The technique is designed to optimize the energy consumption for sensor processing layer in Internet Of Things (IoT). Sleep time calculation algorithm is built on the gateway to predict the sleep time of sensor nodes acc...

Download PDF file
  • EP ID EP46034
  • DOI http://dx.doi.org/10.4108/eai.17-9-2015.150285
  • Views 328
  • Downloads 0

How To Cite

Kui-Ting Chen, Ke Fan, Yijun Dai, Takaaki Baba (2015). A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem.. EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2(5), -. https://europub.co.uk/articles/-A-46034