Sciweavers

116 search results - page 3 / 24
» Optimizing Delivery Time in Multi-Objective Vehicle Routing ...
Sort
View
PPSN
2010
Springer
13 years 3 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
ICNC
2009
Springer
13 years 10 months ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie
TRANSCI
2010
169views more  TRANSCI 2010»
12 years 12 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
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
COR
2011
13 years 8 days ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria