A Particle Swarm Optimization Solution Approach for the Multi-Compartment Vehicle Routing Problem
碩士 === 國立交通大學 === 運輸與物流管理學系 === 103 === Multi-compartment vehicle routing problem (MC-VRP) is an extension of the classical Vehicle Routing Problem with multiple products which must be stored in the given compartment in the vehicle. The main difference between MC-VRP and VRP is the compartment capac...
Main Authors: | Lin, Jhih-Syuan, 林致瑄 |
---|---|
Other Authors: | Han, Anthony Fu-Wha |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81294848574936044774 |
Similar Items
-
Particle Swarm Optimization Algorithm for the Multi-Compartment Vehicle Routing Problem
by: Chung Yueh Yang, et al.
Published: (2017) -
A Particle Swarm Optimization Solution Approach and an Iterated Local Search Heuristic for the Multi-Compartment Vehicle Routing Problem
by: Ou, Jhe-Yu, et al.
Published: (2017) -
A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem
by: Kui-Ting CHEN, et al.
Published: (2015-12-01) -
A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem
by: Kui-Ting Chen, et al.
Published: (2015-09-01) -
A Particle Swarm Optimization Approach for the Multi-depot Vehicle Routing Problem with Pickup and Delivery
by: Li, Chung-Hsien, et al.
Published: (2011)