Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
Abstract: The Mobile Oil Recovery (MOR) unit is a truck able to pump marginal wells in a petrol field. The goal of the MOR optimization Problem (MORP) is to optimize both the oil extraction and the travel costs. We describe several formulations for the MORP using a single vehicle or a fleet of vehicles. We have also strengthened them by improving the subtour elimination constraints. Optimality is proved for instances close to reality with up to 200 nodes.
Keywords: Vehicle routing problem, prize-collecting, multiobjective.
Category 1: Applications -- OR and Management Sciences (Transportation )
Category 2: Integer Programming ((Mixed) Integer Linear Programming )
Citation: Communications in Computer and Information Science (CCIS). H. A. Le Thi, P.Bouvry, and T. Pham Dinh Editors, Springer, vol. 14, pages 283-292, 2008.
Entry Submitted: 02/06/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|