A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/53147 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/53147 |