• Graduate Programs
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Development Economics
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • The Economics of Crime
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Inequalities in Health and Healthcare
      • Marketing Research with Purpose
      • Markets with Frictions
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Tinbergen Institute Lectures
    • 2026 Tinbergen Institute Opening Conference
    • Annual Tinbergen Institute Conference
  • News
  • Summer School
    • Applied Public Policy Evaluation
    • Deep Learning
    • Development Economics
    • Economics of Blockchain and Digital Currencies
    • Economics of Climate Change
    • The Economics of Crime
    • Foundations of Machine Learning with Applications in Python
    • From Preference to Choice: The Economic Theory of Decision-Making
    • Inequalities in Health and Healthcare
    • Marketing Research with Purpose
    • Markets with Frictions
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
    • Tuition Fees and Payment
  • Alumni

Lopez-Sanchez, A., Hernandez-Diaz, A., Vigo, D., Caballero, R. and Molina, J. (2014). A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem European Journal of Operational Research, 238(1):104--113.


  • Journal
    European Journal of Operational Research

The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. {\textcopyright} 2014 Elsevier B.V. All rights reserved.