A POPMUSIC matheuristic for the capacitated vehicle routing problem

Título:

A POPMUSIC matheuristic for the capacitated vehicle routing problem

Autor:

Eduardo Uchoa Barboza

Ano:

2021

DOI:

10.1016/j.cor.2021.105475

Revista:

Computers & Operations Research

ISSN:

03050548

Home:

[doi:10.1016/j.cor.2021.105475]

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

New Benchmark Instances for the Capacitated Vehicle Routing Problem

A review on optimization methods for workforce planning in electrical distribution utilities

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

Classification of the teams in the Brazilian Soccer Championship by probabilistic criteria composition

Selecting Attributes for Clustering the Brazilian Soccer Clubs

Cover by Disjoint Cliques Cuts for the Knapsack Problem with Conflicting Items

Enhanced Branch-Cut-and-Price algorithm for Heterogeneous Fleet Vehicle Routing Problems

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem

Column generation approaches for the software clustering problem