- -

An ILS-Based Metaheuristic for the Stacker Crane Problem

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

An ILS-Based Metaheuristic for the Stacker Crane Problem

Mostrar el registro completo del ítem

Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2012). An ILS-Based Metaheuristic for the Stacker Crane Problem. Lecture Notes in Computer Science. 7245:25-36. https://doi.org/10.1007/978-3-642-29124-1_3

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/140911

Ficheros en el ítem

[Cerrado]
Nombre: Ávila;Corberán;PLANA ...
Tamaño: 226.1Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: An ILS-Based Metaheuristic for the Stacker Crane Problem
Autor: Ávila, Thais Corberán, A. PLANA, ISAAC Sanchís Llopis, José María
Entidad UPV: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Fecha difusión:
Resumen:
[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation ...[+]
Palabras clave: Combinatorial Optimization , Metaheuristics , Directed rural postman problem
Derechos de uso: Cerrado
Fuente:
Lecture Notes in Computer Science. (issn: 0302-9743 )
DOI: 10.1007/978-3-642-29124-1_3
Editorial:
Springer-Verlag
Versión del editor: https://doi.org/10.1007/978-3-642-29124-1_3
Código del Proyecto:
info:eu-repo/grantAgreement/MICINN//MTM2010-19576-C02-02/ES/DISEÑO OPTIMO EN REDES LOGISTICAS/
Agradecimientos:
The authors wish to thank the Ministerio de Innovación y Ciencia of Spain (project MTM2010-19576-C02-02) and the Generalitat Valenciana (grant VALi+d for young researchers) for their support.
Tipo: Artículo

References

Belenguer, J.M., Benavent, E., Labadi, N., Prins, C., Reghioui, M.: Split Delivery Capacitated Arc Routing Problem: Lower Bound and Metaheuristic. Transportation Science 44, 206–220 (2010)

Benavent, E., Corberán, A., Sanchis, J.M.: A metaheuristic for the min−max windy rural postman problem with K vehicles. Computational Management Science 7, 269–287 (2010)

Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007) [+]
Belenguer, J.M., Benavent, E., Labadi, N., Prins, C., Reghioui, M.: Split Delivery Capacitated Arc Routing Problem: Lower Bound and Metaheuristic. Transportation Science 44, 206–220 (2010)

Benavent, E., Corberán, A., Sanchis, J.M.: A metaheuristic for the min−max windy rural postman problem with K vehicles. Computational Management Science 7, 269–287 (2010)

Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007)

Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Graduate School of Industrial Administration, Carnegie Mellon University (1976)

Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 32–59. Springer, Heidelberg (2001)

Eiselt, H.A., Gendreau, M., Laporte, G.: Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research 43, 399–414 (1995)

Frederickson, G.N., Hecht, M.S., Kim, C.E.: Aproximation Algorithms for some routing problems. SIAM Journal on Computing 7, 178–193 (1978)

Guan, M.: Graphic programming using odd or even points. Chinese Mathematics 1, 237–277 (1962)

Hassin, R., Khuller, S.: z-Approximations. Journal of Algorithms 41, 429–442 (2001)

Hertz, A., Laporte, G., Nachen-Hugo, P.: Improvement procedures for the undirected rural postman problem. INFORMS Journal on Computing 11, 53–62 (1999)

Laporte, G.: Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers & Operations Research 24, 1057–1061 (1997)

Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problem. Networks 6, 273–280 (1976)

Lourenço, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353 (2002)

Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24, 1097–1100 (1997)

Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)

Srour, F.J.: Dissecting drayage: an examination if structure, information, and control in drayage operations. ERIM Ph.D. Series reseaarch in management, Erasmus Research Institute in Management, 1786 (2010) ISBN978-90-5892-226-7

Srour, F.J., van de Velde, S.: Are stacker crane problems easy? A statistical study. Computers & Operations Research (2011) doi:10.1016/j.cor.2011.06.017

Zhang, L.: Simple Heuristics for some variants on the traveling salesman problem. In: IEEE International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1175–1178 (1992)

Zhang, L., Zheng, W.: Genetic coding for solving both the stacker crane problem and its k-variant. In: IEEE International Conference on Systems, Man and Cybernetics 1995, pp. 1061–1066 (1995)

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem