Sciweavers

188 search results - page 8 / 38
» Algorithms for Capacitated Vehicle Routing
Sort
View
ISPD
1999
ACM
95views Hardware» more  ISPD 1999»
15 years 2 months ago
Incremental capacitance extraction and its application to iterative timing-driven detailed routing
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...
Yanhong Yuan, Prithviraj Banerjee
HAIS
2009
Springer
15 years 2 months ago
A Vehicle Routing Problem Solved by Agents
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Maria Belén Vaquerizo García
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 2 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
15 years 3 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang
SIAMDM
1998
55views more  SIAMDM 1998»
14 years 9 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu