Sciweavers

55 search results - page 5 / 11
» A Diversity-Controlling Adaptive Genetic Algorithm for the V...
Sort
View
HM
2009
Springer
145views Optimization» more  HM 2009»
13 years 10 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
13 years 10 months 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
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 4 days ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
13 years 10 months 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
IOR
2006
173views more  IOR 2006»
13 years 6 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