A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with the shortest path problem on a network with time-windows. The concept of time-windows is recently introduced by Desrosiers et al. as a subproblem of the traveling salesman problem involving time constraints. Authors consider another type of time-windows, which we name the AGV-type time-window, and define the shortest path problem on the network wit,h the AGV-type time-windows. We verify that, this problem has a structure similar to the conventional shortest path problem without time-windows and propose several methods to solve the shortest path problem with such time-windows. The method consists of two procedures: first, we divide the main problem into subproblems, and then solve these subproblems using the dynamic programming or the branch and bound method. Numerical experiments are carried out to compare the computational performance of the proposed algorithms.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Fujii Susumu
Kobe University
-
Hohzaki R
National Defense Acad.
-
Hohzaki Ryusuke
Department Of Applied Physics National Defense Academy
-
Sandoh Hiroaki
University of Marketing & Management Science
関連論文
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- 3B1 A Basic Study on Cost Based Lot Sizing : Experiments with Distributed Virtual Factory(Technical session 3B: Virtual factory)
- AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
- AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
- A SEARCH GAME WITH DURABLE SEARCHING RESOURCES
- OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
- A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
- Rescheduling for AGVs by Time Windows Concept
- AN OPTIMAL SEARCH PLAN FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- Efficient Algorithms for a Convex Programming Problem with a Constraint on the Weighted Total Amount
- A MOVING TARGET SEARCH PROBLEM WITH NESTED CONSTRAINTS OF SEARCH EFFORT
- AN OPTIMAL N-JOB BACKUP POLICY MAXIMIZING AVAILABILITY FOR A HARD COMPUTER DISK
- AN OPTIMAL 1/N BACKUP POLICY FOR DATA FLOPPY DISKS UNDER EFFICIENCY BASIS