Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/75570
Campo DC Valoridioma
dc.contributor.authorDominguez, Oscaren_US
dc.contributor.authorJuan, Angel A.en_US
dc.contributor.authorBarrios, Barryen_US
dc.contributor.authorFaulin, Javieren_US
dc.contributor.authorAgustin, Albaen_US
dc.date.accessioned2020-11-16T12:50:37Z-
dc.date.available2020-11-16T12:50:37Z-
dc.date.issued2016en_US
dc.identifier.issn0254-5330en_US
dc.identifier.otherWoS-
dc.identifier.urihttp://hdl.handle.net/10553/75570-
dc.description.abstractThis paper discusses the two-dimensional loading capacitated vehicle routing problem (2L-CVRP) with heterogeneous fleet (2L-HFVRP). The 2L-CVRP can be found in many real-life situations related to the transportation of voluminous items where two-dimensional packing restrictions have to be considered, e.g.: transportation of heavy machinery, forklifts, professional cleaning equipment, etc. Here, we also consider a heterogeneous fleet of vehicles, comprising units of different capacities, sizes and fixed/variable costs. Despite the fact that heterogeneous fleets are quite ubiquitous in real-life scenarios, there is a lack of publications in the literature discussing the 2L-HFVRP. In particular, to the best of our knowledge no previous work discusses the non-oriented 2L-HFVRP, in which items are allowed to be rotated during the truck-loading process. After describing and motivating the problem, a literature review on related work is performed. Then, a multi-start algorithm based on biased randomization of routing and packing heuristics is proposed. A set of computational experiments contribute to illustrate the scope of our approach, as well as to show its efficiency.en_US
dc.languageengen_US
dc.relation.ispartofAnnals of Operations Researchen_US
dc.sourceAnnals of Operations Research [ISSN 0254-5330], v. 236 (2), p. 383-404, (Enero 2016)en_US
dc.subject.otherHeterogeneous Vehicle Routing Problemen_US
dc.subject.otherTwo-Dimensional Bin Packing Problemen_US
dc.subject.otherRandomized Heuristicsen_US
dc.subject.otherMulti-Start Algorithmsen_US
dc.titleUsing biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleeten_US
dc.typeinfo:eu-repo/semantics/Articleen_US
dc.typeArticleen_US
dc.relation.conferenceOperations Research Peripatetic Postgraduate Program Conference (ORP3)
dc.identifier.doi10.1007/s10479-014-1551-4en_US
dc.identifier.scopus84955180691-
dc.identifier.isi000368946400006-
dc.contributor.authorscopusid56004111500-
dc.contributor.authorscopusid56129392700-
dc.contributor.authorscopusid25633500400-
dc.contributor.authorscopusid6506670477-
dc.contributor.authorscopusid54949008700-
dc.identifier.eissn1572-9338-
dc.description.lastpage404en_US
dc.identifier.issue2-
dc.description.firstpage383en_US
dc.relation.volume236en_US
dc.investigacionIngeniería y Arquitecturaen_US
dc.type2Artículoen_US
dc.contributor.daisngid3339793-
dc.contributor.daisngid150316-
dc.contributor.daisngid3166315-
dc.contributor.daisngid384758-
dc.contributor.daisngid7359862-
dc.description.numberofpages22en_US
dc.utils.revisionen_US
dc.contributor.wosstandardWOS:Dominguez, O-
dc.contributor.wosstandardWOS:Juan, AA-
dc.contributor.wosstandardWOS:Barrios, B-
dc.contributor.wosstandardWOS:Faulin, J-
dc.contributor.wosstandardWOS:Agustin, A-
dc.date.coverdateEnero 2016en_US
dc.identifier.conferenceidevents120935-
dc.identifier.ulpgcen_US
dc.description.sjr1,009
dc.description.jcr1,709
dc.description.sjrqQ2
dc.description.jcrqQ2
dc.description.scieSCIE
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.event.eventsstartdate16-07-2012-
crisitem.event.eventsenddate20-07-2012-
Colección:Artículos
Vista resumida

Citas SCOPUSTM   

66
actualizado el 15-dic-2024

Citas de WEB OF SCIENCETM
Citations

49
actualizado el 15-dic-2024

Visitas

59
actualizado el 12-may-2024

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.