{"id":{"repo_id":"ets-quebec","oai_identifier":"oai:espace.etsmtl.ca:2394"},"canonical_url":"https://search.ndltd.org/etd/ets-quebec/oai:espace.etsmtl.ca:2394","repository":{"repo_id":"ets-quebec","name":"ETS (Quebec)","base_url":"https://espace.etsmtl.ca/cgi/oai2"},"display":{"title":"Transportation optimization for the collection of end-of-life vehicles","abstract":"Firms operating in the purchasing of end-of-life vehicles (ELVs) have significant challenges related to the fact that most of the purchased ELVs must be collected efficiently in order to minimize their transportation costs. In this project, we study a reverse logistics problem of a Canadian firm that collects ELVs from a group of dealers and accumulates them at its warehouse for part resale or recycling. This problem can be modeled as a vehicle routing problem (VRP) with different side-constraints. Although prior research has made several contributions to model and solve different variants of the VRP, the specific issue in this project considers solving a VRP with a new combination of constraints, such as customer assignment to the private fleet or an external carrier, time-windows, multi-trip, and loading sequences. We propose a mixed-integer linear programming (MILP) model as well as a heuristic algorithm capable of finding the routes’ planning that minimizes the total transportation costs. The performance of the proposed methods is assessed by generated instances using the data obtained from the company.","abstract_html":"Firms operating in the purchasing of end-of-life vehicles (ELVs) have significant challenges related to the fact that most of the purchased ELVs must be collected efficiently in order to minimize their transportation costs. In this project, we study a reverse logistics problem of a Canadian firm that collects ELVs from a group of dealers and accumulates them at its warehouse for part resale or recycling. This problem can be modeled as a vehicle routing problem (VRP) with different side-constraints. Although prior research has made several contributions to model and solve different variants of the VRP, the specific issue in this project considers solving a VRP with a new combination of constraints, such as customer assignment to the private fleet or an external carrier, time-windows, multi-trip, and loading sequences. We propose a mixed-integer linear programming (MILP) model as well as a heuristic algorithm capable of finding the routes’ planning that minimizes the total transportation costs. The performance of the proposed methods is assessed by generated instances using the data obtained from the company.","abstract_has_math":false,"creators":["Khabou, Ahmed"],"institution":"École de technologie supérieure","degree_name":"Mémoire de maîtrise électronique","degree_level":"masters","degree_discipline":"Mgpa","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-07-26","date_published":"2019-07-26","updated_at":"2026-11-18T22:08:15Z","subjects":["logistique inverse, problème de tournées de véhicules, heuristique, fenêtres de temps, flotte hétérogène, routes multiples, plusieurs transporteurs externes, séquences de chargement"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["INSERT-YOUR-LIBRARY-ID-HERE2394"],"render_values":[{"text":"INSERT-YOUR-LIBRARY-ID-HERE2394","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"https://espace.etsmtl.ca/id/eprint/2394/1/KHABOU_Ahmed.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://espace.etsmtl.ca/cgi/oai2?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aespace.etsmtl.ca%3A2394","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Khabou, Ahmed"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-07-26"]},{"key":"dc:publisher","label":"Institution","values":["École de technologie supérieure"]},{"key":"dc:type","label":"Dc Type","values":["Electronic Thesis or Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mgpa"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mémoire de maîtrise électronique"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["École de technologie supérieure"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["logistique inverse, problème de tournées de véhicules, heuristique, fenêtres de temps, flotte hétérogène, routes multiples, plusieurs transporteurs externes, séquences de chargement"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["INSERT-YOUR-LIBRARY-ID-HERE2394","https://espace.etsmtl.ca/id/eprint/2394/1/KHABOU_Ahmed.pdf","https://espace.etsmtl.ca/id/eprint/2394/2/KHABOU_Ahmed-web.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Firms operating in the purchasing of end-of-life vehicles (ELVs) have significant challenges related to the fact that most of the purchased ELVs must be collected efficiently in order to minimize their transportation costs. In this project, we study a reverse logistics problem of a Canadian firm that collects ELVs from a group of dealers and accumulates them at its warehouse for part resale or recycling. This problem can be modeled as a vehicle routing problem (VRP) with different side-constraints. Although prior research has made several contributions to model and solve different variants of the VRP, the specific issue in this project considers solving a VRP with a new combination of constraints, such as customer assignment to the private fleet or an external carrier, time-windows, multi-trip, and loading sequences. We propose a mixed-integer linear programming (MILP) model as well as a heuristic algorithm capable of finding the routes’ planning that minimizes the total transportation costs. The performance of the proposed methods is assessed by generated instances using the data obtained from the company."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Transportation optimization for the collection of end-of-life vehicles"]}]}],"canonical_facts":{"dc:creator":["Khabou, Ahmed"],"dc:date":["2019-07-26"],"dc:description":["Firms operating in the purchasing of end-of-life vehicles (ELVs) have significant challenges related to the fact that most of the purchased ELVs must be collected efficiently in order to minimize their transportation costs. In this project, we study a reverse logistics problem of a Canadian firm that collects ELVs from a group of dealers and accumulates them at its warehouse for part resale or recycling. This problem can be modeled as a vehicle routing problem (VRP) with different side-constraints. Although prior research has made several contributions to model and solve different variants of the VRP, the specific issue in this project considers solving a VRP with a new combination of constraints, such as customer assignment to the private fleet or an external carrier, time-windows, multi-trip, and loading sequences. We propose a mixed-integer linear programming (MILP) model as well as a heuristic algorithm capable of finding the routes’ planning that minimizes the total transportation costs. The performance of the proposed methods is assessed by generated instances using the data obtained from the company."],"dc:format":["application/pdf"],"dc:identifier":["INSERT-YOUR-LIBRARY-ID-HERE2394","https://espace.etsmtl.ca/id/eprint/2394/1/KHABOU_Ahmed.pdf","https://espace.etsmtl.ca/id/eprint/2394/2/KHABOU_Ahmed-web.pdf"],"dc:language":["en"],"dc:publisher":["École de technologie supérieure"],"dc:subject":["logistique inverse, problème de tournées de véhicules, heuristique, fenêtres de temps, flotte hétérogène, routes multiples, plusieurs transporteurs externes, séquences de chargement"],"dc:title":["Transportation optimization for the collection of end-of-life vehicles"],"dc:type":["Electronic Thesis or Dissertation"],"thesis:degree_discipline":["Mgpa"],"thesis:degree_level":["masters"],"thesis:degree_name":["Mémoire de maîtrise électronique"],"thesis:institution_name":["École de technologie supérieure"]},"updated_at":"2026-11-18T22:08:15Z"}