scholarly journals Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions

2005 ◽  
Vol 6 (4) ◽  
pp. 359-379 ◽  
Author(s):  
Sancho Salcedo-Sanz ◽  
Yong Xu ◽  
Xin Yao
Keyword(s):  
Heuristic Algorithms ◽  
Cost Functions ◽  
Channel Routing ◽  
Routing Problems ◽  
Standard Cost

scholarly journals On the restrictive channel thickness estimation

2007 ◽  
Vol 20 (3) ◽  
pp. 499-506
Author(s):  
Iskandar Karapetyan
Keyword(s):  
Positive Integer ◽  
Heuristic Algorithms ◽  
Clique Number ◽  
Directed Path ◽  
Channel Routing ◽  
Routing Problem ◽  
Thickness Estimation ◽  
Channel Thickness ◽  
Np Complete ◽  
Routing Method

Channel routing is an important phase of physical design of LSI and VLSI chips. The channel routing method was first proposed by Akihiro Hashimoto and James Stevens [1]. The method was extensively studied by many authors and applied to different technologies. At present there are known many effective heuristic algorithms for channel routing. A. LaPaugh [2] proved that the restrictive routing problem is NP-complete. In this paper we prove that for every positive integer k there is a restrictive channel C for which ?(C)>? (HG)+L(VG)+k, where ? (C) is the thickness of the channel, ?(HG) is clique number of the horizontal constraints graph HG and L(VG) is the length of the longest directed path in the vertical constraints graph VG.

MULTI-LAYER CHANNEL ROUTING PROBLEMS

1996 ◽  
pp. 79-99
Author(s):  
KYOTARO SUZUKI ◽  
HIDEHARU AMANO ◽  
YOSHIYASU TAKEFUJI
Keyword(s):  
Channel Routing ◽  
Routing Problems

Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

2013 ◽  
Vol 4 (2) ◽  
pp. 1-17 ◽  
Author(s):  
Subrata Mitra
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithms ◽  
Future Research ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Demand Information ◽  
Low Degrees ◽  
Special Case ◽  
Better Than

Dynamic vehicle routing problems with backhauling (VRPB), although important, have attracted little attention in the literature. Dynamic VRPB is more complex than dynamic vehicle routing problems (VRP) without backhauling, and since VRP without backhauling is a special case of VRPB, models and algorithms for dynamic VRPB can easily be adapted for dynamic VRP. In this paper, the author compared between static and dynamic policies for solving VRPB with dynamic occurrences of customer delivery and pickup demands. They developed heuristic algorithms for medium-sized problems under static and dynamic policies. Although dynamic policies are always at least as good as static policies, the author observed from numerical experimentations that static policies perform relatively well for low degrees of dynamism (dod). On the other hand, dynamic policies are expected to perform significantly better than static policies for high dod and early availabilities of dynamic customer delivery and pickup demand information. The author concludes the paper by providing directions for future research on dynamic VRPB.

Sign in / Sign up

Export Citation Format

Share Document