Sciweavers

204 search results - page 8 / 41
» Solving a Dynamic Real-Life Vehicle Routing Problem
Sort
View
IOR
2006
173views more  IOR 2006»
13 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
IPPS
1998
IEEE
13 years 11 months ago
A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
Luiz Satoru Ochi, Dalessandro Soares Vianna, L&uac...
COR
2007
183views more  COR 2007»
13 years 7 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
14 years 2 days ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
14 years 2 days ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera