Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem

碩士 === 國立雲林科技大學 === 工業工程與管理系 === 104 === In this study, we consider the pairing of multiple demand and heterogeneous vehicle routing problem. This problem about the pickup and delivery can be paired by many to many and each load should be served by the same vehicle. First, we construct a mathematica...

Full description

Bibliographic Details
Main Authors:	CHANG,CHIA-CHI, 張家綺
Other Authors:	LOW,CHIN-YAO
Format:	Others
Language:	zh-TW
Published:	2016
Online Access:	http://ndltd.ncl.edu.tw/handle/72407351568975880458

id	ndltd-TW-104YUNT0031035
record_format	oai_dc
spelling	ndltd-TW-104YUNT00310352017-10-29T04:34:59Z http://ndltd.ncl.edu.tw/handle/72407351568975880458 Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem 應用螢火蟲演算法於多點配對與多車種之車輛途程規劃 CHANG,CHIA-CHI 張家綺碩士國立雲林科技大學工業工程與管理系 104 In this study, we consider the pairing of multiple demand and heterogeneous vehicle routing problem. This problem about the pickup and delivery can be paired by many to many and each load should be served by the same vehicle. First, we construct a mathematical model which minimizes the total cost as its objective. According to this problem, a firefly algorithm is presented and we use the VB6.0 to write this heuristic for solving the large scale problem. The result of this study is planning an optimal transport routes for the better result and reduce the number of vehicle used. LOW,CHIN-YAO 駱景堯 2016 學位論文 ; thesis 87 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 國立雲林科技大學 === 工業工程與管理系 === 104 === In this study, we consider the pairing of multiple demand and heterogeneous vehicle routing problem. This problem about the pickup and delivery can be paired by many to many and each load should be served by the same vehicle. First, we construct a mathematical model which minimizes the total cost as its objective. According to this problem, a firefly algorithm is presented and we use the VB6.0 to write this heuristic for solving the large scale problem. The result of this study is planning an optimal transport routes for the better result and reduce the number of vehicle used.
author2	LOW,CHIN-YAO
author_facet	LOW,CHIN-YAO CHANG,CHIA-CHI 張家綺
author	CHANG,CHIA-CHI 張家綺
spellingShingle	CHANG,CHIA-CHI 張家綺 Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
author_sort	CHANG,CHIA-CHI
title	Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
title_short	Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
title_full	Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
title_fullStr	Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
title_full_unstemmed	Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem
title_sort	using the firefly algorithm for solving the pairing of multiple demand and heterogeneous vehicle routing problem
publishDate	2016
url	http://ndltd.ncl.edu.tw/handle/72407351568975880458
work_keys_str_mv	AT changchiachi usingthefireflyalgorithmforsolvingthepairingofmultipledemandandheterogeneousvehicleroutingproblem AT zhāngjiāqǐ usingthefireflyalgorithmforsolvingthepairingofmultipledemandandheterogeneousvehicleroutingproblem AT changchiachi yīngyòngyínghuǒchóngyǎnsuànfǎyúduōdiǎnpèiduìyǔduōchēzhǒngzhīchēliàngtúchéngguīhuà AT zhāngjiāqǐ yīngyòngyínghuǒchóngyǎnsuànfǎyúduōdiǎnpèiduìyǔduōchēzhǒngzhīchēliàngtúchéngguīhuà
_version_	1718558311466401792

Using the Firefly Algorithm for Solving the Pairing of Multiple Demand and Heterogeneous Vehicle Routing Problem

Similar Items