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: | Ou, Jhe-Yu, 歐哲瑜 |
---|---|
Other Authors: | 韓復華 |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/h59p72 |
Similar Items
-
A Particle Swarm Optimization Solution Approach for the Multi-Compartment Vehicle Routing Problem
by: Lin, Jhih-Syuan, et al.
Published: (2015) -
An Iterated Local Search Heuristic for the Vehicle Routing Problem with Intermediate Replenishment Facilities
by: Yi, Nai-En, et al.
Published: (2017) -
An Iterated Local Search heuristic for the Close-Open Mixed Vehicle Routing Problem
by: Teng, Chuan-Pin, et al.
Published: (2015) -
Using Iterated Local Search Heuristic to Solve the Green Vehicle Routing Problem
by: Liu, Yi-Ching, et al.
Published: (2016) -
Particle Swarm Optimization Algorithm for the Multi-Compartment Vehicle Routing Problem
by: Chung Yueh Yang, et al.
Published: (2017)