Sciweavers

188 search results - page 10 / 38
» Algorithms for Capacitated Vehicle Routing
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 1 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
15 years 3 months ago
Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer
Due to the rapid development of manufacturing process technology and tight marketing schedule, the chip design and manufacturing always work toward an integrated solution to achie...
Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong
DISOPT
2008
118views more  DISOPT 2008»
14 years 9 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 4 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
LR
2011
170views more  LR 2011»
14 years 4 months ago
Routing automated guided vehicles in container terminals through the Q-learning technique
This paper suggests a routing method for automated guided vehicles in port terminals that uses the Q-learning technique. One of the most important issues for the efficient operati...
Su Min Jeon, Kap Hwan Kim, Herbert Kopfer