Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem

DOI10.1007/978-3-540-87477-5_31zbMath1160.90655OpenAlexW1488000730MaRDI QIDQ3627705

Andréa Cynthia Santos, Christophe Duhamel, Dario José Aloise

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_31

zbMATH Keywords

vehicle routing problemmultiobjectiveprize-collecting

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (2)

Models and hybrid methods for the onshore wells maintenance problem ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem

Uses Software

• VRP

Cites Work

• Network flow models for the local access network expansion problem
• The selective travelling salesman problem
• Routing problems: A bibliography
• Multiobjective routing problems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• The Vehicle Routing Problem
• Integer Programming Formulation of Traveling Salesman Problems
• The prize collecting traveling salesman problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Unnamed Item

This page was built for publication: Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem