Ángel Felipe

Ángel Felipe

Auto-generated profile, based on publicly available information

Ángel Felipe

Department of Statistics and Operational Research, Complutense University of Madrid, 28040 Madrid, Spain

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2014 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
ÁFÁngel Felipe
Ángel Felipe
MOM. Teresa Ortuño
M. Teresa Ortuño
GRGiovanni Righini
Giovanni Righini
GTGregorio Tirado
Gregorio Tirado

1 November 2009 in Computers & Operations Research
Verified
Journal Article
Closed access
ÁFÁngel Felipe
Ángel Felipe
MOM. Teresa Ortuño
M. Teresa Ortuño
GTGregorio Tirado
Gregorio Tirado

1 January 2005 in Optics Express
Verified
Journal Article
Closed access
PDF file
ABA. G. Barriuso
A. G. Barriuso
JMJuan J Monzón
Juan J Monzón
Luis L. Sáchez SotoLuis L. Sáchez Soto
Luis L. Sáchez Soto
AFA. Felipe
A. Felipe
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.

26 January 2021 in Operations Research Forum
Verified
Journal Article
Open access
PDF file
ACAlberto Ceselli
Alberto Ceselli
ÁFÁngel Felipe
Ángel Felipe
MOM. Teresa Ortuño
M. Teresa Ortuño
GRGiovanni Righini
Giovanni Righini
GTGregorio Tirado
Gregorio Tirado
We provide an exact optimization algorithm for the electric vehicle routing problem with multiple recharge technologies. Our branch-and-cut-and-price algorithm relies upon a path-based formulation, where each column in the master problem represents a sequence of customer visits between two recharge stations instead of a whole route. This allows for massive decomposition, and parallel implementation of the pricing phase, exploiting the large number of independent pricing sub-problems. The algorithm could solve instances with up to thirty customers, nine recharge stations, five vehicles and three technologies to proven optimality. Near-optimal heuristic solutions were obtained with a general-purpose MIP solver from the columns generated at the root node.


1 May 2011 in European Journal of Operational Research
Verified
Journal Article
Closed access
AFAngel Felipe
Angel Felipe
MOM. Teresa Ortuño
M. Teresa Ortuño
GTGregorio Tirado
Gregorio Tirado