Sciweavers

35 search results - page 3 / 7
» Solving vehicle routing problems by maximum neuron model
Sort
View
COR
2010
116views more  COR 2010»
13 years 7 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
ECAI
2006
Springer
13 years 11 months ago
Time Constrained VRP: An Agent Environment-Perception Model
In this paper, we present a multiagent model in which agents have a perception upon their shared environment, a measure is associated to the agents' perception field. We apply...
Mahdi Zargayouna
COR
2007
176views more  COR 2007»
13 years 7 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
CP
1997
Springer
13 years 12 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
COR
2010
155views more  COR 2010»
13 years 7 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...