A Constraint-Based Local Search for Offline and Online General Vehicle Routing.

Vehicle routing is a class of combinatorial optimization problems arising in the industry of transportation and logistics. The goal of these problems is to compute an optimal route plan for a set of vehicles for serving transport requests of customers. There are many variants of the vehicle routing problems: routing for delivering goods, routing for demand responsive transport (taxi, school bus, ...). Each problem might have different constraints, objectives. In this paper, we introduce a Constraint-Based Local Search (CBLS) framework for general offline and online vehicle routing problems. We extend existing neighborhood structures in the literature by proposing new neighborhoods to facilitate the resolution of different class of vehicle routing problems in a unified platform. A novel feature of the framework is the available APIs for online vehicle routing problems where requests arrive online during the execution of the computed route plan. Experimental results on three vehicle routing problems (the min-max capacitated vehicle routing problem, the multi-vehicle covering tour problem, and the online people-andparcel share-a-ride taxis problem) show the modelling flexibility, genericity, extensibility and efficiency of the proposed framework. [ABSTRACT FROM AUTHOR]

Copyright of International Journal on Artificial Intelligence Tools is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)