Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Solving non-smooth arc routing problems throughout biased-randomized heuristics

Autor
González-Martín, S.; Ferrer, A.; Juan, Á.; Riera, D.
Tipus d'activitat
Capítol de llibre
Llibre
Computer-based modelling and optimization in transportation
Pàgina inicial
451
Pàgina final
462
Editorial
Springer
Data de publicació
2014
ISBN
978-3-319-04630-3 Obrir en finestra nova
DOI
https://doi.org/10.1007/978-3-319-04630-3_33 Obrir en finestra nova
Resum
In non-smooth optimization problems the objective function to minimize or maximize is non-smooth and usually non-convex either, which is a frequent characteristic of real-life optimization problems. In this chapter we discuss the arc routing problem with a non-smooth cost function, and propose a randomized algorithm for solving it. Our approach employs non-uniform probability distributions to add a biased random behavior to the well-known savings heuristic. By doing so, a large set of alternativ...
Paraules clau
Randomized Algorithms, Combinatorial Optimization, Heuristics, Arc Routing Problem
Grup de recerca
GNOM - Grup d´Optimització Numèrica i Modelització

Participants

  • González Martín, Sergio  (autor)
  • Ferrer Biosca, Alberto  (autor)
  • Juan Pérez, Ángel Alejandro  (autor)
  • Riera Terrén, Daniel  (autor)