A Survey on the Vehicle Routing Problem and Its Variants

Kumar, Suresh Nanda; Panneerselvam, Ramasamy

doi:10.4236/iim.2012.43010

Cited by 229 publications

(141 citation statements)

References 47 publications

(46 reference statements)

Supporting

Mentioning

126

Contrasting

Unclassified

Order By: Relevance

“…Existem algumas variantes do problema de roteamento de veículos, formuladas a partir da natureza dos produtos transportados, da qualidade do serviço exigido e das características dos clientes e dos veículos. O problema de roteamento de veículos é NPcompleto (Lenstra e Rinnooy Kan, 1981) e, em decorrência, exemplos de grande porte não podem ser resolvidos de maneira ótima por métodos exatos, o que explica o grande número de algoritmos aproximados disponíveis na literatura (Toth e Vigo, 2002;Laporte 2009;Kumar e Panneerselvam, 2012).…”

Section: Referencial Teóricounclassified

Um modelo para a logística do abate do gado de corte

Ribeiro¹,

Oliveira²,

Filho³

2018

PODes

View full text Add to dashboard Cite

RESUMONeste artigo é apresentado um modelo matemático linear em variáveis inteiras para auxiliar o produtor rural a determinar a solução mais rentável, escolhendo o melhor frigorífico, a melhor estrada e o melhor caminhão para realizar o transporte das cabeças de gado para o abate. O modelo proposto leva em consideração a capacidade dos frigoríficos e dos caminhões disponíveis, bem como as diferentes rotas para efetuar o transporte do gado. Nos testes realizados, o modelo proposto foi resolvido pela versão gratuita do software LINGO. Os resultados obtidos foram superiores ou iguais àqueles fornecidos pelo método manual de tomada de decisão empregado pelos técnicos da fazenda.Palavras-chave: Transporte, Manejo, Bem-estar animal, Otimização. ABSTRACTThis paper presents a linear mathematical model in integer variables to help the rural producer to determine the most profitable solution, by choosing the best slaughter plant, the best road and the best truck to carry the livestock for slaughtering. The model proposed takes into account the capacity of the slaughter plants and trucks available, as well as the different routes to transport the cattle. In the tests performed, the model was solved by the free version of LINGO. The results obtained were better than or equal to those provided by the manual decision-making method used by the farm technicians.

show abstract

Section: Referencial Teóricounclassified

Um modelo para a logística do abate do gado de corte

Ribeiro¹,

Oliveira²,

Filho³

2018

PODes

View full text Add to dashboard Cite

show abstract

“…However, Golden et al (1977) used the term ''vehicle routing'' in the title of their paper for the first time. More information on this subject can be found in Toth and Vigo (2002) and Kumar and Panneerselvam (2012).…”

Section: Review Of the Literaturementioning

confidence: 99%

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Alinaghian

Zamanlou

Sabbagh

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

This paper introduces two-dimensional loading time-dependent vehicle routing problem and proposes a biobjective mathematical model. This problem assesses the process of distributing the rectangular-shaped demanded items over an urban environment; it does not, however, allow items to be loaded on top of each other. In addition to the above assumptions, the presented model also satisfies the first-in-first-out property in the timedependent vehicle routing problem. Given the NP-hard nature of the problem, a method called elitist nondominated sorting local search is developed to obtain its solutions. To evaluate the performance of the proposed algorithm, the solutions of this algorithm for small-scale problem instances are compared with the results of an exact method. For the medium-scale problem instances, results of NSGA-II and SPEA2 are used as the basis of comparison. The computational results demonstrate the good performance of the proposed method.

show abstract

“…[3][4][5] GAs achieve this through an evolutionary search on a population of randomly generated individuals over a number of generations (Fig. 2).…”

Section: Genetic Algorithmsmentioning

confidence: 99%

Naturally selecting solutions

2013

View full text Add to dashboard Cite

For decades, computer scientists have looked to nature for biologically inspired solutions to computational problems; ranging from robotic control to scheduling optimization. Paradoxically, as we move deeper into the postgenomics era, the reverse is occurring, as biologists and bioinformaticians look to computational techniques, to solve a variety of biological problems. One of the most common biologically inspired techniques are genetic algorithms (GAs), which take the Darwinian concept of natural selection as the driving force behind systems for solving real world problems, including those in the bioinformatics domain. Herein, we provide an overview of genetic algorithms and survey some of the most recent applications of this approach to bioinformatics based problems.

show abstract

A Survey on the Vehicle Routing Problem and Its Variants

Cited by 229 publications

References 47 publications

Um modelo para a logística do abate do gado de corte

Um modelo para a logística do abate do gado de corte

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Naturally selecting solutions

Contact Info

Product

Resources

About