Multicommodity formulations for the prize collecting vehicle routing problem in the petrol industry
type: Distribution
access URL: https://hal.science/hal-00678568
format: HTML
issued: 2026-05-24T23:10:30.703839
modified: 2026-05-24T23:10:30.600674

test_moissonnage_selune
type: Agent

Multicommodity formulations for the prize collecting vehicle routing problem in the petrol industry
type: Dataset
contact point: Organization
  fn: CCSD
keyword: infoinfo-rocomputer-science-csoperations-research-mathoc
keyword: multiobjective
keyword: infocomputer-science-cs
keyword: selective-traveling-salesman
keyword: infoeu-reposemanticsreport
keyword: prize-collecting
keyword: reports
keyword: vehicle-routing-problem
landing page: https://hal.science/hal-00678568
description: The Mobile Oil Recovery (MOR) unit is a truck designed to pump marginal oil wells in a petrol field. The MOR optimization Problem (MORP) consists in optimizing both the oil extraction and the travel costs. In this article, we describe several formulations for the MORP using a single vehicle and we propose two formulations to the case where several vehicles are used. We strengthen the proposed formulations by taking advantage of the MORP characteristics, by improving the number of subtour elimination constraints and by using cuts. Computational results are presented for instances close to the reality and optimality is proved for instances with up to 200 nodes.
issued: 2026-05-24T23:10:30.637058
language: en
modified: 2026-05-24T23:10:30.637064