Publications
]
.
2005. An algorithm for generating spanning trees of a graph in order of increasing cost. Pesquisa Operacional. 25:219–229.
.
2005. The validity of aggregation in the study of unreliable continuous transfer lines. Journal of Statistics & Management Systems. 8:27–37.
.
2005. { MA$|$PM}: memetic algorithms with population management. Computers and Operations Research. 33:1214–1225. Download: mapm.pdf (209.91 KB)
.
2006. Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics. Central European Journal of Operational Research. 14:193–207.
.
2007. Distance measures based on the edit distance for permutation-type representations. Journal of Heuristics. 13:35–47.
.
2007. Multi-objective optimization of mobile phone keymaps for typing messages using a word list. European Journal of Operational Research. 179:838–846.
.
2007. A verification method for the simulation of supply chain networks with unreliable links. International Journal of Simulation: Systems, Science and Technology. 8:39–47.
.
2008. Investigation of practical robust and flexible decisions for facility location problems using tabu search and simulation. Journal of the Operational Research Society. 59:624–636.
.
2008. Stimulating information sharing, collaboration and learning in operations research with {libOR}. International Journal on Digital Libraries. 8:79–90.
.
2009. A Practical approach for robust and flexible vehicle routing using metaheuristics and {Monte Carlo} sampling. Journal of Mathematical Modelling and Algorithms. 8 Download: robustvrp.pdf (229.61 KB)
.
2009. Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. Computers & Operations Research. Accepted for publication Download: teleatlas.pdf (182.07 KB)
.
2009. Supporting {3PL} decisions in the automotive industry by generating diverse solutions to a large-scale location–routing problem. Operations Research. 57:1058–1067. Download: loc-rout-decsupport.pdf (442.87 KB)
.
2009. An Upper Bound on the Cycle Time of a Stochastic Marked Graph Using Incomplete Information on the Transition Firing Time Distributions. Mathematical and Computer Modeling. 49:563–572. Download: smg.pdf (163.7 KB)
.
2009. A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation and time trends. Journal of Statistical Planning and Inference. 139:30–44. Download: 00112294.pdf (489.25 KB)
.
2010. An efficient metaheuristic to improve accessibility by rural road network planning. Electronic Notes in Discrete Mathematics. 36:631–638.
.
2010. Production Control in a Failure Prone Manufacturing Network using Discrete Event Simulation and Automated Response Surface Methodology. International Journal of Advanced Manufacturing Technology. Accepted for Publication
.
2010. A solution approach to find the critical path in a time-constrained activity network. Computers & Operations Research. 37:1557–1569.
.
2010. Metaheuristics for Planning in Logistics: From Theory to Industrial Applications. Faculty of Applied Economics, University of Antwerp. PhD Abstract
Download: phdps.pdf (1.1 MB)
.
2010. Credit Rating Prediction Using Ant Colony Optimization. Journal of the Operational Research Society. 61:561-573.
.
2010. From Linear to Non-linear Kernel Based Classifiers for Bankruptcy Prediction. Neurocomputing. 73(16):2955-2970.
.
2010. An Overview and Framework for PD Backtesting and Benchmarking. Journal of the Operational Research Society. 61:359-373.
.
2011. Sustainable supply chains through flexible horizontal collaboration – Empirical evidence supporting the need for supply chain orchestration. Submitted for publication.
.
2011. Building comprehensible customer churn prediction models with advanced rule induction techniques. Expert Systems with Applications. 38(3):2354-2364.