A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(<Special English Issue>Production and Logistics)
スポンサーリンク
概要
- 論文の詳細を見る
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem in which vehicles can be used several times during a working day. We propose a method to determine the lower bound of this problem by solving the degree-constrained minimum γ-tree problem and the 0-1 knapsack problem. We also propose a method to determine a near-optimal solution to the problem by successively decreasing the difference between the upper and lower bounds. Numerical experiments are carried out to verify the effectiveness of the proposed method.
- 社団法人日本経営工学会の論文
- 2005-02-15
著者
-
HADA Takao
Department of Management Engineering
-
Hada Takao
Department Of Management Systems Engineering School Of Information Technology And Electronics Tokai
-
Moriyama Hiroumi
Department Of Management Systems Engineering School Of Information Technology And Electronics Tokai
-
Moriyama Hiroumi
Department Of Management Engineering
-
OMURA Kazuhiko
Department of Management Systems Engineering, School of Information Technology and Electronics, Toka
-
Omura Kazuhiko
Department Of Management Systems Engineering School Of Information Technology And Electronics Tokai
-
Omura Kazuhiko
Department Of Management Engineering School Of Engineering
関連論文
- An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model
- Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
- A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(Production and Logistics)
- Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Branch and Bound Algorithm for Precedence Constrained Knapsack Problem
- An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method