Welcome to cgopt

This cgopt website allows you to run the branch-price-and-cut algorithm presented in the paper Rostami et al. (2019) that can solve exactly instances of the vehicle routing problem with stochastic and correlated traveling times. You can solve the instances used for this paper (which are available here) or your own instances. A maximum time limit of 2 hours in the adjacent case and of 5 hours in the general case is imposed for each instance. Because at most one user can run a job at the same time, a maximum of 100 instances can be submitted in a single project.

The runs are executed on a Linux PC equipped with an Intel Xeon processor E3-1226 v3 clocked at 3.3GHz (a single core is used) and a 16Gb RAM. Moreover, CPLEX 12.6.3.0 is used to solve all restricted master problems. Note that this computer slightly differs from the one used for the paper.

Reference: B. Rostami, G. Desaulniers, F. Errico, A. Lodi (2019), Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times, under revision in Operations Research.

Please sign up for an account to use this website.