Sciweavers

51 search results - page 4 / 11
» Solving Vehicle Routing Problems Using Constraint Programmin...
Sort
View
NETWORKS
2007
13 years 5 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
COR
2006
95views more  COR 2006»
13 years 5 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
EOR
2007
90views more  EOR 2007»
13 years 5 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
AGP
2010
IEEE
13 years 10 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
COR
2010
155views more  COR 2010»
13 years 5 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...