- -

A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company

Mostrar el registro completo del ítem

Pérez Bernal, C.; Miguel A. Salido; Gurrea, D. (2020). A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company. Springer. 187-201. https://doi.org/10.1007/978-3-030-63799-6_15

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

Ficheros en el ítem

[Cerrado]
Nombre: PerezMiguel A ...
Tamaño: 2.016Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company
Autor: Pérez Bernal, Christian Miguel A. Salido Gurrea, David
Entidad UPV: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Fecha difusión:
Resumen:
[EN] In many transport companies, one of the main objectives is to optimize the travel cost of their fleet. Other objectives are related to delivery time, fuel savings, etc. However warehouse stock management is not properly ...[+]
Palabras clave: Warehouse stock control , Metaheuristic , GRASP
Derechos de uso: Cerrado
ISBN: 978-3-030-63798-9
Fuente:
A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company. (issn: 0302-9743 )
DOI: 10.1007/978-3-030-63799-6_15
Editorial:
Springer
Versión del editor: https://doi.org/10.1007/978-3-030-63799-6_15
Título del congreso: 40th SGAI International Conference on Artificial Intelligence: Technical Stream
Lugar del congreso: Online
Fecha congreso: Diciembre 08-09,2020
Serie: Lecture Notes in Computer Science ;12498
Código del Proyecto:
info:eu-repo/grantAgreement/AEI//TIN2016-80856-R//TECNOLOGIAS INTELIGENTES PARA LA RESOLUCION CENTRALIZADA Y DISTRIBUIDA DE PROBLEMAS DE SCHEDULING SOSTENIBLE EN PROCESOS INDUSTRIALES Y LOGISTICOS/
Agradecimientos:
The paper has been partially funded by the Spanish research project TIN2016-80856-R
Tipo: Comunicación en congreso Artículo Capítulo de libro

References

Barkaoui, M., Gendreau, M.: An adaptive evolutionary approach for real-time vehicle routing and dispatching. Computers & Operations Research 40(7), 1766–1776 (2013). https://doi.org/10.1016/j.cor.2013.01.022, http://www.sciencedirect.com/science/article/pii/S0305054813000300

Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM - Society of Industrial and Applied Mathematics, 1 edn., 382 Seiten (2009)

Cao, E., Lai, M., Yang, H.: Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst. Appl. 41(7), 3569–3575 (2014). https://doi.org/10.1016/j.eswa.2013.11.004, http://www.sciencedirect.com/science/article/pii/S0957417413009044 [+]
Barkaoui, M., Gendreau, M.: An adaptive evolutionary approach for real-time vehicle routing and dispatching. Computers & Operations Research 40(7), 1766–1776 (2013). https://doi.org/10.1016/j.cor.2013.01.022, http://www.sciencedirect.com/science/article/pii/S0305054813000300

Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM - Society of Industrial and Applied Mathematics, 1 edn., 382 Seiten (2009)

Cao, E., Lai, M., Yang, H.: Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst. Appl. 41(7), 3569–3575 (2014). https://doi.org/10.1016/j.eswa.2013.11.004, http://www.sciencedirect.com/science/article/pii/S0957417413009044

Current, J., Marsh, M.: Multiobjective transportation network design and routing problems: taxonomy and annotation. Euro. J. Oper. Res. 65(1), 4–19 (1993). https://doi.org/10.1016/0377-2217(93)90140-I, http://www.sciencedirect.com/science/article/pii/037722179390140I

Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472–1483 (2009). https://doi.org/10.1016/j.cie.2009.05.009, http://dx.doi.org/10.1016/j.cie.2009.05.009

Li, X., Leung, S.C.H., Tian, P.: A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Syst. Appl. 39(1), 365–374 (2012). https://doi.org/10.1016/j.eswa.2011.07.025, http://www.sciencedirect.com/science/article/pii/S0957417411009870

Li, Y., Pardalos, P.M., Resende, M.G.C.: A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem 0000, 1–21 (1991)

López-Sánchez, A.D., Hernández-Díaz, A.G., Vigo, D., Caballero, R., Molina, J.: A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. Euro. J. Oper. Res. 238(1), 104–113 (2014). https://doi.org/10.1016/j.ejor.2014.04.008, http://www.sciencedirect.com/science/article/pii/S0377221714003178

Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European J. Oper. Res. 225(1), 1–11 (2013). https://doi.org/10.1016/j.ejor.2012.08.015, http://www.sciencedirect.com/science/article/pii/S0377221712006388

Salari, M., Toth, P., Tramontani, A.: An ILP improvement procedure for the open vehicle routing problem. Comput. Oper. Res. 37(12), 2106–2120 (2010). https://doi.org/10.1016/j.cor.2010.02.010, http://www.sciencedirect.com/science/article/pii/S0305054810000547

Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013). https://doi.org/10.1016/j.cor.2013.01.013, http://www.sciencedirect.com/science/article/pii/S030505481300021X

Syed-abdullah, S.S., Abdul-rahman, S., Mauziah, A.: Solving Quadratic Assignment Problem with Fixed Assignment ( QAPFA ) using Branch and Bound Approach Solving Quadratic Assignment Problem with Fixed Assignment ( QAPFA ) using Branch and Bound Approach (2018). https://doi.org/10.1088/1757-899X/300/1/012002

[-]

recommendations

 

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

Mostrar el registro completo del ítem