Soares Brandão

Ph.D in Management Science - Operational Research (Lancaster University)

Department of Management

Associate Professor with Habilitation

sbrandao@eeg.uminho.pt

253604552 , 253604550

Campus de Gualtar - Edificio 8 - 2.28

ORCID

Vehicle routing

heuristics and metaheuristics

logistics

decision support systems

Selected publications

Brandão, J. C. S. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers and Operations Research, 38(1), 140–151. DOI

Brandão, J. C. S. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 195(3), 716–728. DOI

Brandão, J. C. S., & Eglese, R. W. (2008). A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research, 35(4), 1112–1126. DOI

Brandão, J. C. S. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173(2), 540–555. DOI

Brandão, J. C. S. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157(3), 552–564. DOI

Other publications

Brandão, J. (2018). Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Computers and Industrial Engineering, 120, 146–159. DOI

Brandão, J. (2018). Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows. In R. B. Natalia Kliewer Jan Fabian Ehmke (Ed.), Operations Research Proceedings 2017 (pp. 413–418). Springer. DOI

Brandão, J. (2016). A deterministic iterated local search algorithm for the vehicle routing problem with backhauls. TOP, 24(2), 445–465. DOI

Brandão, J. C. S. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers and Operations Research, 38(1), 140–151. DOI

Brandão, J. C. S. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 195(3), 716–728. DOI

Brandão, J. C. S., & Eglese, R. W. (2008). A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research, 35(4), 1112–1126. DOI

Brandão, J. C. S. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173(2), 540–555. DOI

Crispim, J., & Brandão, J. (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problem with backhauls. Journal of the Operational Research Society, 56(11), 1296–1302. DOI

Brandão, J. C. S. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157(3), 552–564. DOI

Brandao, J. (2002). A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem. In C. Ribeiro & P. Hansen (Eds.), Essays and Surveys in Metaheuristics (Vol. 15, pp. 151–168). New York City, USA: Elsevier / Kluwer / North Holland. DOI

J., B. (1999). Metaheuristic for the Vehicle Routing Problem with Time Windows. In S. Voß, S. Martello, I. H. Osman, & C. Roucairol (Eds.), Meta-Heuristics – Advances and Trends in Local Search Paradigms for Optimization (1st ed., pp. 19–36). New York City, USA: Springer US. DOI

J., B., & A., M. (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society, 49(8), 799–805. DOI

Brandão, J. C. S. (1997). Descrição de um Novo Algoritmo para o Problema de Escalonamento e Roteamento de Veículos e Análise Comparativa do seu Desempenho. Investigação Operacional, 17, 163–178. DOI

+ publications

Inventories Management

Bachelor

Operational Research for Management

Bachelor

Meta-Heuristics

Doctorate

Useful links

School of Economics and Management

Campus de Gualtar

Informations

Social media