EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2050. The one-commodity pickup and delivery location routing problem
Invited abstract in session MC-25: Discrete, continuous or stochastic optimization and control in networks, transportation and design III, stream Combinatorial Optimization.
Monday, 12:30-14:00Room: 011 (building: 208)
Authors (first author is the speaker)
| 1. | Inmaculada Rodríguez Martín
|
| Matemáticas, Estadística e Investigación Operativa, Universidad de La Laguna | |
| 2. | Bencomo Domínguez-Martín
|
| University of La Laguna | |
| 3. | Hipólito Hernández-Pérez
|
| Estadística e Investigación Operativa, Universidad de La Laguna (Tenerife) | |
| 4. | Jorge Riera-Ledesma
|
| University of La Laguna |
Abstract
The One-commodity Pickup and Delivery Location Routing Problem (1-PDLRP) is a new problem that combines characteristics of the Location and Routing Problem and the One-commodity Pickup and Delivery Traveling Salesman Problem. We are given a set of customers that provide or demand given amounts of a product, and a set of potential facility locations that can be opened or not in order to give service to the customers. Each facility has an opening cost and is the depot of a vehicle. The problem consists in deciding which facilities to open, assigning customers to open facilities, and designing the routes that connect each facility with its customers. The objective is to minimize the sum of the cost of the routes and the facilities. This NP-hard problem has not been previously studied. We propose for it two mathematical formulations, compare them, and present a branch-and-cut algorithm able to solve instances with up to 100 nodes.
Keywords
- Transportation
- Location
- Branch and Cut
Status: accepted
Back to the list of papers