A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem
Nine real-world problems that concerns the planning of bus services are solved. The problem is modeled as a variant of the Open Vehicle Routing Problem. The objective is to minimize the makespan instead of the total cost. A competitive multi-start algorithm is proposed. A specific local search for the considered problem is proposed.
multi-start algorithm open vehicle routing problem local search algorithm