The heterogeneous open vehicle routing problem with release and due dates : a case on spare parts industry

Vista sencilla de ítem
dc.contributor.advisorMontoya Echeverri, José Alejandrospa
dc.contributor.authorLondoño Montoya, Sebastián
dc.contributor.authorMontoya Echeverri, Jose Alejandro
dc.coverage.spatialMedellín de: Lat: 06 15 00 N degrees minutes Lat: 6.2500 decimal degrees Long: 075 36 00 W degrees minutes Long: -75.6000 decimal degreeseng
dc.creator.degreeMagíster en Ingenieríaspa
dc.creator.emailbastian.londono@gmail.comspa
dc.creator.emailjmonto36@eafit.edu.cospa
dc.date.accessioned2019-07-16T16:34:01Z
dc.date.available2019-07-16T16:34:01Z
dc.date.issued2018
dc.description.abstractIn this paper, we introduce the Heterogeneous Open Vehicle Routing Problem with Release and Due Dates (HOVRP-RDD). This problem is inspired by a real delivery operation of a company that buys and imports spare parts from different vendors. The parts arrive to a depot and then are delivered to a set of customers, so they can perform corrective maintenance. The objective of HOVRP-RDD is to design a set of routes for visiting all the customers, in a way that: each customer’s product has a ready time at the depot; each customer has a due date and importance weight; and the total delivery cost does not exceed a maximum budget. To transport the products, the company hires a heterogeneous fleet, in which every vehicle finishes its route at the last customer. For the HOVRP-RDD, the objective function is to minimize the total weighted tardiness, considering that the customers need the parts to carry on their operations. For solving this problem, we propose a Mixed-Integer linear programming (MILP) formulation. For improving the performance of the MILP formulation running on a commercial solver, we propose a set of valid inequalities and an approach to reduce the cardinality of a set of vehicles. To test the MILP formulation, we present a computational experiment using 40 instances based on a real operation from a company in the spare parts industry. The results show that the MILP formulation has an acceptable performance given the size of the real instances from the company that motivates the HOVRP-RDD.spa
dc.formatapplication/pdfeng
dc.identifier.ddc629.24 L847
dc.identifier.urihttp://repository.eafit.edu.co/handle/10784/13661
dc.language.isospaspa
dc.publisher.departmentEscuela de Ingenieríaspa
dc.publisher.placeMedellínspa
dc.publisher.programMaestría en Ingenieríaspa
dc.rights.accessrightsinfo:eu-repo/semantics/closedAccessspa
dc.rights.localAcceso cerradospa
dc.subjectIndustriaspa
dc.subject.keywordVehicle Routing Problemspa
dc.subject.keywordRelease datesspa
dc.subject.keywordDue datesspa
dc.subject.keywordHeterogeneous fleetspa
dc.subject.keywordTotal Weighted Tardinesspa
dc.subject.lembINDUSTRIA DE AUTOPARTESspa
dc.subject.lembRELACIONES CON LOS CLIENTESspa
dc.subject.lembAUTOMÓVILES - CUIDADO Y REPARACIÓNspa
dc.titleThe heterogeneous open vehicle routing problem with release and due dates : a case on spare parts industryspa
dc.typemasterThesiseng
dc.typeinfo:eu-repo/semantics/masterThesiseng
dc.type.hasVersionacceptedVersioneng
dc.type.localTesis de Maestríaspa

Archivos

Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
Sebastian_LondonoMontoya_JoseAlejandro_MontoyaEcheverri_2018.pdf
Tamaño:
755.53 KB
Formato:
Adobe Portable Document Format
Descripción:
Trabajo de grado
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
2.5 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar

Colecciones

Maestría en Ingeniería (tesis)