A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem
碩士 === 國立交通大學 === 運輸與物流管理學系 === 105 === Multi-compartment vehicle routing problem (MCVRP) is an extension of the classical Vehicle Routing Problem (VRP) with multiple products that must be stored in the given compartments in the vehicle. The main difference between MCVRP and VRP is the compartment c...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/h59p72 |
id |
ndltd-TW-105NCTU5423062 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-105NCTU54230622019-05-16T00:08:10Z http://ndltd.ncl.edu.tw/handle/h59p72 A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem 應用粒子群最佳化方法及迭代區域搜尋法求解多貨艙車輛路線問題 Ou, Jhe-Yu 歐哲瑜 碩士 國立交通大學 運輸與物流管理學系 105 Multi-compartment vehicle routing problem (MCVRP) is an extension of the classical Vehicle Routing Problem (VRP) with multiple products that must be stored in the given compartments in the vehicle. The main difference between MCVRP and VRP is the compartment capacity limit for various products. Depending on if the different products of a customer can be shipped by different vehicles, the MCVRP can be classified into the split and non-split type of problems respectively. In this thesis, we apply the particle swarm optimization (PSO) method and a multi-start iterated local search (MS_ILS) approach for solving the MCVRP respectively. In the PSO part, we propose an n-dimension decoding method for solving both the non-split and split type of the MCVRP. In our MS_ILS, we first use the n-dimension decoding method to construct multiple initial solutions. Then, we apply a randomized variable neighborhood decent (RVND) module with the local search operators of 2-opt, Or-opt, λ-interchanges and 2-opt* to improve the solution. A p-point perturbation is also applied in the MS_ILS to increase the diversification of search. Our proposed algorithms were tested on four problem instance sets proposed by Fallahi et al. [9] and Reed et al. [24]. The results show that the MS_ ILS performs better than PSO. On the other hand, our proposed n-dimension decoding method of PSO can save about half computer time than the original 2n-dimension decoding method in solving the MCVRP for the split type of problems. Out of 136 instances tested, our MS_ILS has found 23 best known solutions (BKS) and 38 new best solutions. The average deviation from BKS is 0.18%. Key Words: Multi-Compartment Vehicle Routing Problem (MCVRP), Particle Swarm Optimization (PSO), Iterated Local Search (ILS), Multi-start 韓復華 2017 學位論文 ; thesis 132 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 運輸與物流管理學系 === 105 === Multi-compartment vehicle routing problem (MCVRP) is an extension of the classical Vehicle Routing Problem (VRP) with multiple products that must be stored in the given compartments in the vehicle. The main difference between MCVRP and VRP is the compartment capacity limit for various products. Depending on if the different products of a customer can be shipped by different vehicles, the MCVRP can be classified into the split and non-split type of problems respectively.
In this thesis, we apply the particle swarm optimization (PSO) method and a multi-start iterated local search (MS_ILS) approach for solving the MCVRP respectively. In the PSO part, we propose an n-dimension decoding method for solving both the non-split and split type of the MCVRP. In our MS_ILS, we first use the n-dimension decoding method to construct multiple initial solutions. Then, we apply a randomized variable neighborhood decent (RVND) module with the local search operators of 2-opt, Or-opt, λ-interchanges and 2-opt* to improve the solution. A p-point perturbation is also applied in the MS_ILS to increase the diversification of search.
Our proposed algorithms were tested on four problem instance sets proposed by Fallahi et al. [9] and Reed et al. [24]. The results show that the MS_ ILS performs better than PSO. On the other hand, our proposed n-dimension decoding method of PSO can save about half computer time than the original 2n-dimension decoding method in solving the MCVRP for the split type of problems. Out of 136 instances tested, our MS_ILS has found 23 best known solutions (BKS) and 38 new best solutions. The average deviation from BKS is 0.18%.
Key Words: Multi-Compartment Vehicle Routing Problem (MCVRP), Particle Swarm
Optimization (PSO), Iterated Local Search (ILS), Multi-start
|
author2 |
韓復華 |
author_facet |
韓復華 Ou, Jhe-Yu 歐哲瑜 |
author |
Ou, Jhe-Yu 歐哲瑜 |
spellingShingle |
Ou, Jhe-Yu 歐哲瑜 A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
author_sort |
Ou, Jhe-Yu |
title |
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
title_short |
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
title_full |
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
title_fullStr |
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
title_full_unstemmed |
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem |
title_sort |
particle swarm optimization solution approach and an iterated local search heuristic for the multi-compartment vehicle routing problem |
publishDate |
2017 |
url |
http://ndltd.ncl.edu.tw/handle/h59p72 |
work_keys_str_mv |
AT oujheyu aparticleswarmoptimizationsolutionapproachandaniteratedlocalsearchheuristicforthemulticompartmentvehicleroutingproblem AT ōuzhéyú aparticleswarmoptimizationsolutionapproachandaniteratedlocalsearchheuristicforthemulticompartmentvehicleroutingproblem AT oujheyu yīngyònglìziqúnzuìjiāhuàfāngfǎjídiédàiqūyùsōuxúnfǎqiújiěduōhuòcāngchēliànglùxiànwèntí AT ōuzhéyú yīngyònglìziqúnzuìjiāhuàfāngfǎjídiédàiqūyùsōuxúnfǎqiújiěduōhuòcāngchēliànglùxiànwèntí AT oujheyu particleswarmoptimizationsolutionapproachandaniteratedlocalsearchheuristicforthemulticompartmentvehicleroutingproblem AT ōuzhéyú particleswarmoptimizationsolutionapproachandaniteratedlocalsearchheuristicforthemulticompartmentvehicleroutingproblem |
_version_ |
1719160684356304896 |