Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

A multispace sampling heuristic for the vehicle r

Authors: Jorge E Mendoza Juan G Villegas
Publish Date: 2012/09/19
Volume: 7, Issue: 7, Pages: 1503-1516
PDF Link

Abstract

The vehicle routing problem with stochastic demands consists in designing transportation routes of minimal expected cost to satisfy a set of customers with random demands of known probability distributions This paper proposes a simple yet effective heuristic approach that uses randomized heuristics for the traveling salesman problem a tour partitioning procedure and a set partitioning formulation to sample the solution space and find highquality solutions for the problem Computational experiments on benchmark instances from the literature show that the proposed approach is competitive with the stateoftheart algorithm for the problem in terms of both accuracy and efficiency In experiments conducted on a set of 40 instances the proposed approach unveiled four new bestknown solutions BKSs and matched another 24 For the remaining 12 instances the heuristic reported average gaps with respect to the BKS ranging from 069 to 015  depending on its configurationThe authors would like to thank two anonymous referees for insightful comments and valuable advice that helped to improve the paper This research was partially funded by Region Pays de la Loire France through project LigéRO and by the Universidad de Antioquia Colombia through project Desarrollo de metaheurísticos híbridos y métodos cooperativos para problemas de rutas de vehículos con flota heterogénea y restricciones adicionales

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. Generalized solutions of quasi variational inequalities
  10. A composite model in the context of a production-inventory system
  11. Preserving maximal monotonicity with applications in sum and composition rules
  12. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  13. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  14. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  15. Polynomial-time identification of robust network flows under uncertain arc failures
  16. Maximizing strike aircraft planning efficiency for a given class of ground targets
  17. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  18. Sufficient conditions for protection routing in IP networks
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions
Search Result: