District Design for a Parcel Delivery and Pick up Problem

Hdl Handle:
http://hdl.handle.net/11285/572496
Title:
District Design for a Parcel Delivery and Pick up Problem
Issue Date:
01/06/2009
Abstract:
In this dissertation, a mathematical formulation and a solution method are proposed for a logistics districting problem. Experimental results in comparison with CPLEX 11.1 are presented in order to test the performance of the proposed solution procedures. The testing was performed using several types of generated instances as well as using data provided by a parcel company. The procedures strive to optimize two criteria: compact shape of the districts and balance of workload content among districts. The problem in which a geographical area is portioned into districts with the aim of optimize some criteria under consideration has been shown to be NP- Complete by Altman, 1997. The difficulty of the problem makes employing an exact procedure impractical and motivated us to propose heuristics to solve the problem. The procedure proposed is a hybrid heuristic that combines some elements of metaheuristics such as Tabu Search and GRASP.
Keywords:
Districting; Compactness; Workload Balance; Hybrid Heuristics; Hyperheuristic; Tabu Search; Grasp.
Degree Program:
Programa de Gradurados en Arquitectura e Ingeniería
Advisors:
Dr. Neale R. Smith
Committee Member / Sinodal:
Dr. Ronald G. Askin; Dr. José Luis González Velarde; Dr. Vyacheslav Kalashnikov
Degree Level:
Doctor de Filosofía en Ingeniería Industrial
School:
Escuela de Ingeniería y Arquitectura
Campus Program:
Campus Monterrey
Discipline:
Ingeniería y Ciencias Aplicadas / Engineering & Applied Sciences
Appears in Collections:
Ciencias Exactas

Full metadata record

DC FieldValue Language
dc.contributor.advisorDr. Neale R. Smithes
dc.creatorGonzález Ramírez, Rosa G.en
dc.date.accessioned2015-08-17T11:33:44Zen
dc.date.available2015-08-17T11:33:44Zen
dc.date.issued01/06/2009-
dc.identifier.urihttp://hdl.handle.net/11285/572496en
dc.description.abstractIn this dissertation, a mathematical formulation and a solution method are proposed for a logistics districting problem. Experimental results in comparison with CPLEX 11.1 are presented in order to test the performance of the proposed solution procedures. The testing was performed using several types of generated instances as well as using data provided by a parcel company. The procedures strive to optimize two criteria: compact shape of the districts and balance of workload content among districts. The problem in which a geographical area is portioned into districts with the aim of optimize some criteria under consideration has been shown to be NP- Complete by Altman, 1997. The difficulty of the problem makes employing an exact procedure impractical and motivated us to propose heuristics to solve the problem. The procedure proposed is a hybrid heuristic that combines some elements of metaheuristics such as Tabu Search and GRASP.en
dc.language.isoenen
dc.rightsOpen Accessen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleDistrict Design for a Parcel Delivery and Pick up Problemen
dc.typeTesis de Doctoradoes
thesis.degree.grantorInstituto Tecnológico y de Estudios Superiores de Monterreyes
thesis.degree.levelDoctor de Filosofía en Ingeniería Industriales
dc.contributor.committeememberDr. Ronald G. Askines
dc.contributor.committeememberDr. José Luis González Velardees
dc.contributor.committeememberDr. Vyacheslav Kalashnikoves
thesis.degree.disciplineEscuela de Ingeniería y Arquitecturaes
thesis.degree.namePrograma de Gradurados en Arquitectura e Ingenieríaes
dc.subject.keywordDistrictingen
dc.subject.keywordCompactnessen
dc.subject.keywordWorkload Balanceen
dc.subject.keywordHybrid Heuristicsen
dc.subject.keywordHyperheuristicen
dc.subject.keywordTabu Searchen
dc.subject.keywordGrasp.en
thesis.degree.programCampus Monterreyes
dc.subject.disciplineIngeniería y Ciencias Aplicadas / Engineering & Applied Scienceses
All Items in REPOSITORIO DEL TECNOLOGICO DE MONTERREY are protected by copyright, with all rights reserved, unless otherwise indicated.