A Tabu Search Approach combined with An Extended Saving Method for Multi-depot Vehicle Routing Problems with Time Windows(<Special Issue>TOTAL OPERATIONS MANAGEMENT)
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a Tabu Search approach combined with extended saving method for Multi-depot Vehicle Routing Problems with Time Window. The problem can be divided into two sub problems; the customer assignment problem and the k single-depot vehicle routing problems, where k is the number of depots. For the former problem, we propose an tabu search approach in which neighborhood reduction can be effectively performed while keeping solution quality. For the latter problem, we extend the well-known saving method to treat new constraints. By computer experiments, we confirm the effectiveness of our proposed method.
- バイオメディカル・ファジィ・システム学会の論文
著者
-
Nakamura Morikazu
University Of The Ryukyus
-
Okazaki Takeo
University Of The Ryukyus Information Engineering
-
KANG Dongshik
University of the Ryukyus
-
OKAZAKI Takeo
University of the Ryukyus
関連論文
- FOREWORD
- Comparative Study of Score Functions for Edge Orientation in Genetic Network Estimation
- Comparative Study of Score Functions for Edge Orientation in Genetic Network Estimation
- A Tabu Search Approach combined with An Extended Saving Method for Multi-depot Vehicle Routing Problems with Time Windows(TOTAL OPERATIONS MANAGEMENT)
- FOREWORD