This paper reports on the modelling and solution of a large industrial combinatorial optimization problem using the ECL i PS e Constraint Logic Programming (CLP) platform. The problem is eet assignment: the assignment of a set of aircraft of diierent types to a predeened shedule of ights. A single underlying model was developed and solved in ECL i PS e. Three optimization methods were applied i...

The purpose of this article is to propose a perturbation metaheuristic for the Vehicle Routing Problem with Private fleet and Common carrier (VRPPC). This problem consists of serving all customers such in a way that 1) each customer is served exactly once either by a private fleet vehicle or by a common carrier vehicle, 2) all routes associated with the private fleet start and end at the depot,...

This paper presents a new sweep based heuristic for the fleet size and mix vehicle routing problem. This problem involves two kinds of decisions: the selection of a mix of vehicles among the available vehicle types and the routing of the selected fleet. The proposed algorithm first generates a large number of routes that are serviced by one or two vehicles. The selection of routes and vehicles ...