Metaheuristics With Random Keys And Local Search For The Vehicle Routing Problem With Private Fleet And Common Carrier

Metaheuristics With Random Keys And Local Search For The Vehicle Routing Problem With Private Fleet And Common Carrier

Author Higino, William Autor UNIFESP Google Scholar
Advisor Chaves, Antonio Augusto Autor UNIFESP Google Scholar
Institution Universidade Federal de São Paulo (UNIFESP)
Graduate program Pesquisa Operacional
Abstract The Vehicle Routing Problems (Vrps) Have Been Target Of A High Number Of Studies In The Operational Research Area, Given Its Applicability On Several Fields. Among Its Categories Are The Vehicle Routing Problems With Profits. Those Problems Are Characterized By The Lack Of Obligatoriness In The Service Of All Customers. Instead, A Profit Or Prejudice Rate To The Service Of Each Customer Is Defined. This Category Presents The Vehicle Routing Problem With Private Fleet And Common Carrier (Vrppfcc). In This Problem, Besides The Traditional Vehicle Routing To Serve Customers, Considering Demand And Capacity, There Is The Possibility Of Outsourcing Partly The Service, Considering The Profitability In Such Process. This Study Applies Two Meta-Heuristics Based On Random Keys, Biased Random Keys Genetic Algorithm (Brkga) And Unified Marginal Distribution Algorithm (Umda) On The Solution Of The Vrppfcc. It Also Combines Such Meta-Heuristics With Variations Of Random Variable Neighborhood Descent (Rvnd), Self-Adaptive

The Vehicle Routing Problems (Vrps) Have Been Target Of A High Number Of Studies In The Operational Research Area, Given Its Applicability On Several Fields. Among Its Categories Are The Vehicle Routing Problems With Profits. Those Problems Are Characterized By The Lack Of Obligatoriness In The Service Of All Customers. Instead, A Profit Or Prejudice Rate To The Service Of Each Customer Is Defined. This Category Presents The Vehicle Routing Problem With Private Fleet And Common Carrier (Vrppfcc). In This Problem, Besides The Traditional Vehicle Routing To Serve Customers, Considering Demand And Capacity, There Is The Possibility Of Outsourcing Partly The Service, Considering The Profitability In Such Process. This Study Applies Two Meta-Heuristics Based On Random Keys, Biased Random Keys Genetic Algorithm (Brkga) And Unified Marginal Distribution Algorithm (Umda) On The Solution Of The Vrppfcc. It Also Combines Such Meta-Heuristics With Variations Of Random Variable Neighborhood Descent (Rvnd), Self-Adaptive
Keywords Routing
Genetic Algothims
Umda
Roteamento De Veículos
Algoritmos Genéticos
Algoritmo De Distribuição Marginal Univariada
Language English
Date 2018-02-23
Research area Métodos De Otimização
Knowledge area Engenharias
Publisher Universidade Federal de São Paulo (UNIFESP)
Origin https://sucupira.capes.gov.br/sucupira/public/consultas/coleta/trabalhoConclusao/viewTrabalhoConclusao.jsf?popup=true&id_trabalho=6384168
Access rights Closed access
Type Dissertation
URI https://repositorio.unifesp.br/handle/11600/52341

Show full item record




File

File Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Search


Browse

Statistics

My Account