A Hybrid Heuristic for Vehicle Routing Problem with Time Window Constraints
碩士 === 中原大學 === 工業工程研究所 === 91 === This research proposes a heuristic, Enhanced Tabu - Perturbation Algorithm (ETPA), to efficiently and effectively solve Vehicle Routing Problem with Time Window Constraints (VRPTW). ETPA integrates Tabu Search (TS), Noising Method (NM) and Flip Flop Method (FF)....
Main Authors: | Pefo Cheng, 張寶豐 |
---|---|
Other Authors: | James Chien-Liang Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01881213204828485657 |
Similar Items
-
Hybrid Heuristic for Vehicle Routing Problem with Time Windows and Compatibility Constraints in Home Healthcare System
by: Likasiri, C., et al.
Published: (2022) -
A Meta-Heuristic Method for Vehicle Routing Problem with Time Window Constraints
by: Bai-Jie Chen, et al.
Published: (2002) -
A Hybrid Meta-Heuristic for Vehicle Routing Problem with Fuzzy Time Window
by: Che-Chi Chang, et al.
Published: (2009) -
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Window Constraints
by: Chun-Wei Ao, et al.
Published: (1999) -
A Meta-Heuristic Method for Vehicle Routing Problem with Hard Time Window Constraints
by: Yu-Jing Tsai, et al.
Published: (2004)